Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
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
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
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
Geographic routing for wireless networks
Geographic routing for wireless networks
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Proceedings of the 1st international conference on Embedded networked sensor systems
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
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Beacon vector routing: scalable point-to-point routing in wireless sensornets
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
Communicating via fireflies: geographic routing on duty-cycled sensors
Proceedings of the 6th international conference on Information processing in sensor networks
An architecture for seamless mobility in spontaneous wireless mesh networks
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Binary waypoint geographical routing in wireless mesh networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
A framework for multi-robot node coverage in sensor networks
Annals of Mathematics and Artificial Intelligence
Interference-aware geographical routing for sensor-nets in indoor environments
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
An energy-aware geographic routing algorithm for mobile ad hoc network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Simple and efficient geographic routing around obstacles for wireless sensor networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Topology control and geographic routing in realistic wireless networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Covering space for in-network sensor data storage
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications
IEEE/ACM Transactions on Networking (TON)
Efficient greedy geographical non-planar routing with reactive deflection
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Adaptive geographic routing in wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Practical 3D geographic routing for wireless sensor networks
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
A localized link removal and addition based planarization algorithm
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Reactive traffic-aware routing strategy for urban vehicular environments
International Journal of Ad Hoc and Ubiquitous Computing
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Geographic techniques promise highly scalable any-to-any routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, distributed graph planarization. Arguing that such planarization techniques have high overhead, researchers have more recently pursued a thread in which they propose precomputation of routing structures (e.g., hull trees and grids) to achieve low-overhead geographic routing.In this paper we introduce a third approach, LCR, that does not involve any precomputation of distributed routing structures, nor full a priori planarization. Instead, LCR removes non-planarities lazily only when they interfere with correct geographic routing. Lazy removal of link crossings results in an order of magnitude or more lower overhead than any previously proposed approach.