Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Minimizing interference of a wireless ad-hoc network in a plane
Theoretical Computer Science
OLSR performance measurement in a military mobile ad hoc network
Ad Hoc Networks
| Hi-index | 0.00 |
We consider the geometric routing problem on mobile adhoc wireless networks such that we can send packets by only using local information at each node. We design a novel routing algorithm named directional routing algorithm by using random local neighbors such that the information can be efficiently maintained if each node dynamically changes its position. In our scheme, the number of hops and the number of transmissions issued during the routing process are both very small. No centralized control is necessary: The network is implicitly stored and maintained in a distributed fashion at each node using O (1) space, and constructed only using local information in transmission disk of each node. Using this network, we give the first geometric routing with nontrivial theoretical performance gurantee.