Computational geometry: an introduction
Computational geometry: an introduction
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
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
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing for wireless networks
Geographic routing for wireless networks
On the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Practical and robust geographic routing in wireless networks
SenSys '04 Proceedings of the 2nd 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
A Generalization of the Face Routing
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
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
International Journal of Ad Hoc and Ubiquitous Computing
IEEE Transactions on Mobile Computing
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Geometric spanners for routing in mobile networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
In mobile ad hoc and sensor networks, greedy-face-greedy (GFG) geographic routing protocols have been a topic of active research in recent years. Most of the GFG geographic routing protocols make an ideal assumption that nodes in the network construct a unit-disk graph, UDG, and extract a planar subgraph from the UDG for face routing. However, the assumption of UDG may be violated in realistic environments, which may cause the current GFG geographic routing protocols to fail. In this paper, we propose a Pre-Processed Cross Link Detection Protocol, PPCLDP, which extracts an almost planar subgraph from a realistic network graph, instead of a UDG, for face routing and makes the GFG geographic routing work correctly in realistic environments with obstacles. The proposed PPCLDP improves the previous work of Cross Link Detection Protocol, CLDP, with far less communication cost and better convergence time. Our simulation results show that the average communication cost and the average convergence time of PPCLDP are, respectively, 65% and 45% less than those of CLDP. This makes PPCLDP more desirable for mobile ad hoc and sensor networks.