Wireless Control of a Multihop Mobile Robot Squad UoC Lab. 임 희 성.

Slides:



Advertisements
Similar presentations
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Advertisements

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.
Ad Hoc Wireless Routing COS 461: Computer Networks
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Research Paper By V. D. Park and M. S. Corson.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
Security and QoS Self-Optimization in Mobile Ad Hoc Networks ZhengMing Shen and Johnson P. Thomas Presented by: Sharanpal singh.
Mobile Adhoc Network: Routing Protocol:AODV
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Wireless Sensor Networks COE 499 Energy Aware Routing
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.
Security in Ad Hoc Networks. What is an Ad hoc network? “…a collection of wireless mobile hosts forming a temporary network without the aid of any established.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
Implementation of Collection Tree Protocol in QualNet
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
BLACK HOLE ATTACK AND ITS COUNTER MEASURES IN AODV ROUTING PROTOCOL Varsha Patidar, Rakesh Verma Mengfei Peng.
Differential Ad Hoc Positioning Systems Presented By: Ramesh Tumati Feb 18, 2004.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Ad Hoc Network.
Scalable Routing Protocols for
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Autonomous prototype sensors (motes) 4 MHz, 8bit MCU, 4 KB RAM, 8KB ROM short-range (1-10ft.) radio light and other sensors LED and serial port outputs.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
Straight Line Routing for Wireless Sensor Networks Cheng-Fu Chou, Jia-Jang Su, and Chao-Yu Chen Computer Science and Information Engineering Dept., National.
Mobile Ad Hoc Networks. What is a MANET (Mobile Ad Hoc Networks)? Formed by wireless hosts which may be mobile No pre-existing infrastructure Routes between.
Routing Metrics for Wireless Mesh Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Routing Metrics for Wireless Mesh Networks
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
A comparison of Ad-Hoc Routing Protocols
Sensor Network Routing
Net 435: Wireless sensor network (WSN)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
by Saltanat Mashirova & Afshin Mahini
Routing Metrics for Wireless Mesh Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Vinay Singh Graduate school of Software Dongseo University
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Wireless Control of a Multihop Mobile Robot Squad UoC Lab. 임 희 성

Introduction WMMRC(Wireless, mobile, multihop robot control) - Without any fixed network infrastructure - Freely and dynamically self-organize - Communicate with each other using the multihop capabilities of the neighbor nodes (when nodes are not within proximity) - Leader : Control the actions of the squadron Collect the position information & Transmit movement commands

Introduction Single Leader - Number of hops between leader and all the robots Multiple Path - Increase in the robustness of wireless control system - Not beneficial if all the nodes are moving

Communication Constrained Control

Wireless Communication - Control packet & Measurement packet - A Controller cannot act in real-time, if information is late or missing ∴ To cope with the dynamic nature of mobile networks, new theory is required. State feedback controller Communication Constrained Control

PID-Controller Tuning for Delay Jitter Jitter margin theorem - Amount of additional delay that a control system can tolerate without becoming unstable - Regular controller can be tuned to tolerate additional delay caused by the communication in a networked control loop - PID Controller :

State estimation with Regular control - To use an estimator to estimate the output of the controlled process during packet drops caused by the network - Kalman Filter : Efficient recursive filter that estimates the state of a linear dynamic system from a series of noisy measurements - If a packet is dropped, the output is predicted using only the process model PID-Controller Tuning for Delay Jitter

Efficient routing protocol - Be capable of establishing and maintaining a path between a source and a destination - Keep the overhead and memory requirement low - To minimize both the number of path losses and the length of recovery Routing Protocol and Prioritization

Single routing protocol (AODV : Ad hoc on-demand distance vector) - Try to find a route with the shortest distance - Establish only when there is information to be sent from one node to the other - Maintain as long as they are required for communication Multipath routing protocol (LMNR : Localized multiple nexthop routing protocol) - Extend to the AODV for multiple loop-free and link-disjoint paths - Use cost function and enable each node to choose from multiple available paths based on the cost Routing Protocol and Prioritization

Broadcast-type routing protocol (SIRP : Sink initiated routing protocol) - Similarly to LMNR(multiple paths to the leader) - Proactive protocol - Limit network-wide initialization to the squad leader - Broadcast interval is an important parameter Routing Protocol and Prioritization

Prioritization - Genuine requirement in many sensor network application - Relax controller design requirements by equalizing packet delays for a different number of hops Our Proposal - Forwarded hop-based prioritization strategy - The prioritization of a packet is increased for every hop - Base on distance traveled

Simulation

Constitution - WMMRC simulation case on PiccSIM - Consist of a group of wireless, mobile robots, collaborating in an ad hoc fashion - Each robot localizes itself and sends its position information to the leader robot - The leader then calculates the desired path and sends control signals - Squad of 25 robots / Equip with and IEEE radio module / Communicate only with its nearest neighbors / Speed of robots depends on the control(less than 1.5m/s) - Ricean Propagation model Simulation

ISE(Integral of square error) - The ISE cost is a measure for the tracking error of the robots - Calculate as the integral of the squared difference between the desired robot location and the actual location, summed over all the robots - The cost is calculated as an average of only the instances when the communication link is working Simulation

Results

- Multipath routing decreases the network performance - Multipath routing(LMNR) has slower recovery from link breaks compared to single path(AODV) ∵ All the robots are moving - In light of network performance, AODV better than LMNR, and SIRP has the worst performance although its routing overhead is lowest of all of them - Using prioritization, the control cost is smaller for both control structures Results

Conclusion