Abstract?? 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. In this paper we assume that two nodes can always communicate directly if their distance is no more than {{\sqrt 2 } \over 2}R, where R is the maximum transmission range. A method has been proposed in [1] to construct a planar topology using some virtual links for some routing protocols, such as [4], [9]. 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 signicantly: 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.
Index Terms:
Localized routing, planar structure, wireless ad hoc networks
Citation:
Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li, "Position-Based Routing for Heterogeneous Wireless Ad Hoc Networks," icdcsw, vol. 6, pp.710-715, 24th International Conference on Distributed Computing Systems Workshops - W6: WWAN (ICDCSW'04), 2004