Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
IEEE Transactions on Parallel and Distributed Systems
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Using Location Information to Improve Routing in Ad Hoc Networks
Using Location Information to Improve Routing in Ad Hoc Networks
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Abstract隆陋 Position based routing methods have been used successfullyrecently for homogeneous wireless networks when all nodeshave the same transmission range, and the signal will be received byall nodes with the transmission range. All these protocols are likelyto fail for heterogeneous wireless ad hoc networks, or the signal couldbe blocked by obstacles. In this paper we assume that two nodescan always communicate directly if their distance is no more than{{\sqrt 2 } \over 2}R, where R is the maximum transmission range. A method hasbeen proposed in [1] to construct a planar topology using some virtuallinks for some routing protocols, such as [4], [9]. We present animproved method to construct another planar topology and our simulationsshow that our protocol out-performs the previous method fordense networks signicantly: it uses much less messages and createsmuch less virtual links, while the routing performances of our methodis almost the same as the previous method.