Communication in disconnected ad hoc networks using message relay

An ad hoc network is formed by a group of mobile hosts upon a wireless network interface. Previous research in communication in ad hoc networks has concentrated on routing algorithms which are designed for fully connected networks. The traditional approach to communication in a disconnected ad hoc network is to let the mobile computer wait for network reconnection passively. This method may lead to unacceptable transmission delays. We propose an approach that guarantees message transmission in minimal time. In this approach, mobile hosts actively modify their trajectories to transmit messages. We develop algorithms that minimize the trajectory modifications under two different assumptions: (a) the movements of all the nodes in the system are known and (b) the movements of the hosts in the system are not known.

[1]  Richard C. T. Lee,et al.  Minimum Spanning Trees of Moving Points in the Plane , 1991, IEEE Trans. Computers.

[2]  Sajal K. Das,et al.  Performance Analysis of a Parallel PCS Network Simulation , 1999, HiPC.

[3]  Sajal K. Das,et al.  Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks , 2001, MSWIM '01.

[4]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[5]  Qun Li,et al.  Online power-aware routing in wireless Ad-hoc networks , 2001, MobiCom '01.

[6]  Leonidas J. Guibas,et al.  Proximity problems on moving points , 1997, SCG '97.

[7]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[8]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[9]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

[10]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[11]  Tomasz Imielinski,et al.  Location Management for Networks with Mobile Users , 1994, Mobidata.

[12]  George Cybenko,et al.  AGENT TCL: Targeting the Needs of Mobile Computers , 1997, IEEE Internet Comput..

[13]  Stephan Olariu,et al.  Randomized Leader Election Protocols in Radio Networks with No Collision Detection , 2000, ISAAC.

[14]  Ajoy Kumar Datta,et al.  Randomized mobile agent based routing in wireless networks , 2000, SIROCCO.

[15]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[16]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[17]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[18]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[19]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[20]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[21]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[22]  Azzedine Boukerche,et al.  Analysis of a Randomized Congestion Control Scheme with DSDV Routing in ad Hoc Wireless Networks , 2001, J. Parallel Distributed Comput..

[23]  Christopher Rose,et al.  Wireless subscriber mobility management using adaptive individual location areas for PCS systems , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[24]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[25]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.