Connectivity-through-time protocols for dynamic wireless networks to support mobile robot teams

Mobile robot teams are increasingly deployed in various applications involving remote operations in unstructured environments that do not support wireless network infrastructures. We propose a class of protocols based on the connectivity-through-time concepts that exploit the robot movements to extend the traditional notions of network connectivity. These protocols enable the formation of adhoc networks of mobile robots without the infrastructure of access points by utilizing the robots as routers. These protocols are implemented as a collection of daemons that track connectivity changes, compute single and multiple hop connectivity, route the packets via robots with suitable buffering, and adapt the transport parameters to the connection characteristics. The implementation employs UDP with window-based flow control that is tuned to the nature of connections. We present experimental performance results based on our implementation on robot teams to illustrate the salient features of this approach.

[1]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[2]  William Stallings,et al.  Wireless Communications and Networks , 2001, 2020 International Conference on Smart Systems and Technologies (SST).

[3]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[4]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[5]  Gregory J. Pottie,et al.  Instrumenting the world with wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[6]  J. Davenport Editor , 1960 .

[7]  Lynne E. Parker,et al.  Robot Teams: From Diversity to Polymorphism , 2002 .

[8]  Sridhar Radhakrishnan,et al.  DST-A routing protocol for ad hoc networks using distributed spanning trees , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[9]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[10]  M. S. Corson,et al.  A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[11]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[12]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[13]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .