A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
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
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Scalable geographic routing algorithms for wireless ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Geographic face routing protocols planarize the connectivity graph of a wireless network in a distributed manner and forward packets on the resulted planar topology with high reliability and low overhead. A preferable face routing protocol should provide both guaranteed packet delivery and efficient routing paths, which requires a flexible face switch algorithm adaptive to the network complexity. In this paper, we present a new face routing algorithm named GFRIS that offers both features by performing active probe to measure the face size and generate a unique face identification sequence -face ID. In GFRIS, face switch occurs only if the outgoing edge intersects the local minimum-destination line at a progressive location and the crossing edge is shared between two different faces. To avoid the severe performance penalty when an inefficient face traversal direction is selected on large faces, GFRIS uses the face size to trigger the bounded face traversal procedure as proposed earlier in GOAFR+. As multiple local minimum locations on a face will trigger bounded search repetitively, GFRIS employs a fast forward mode to bypass bidirectional search on the face, which leads to significantly improved path stretch performance. This paper provides a detailed performance comparison between GFRIS and the existing face routing algorithms including GFG, GPSR, GOAFR+ and GFG2. Simulation results show that, by using face ID to assist face switch and adaptively applying the normal and bounded face traversal rules according to the face size, GFRIS can achieve better routing efficiency with low control overhead compared to other protocols evaluated across a wide node density range.