Position-based routing for heterogeneous wireless ad hoc networks

Position based routing methods have been used successfully recently for homogeneous wireless networks when all nodes have the same transmission range, and the signal will be received by all nodes with the transmission range. All these protocols are likely to fail for heterogeneous wireless ad hoc networks, or the signal could be blocked by obstacles. We assume that two nodes can always communicate directly if their distance is no more than (/spl radic/2/2)R, where R is the maximum transmission range. A method has been proposed in [L. Barriere, et al., (2001)] to construct a planar topology using some virtual links for some routing protocols, such as [P. Bose, et al., (1999)], [F. Kuhn, et al., (2003)]. We present an improved method to construct another planar topology and our simulations show that our protocol out-performs the previous method for dense networks significantly: it uses much less messages and creates much less virtual links, while the routing performances of our method is almost the same as the previous method.

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

[2]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[3]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[4]  Lali Barrière,et al.  Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.

[5]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[6]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

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

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

[9]  Xiang-Yang Li,et al.  dBBlue: low diameter and self-routing bluetooth scatternet , 2003, DIALM-POMC '03.

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

[11]  Xiang-Yang Li,et al.  Robust position-based routing for wireless ad hoc networks , 2005, Ad Hoc Networks.

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

[13]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[14]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[15]  Yi Pan,et al.  Design and analysis of wireless networks , 2005 .

[16]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[17]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[18]  Young Ko,et al.  Using Location Information to Improve Routing in Ad Hoc Networks , 1997 .