GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Unmanaged Internet Protocol: taming the edge network management crisis
ACM SIGCOMM Computer Communication Review
An underlay strategy for indirect routing
Wireless Networks - Special issue: Pervasive computing and communications
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
Exploiting the synergy between peer-to-peer and mobile ad hoc networks
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
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
| Hi-index | 0.00 |
Our recently proposed scalable source routing (SSR) protocol combines source routing in the physical network with Chord-like routing in the virtual ring that is formed by the address space. Thereby, SSR provides self-organized routing in large unstructured networks of resource-limited devices. Its ability to quickly adapt to changes in the network topology makes it suitable not only for sensor-actuator networks but also for mobile ad-hoc networks. Moreover, SSR directly provides the key-based routing semantics, thereby making it an efficient basis for the scalable implementation of self-organizing, fully decentralized applications. In this paper we review SSR's self-organizing features and demonstrate how the combination of virtual and physical structures leads to emergence of stability and efficiency. In particular, we focus on SSR's resistance against node churn. Following the principle of combining virtual and physical structures, we propose an extension that stabilizes SSR in face of heavy node churn. Simulations demonstrate the effectiveness of this extension.