A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Compact routing with minimum stretch
Journal of Algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Radio interferometric geolocation
Proceedings of the 3rd international conference on Embedded networked sensor systems
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Theory of semidefinite programming for Sensor Network Localization
Mathematical Programming: Series A and B
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
A survey and comparison on localisation algorithms for wireless ad hoc networks
International Journal of Mobile Communications
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Adaptive redundancy for data propagation exploiting dynamic sensory mobility
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Simple and efficient geographic routing around obstacles for wireless sensor networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
Hi-index | 0.00 |
In sensor networks, a key efficiency measure for routing protocols is the stretch of the computed paths, where the stretch is the ratio of the path length and the Euclidean distance covered. In the literature, many protocols have been evaluated via extensive simulations, and often come without any theoretical guarantees. For those whose performances are theoretically guaranteed there is an important gap between the theoretical predictions and the experimental results. The contribution of this paper is twofold. First, we give theoretical results that explain the observed efficiency of many of the algorithms proposed in the literature. Second, we propose ROAM2, a deterministic routing protocol, that requires a single bit of memory at each node and that ensures, with high probability (depending on the node distribution), that the paths have a constant stretch.