Properties of some Euclidean proximity graphs
Pattern Recognition Letters
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
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation
IEEE Transactions on Parallel and Distributed Systems
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry CCCG02
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
SIAM Journal on Discrete Mathematics
NB-FACE: No-Beacon FACE Ad-hoc Routing Protocol for Reduction of Location Acquisition Overhead
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Lazy cross-link removal for geographic routing
Proceedings of the 4th international conference on Embedded networked sensor systems
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Approximate MST for UDG locally
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
IEEE Journal on Selected Areas in Communications
Mobile Networks and Applications
Hi-index | 0.00 |
Beaconless georouting algorithms are fully reactive and work without prior knowledge of their neighbors. However, existing approaches can either not guarantee delivery or they require the exchange of complete neighborhood information. We describe two general methods for completely reactive face routing with guaranteed delivery. The Beaconless Forwarder Planarization (BFP) scheme determines correct edges of a local planar subgraph without hearing from all neighbors. Face routing then continues properly. Angular Relaying determines directly the next hop of a face traversal. Both schemes are based on the Select-and-Protest principle. Neighbors respond according to a delay function, but only if they do not violate a planar subgraph condition. Protest messages are used to remove falsely selected neighbors that are not in the planar subgraph. We show that a correct beaconless planar subgraph construction is not possible without protests. We also show the impact of the chosen planar subgraph on the message complexity. With the new Circlunar Neighborhood Graph (CNG) we can bound the worst case message complexity of BFP, which is not possible when using the Gabriel graph (GG) for planarization. Simulation results show similar message complexities in the average case when using CNG and GG. Angular Relaying uses a delay function that is based on the angular distance to the previous hop. We develop a theoretical framework for delay functions and show both theoretically and in simulations that with a function of angle and distance we can reduce the number of protests by a factor of 2 compared to a simple angle-based delay function.