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
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Location updates for efficient routing in ad hoc networks
Handbook of wireless networks and mobile computing
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed 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
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
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
QoS-constrained core selection for group communication
Computer Communications
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
A geographic routing protocol utilizing link lifetime and power control for mobile ad hoc networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
AnyBody: a self-organization protocol for body area networks
Proceedings of the ICST 2nd international conference on Body area networks
Using tomography for ubiquitous sensing
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Specifying and Verifying Sensor Networks: An Experiment of Formal Methods
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Fast Geometric Routing with Concurrent Face Traversal
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Virtual surrounding face geocasting in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Directional controlled fusion in wireless sensor networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Centroid virtual coordinates - A novel near-shortest path routing paradigm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Auction Aggregation Protocols for Wireless Robot-Robot Coordination
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
GOAFR Plus-ABC: geographic routing based on adaptive boundary circle in MANETs
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Single-step creation of localized Delaunay triangulations
Wireless Networks
Routing in wireless networks with position trees
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Localized mobility control routing in robotic sensor wireless networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications
Realization of greedy anti-void routing protocol for wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Bypassing routing holes in WSNs with a predictive geographic greedy forwarding
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
IEEE/ACM Transactions on Networking (TON)
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
Greedy face routing with face identification support in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed geographic service discovery for mobile sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
S4: small state and small stretch compact routing protocol for large static wireless networks
IEEE/ACM Transactions on Networking (TON)
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Journal of Parallel and Distributed Computing
Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
A lower bound on greedy embedding in euclidean plane
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Concurrent face traversal for efficient geometric routing
Journal of Parallel and Distributed Computing
Neighbor-aware optimizing routing for wireless ad hoc networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Mesh-based sensor relocation for coverage maintenance in mobile sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Energy-efficient beaconless geographic routing in energy harvested wireless sensor networks
Concurrency and Computation: Practice & Experience
Probabilistic Forwarding Decision Scheme for Reliable Geocasting in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Incrementally upgradable data center architecture using hyperbolic tessellations
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this article is to clarify that this is not the truth in general. We show that specifically in relative neighborhood and Gabriel graphs recovery from a greedy routing failure is always possible without changing between any adjacent faces. Guaranteed delivery then follows from guaranteed recovery while traversing the very first face. In arbitrary graphs, however, a proper face selection mechanism is of importance since recovery from a greedy routing failure may require visiting a sequence of faces before greedy routing can be restarted again. A prominent approach is to visit a sequence of faces which are intersected by the line connecting the source and destination node. Whenever encountering an edge which is intersecting with this line, the critical part is to decide if face traversal has to change to the next adjacent one or not. Failures may occur from incorporating face routing procedures that force to change the traversed face at each intersection. Recently observed routing failures which were produced by the GPSR protocol in arbitrary planar graphs result from incorporating such a face routing variant. They cannot be constructed by the well known GFG algorithm which does not force changing the face anytime. Beside methods which visit the faces intersected by the source destination line, we discuss face routing variants which simply restart face routing whenever the next face has to be explored. We give the first complete and formal proofs that several proposed face routing, and combined greedyface routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs. We also discuss the reasons why other methods may fail to deliver a message or even end up in a loop.