The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
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
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
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
Indirect Routing Using Distributed Location Information
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 1st international conference on Embedded networked sensor systems
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
A reliability-based framework for multi-path routing analysis in mobile ad-hoc networks
International Journal of Communication Networks and Distributed Systems
Scalable landmark flooding: a scalable routing protocol for WSNs
Proceedings of the 5th international student workshop on Emerging networking experiments and technologies
PROSE: scalable routing in MANETs using prefix labels and distributed hashing
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
NODRoP, nature optimized deferred routing protocol
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
An improved AODV routing protocol for MANETs
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Hierarchical network protocol for large scale wireless sensor networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Cluster-based lookup service with global hashing in mobile ad hoc networks
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Multipath geographic routing using false destinations
International Journal of Communication Networks and Distributed Systems
Hashing-based lookup service with multiple anchor cluster distribution system in MANETs
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part IV
Associative routing for wireless sensor networks
Computer Communications
Journal of Network and Computer Applications
Onto scalable Ad-hoc networks: Deferred Routing
Computer Communications
Journal of Computer and System Sciences
Scalability and routing performance of future autonomous networks
International Journal of Internet Protocol Technology
An Efficient and Scalable Routing for MANETs
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
It is well known that the current ad hoc protocol suites do not scale to work efficiently in networks of more than a few hundred nodes. Most current ad hoc routing architectures use flat static addressing and thus, need to keep track of each node individually, creating a massive overhead problem as the network grows. Could dynamic addressing alleviate this problem? In this paper, we argue that the use of dynamic addressing can enable scalable routing in ad hoc networks. We provide an initial design of a routing layer based on dynamic addressing, and evaluate its performance. Each node has a unique permanent identifier and a transient routing address, which indicates its location in the network at any given time. The main challenge is dynamic address allocation in the face of node mobility. We propose mechanisms to implement dynamic addressing efficiently. Our initial evaluation suggests that dynamic addressing is a promising approach for achieving scalable routing in large ad hoc and mesh networks.