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
An architecture for mobile radio networks with dynamically changing topology using virtual subnets
Mobile Networks and Applications - Special issue: mobility management
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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 performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Implicit source routes for on-demand ad hoc network routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
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
GS3: scalable self-configuration and self-healing in wireless networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Self Organized Terminode Routing
Cluster Computing
Anchored Path Discovery in Terminode Routing
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Halo: managing node rendezvous in opportunistic sensor networks
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
A Localized Computing Approach for Connectivity Improvement Analysis in Wireless Personal Networks
Wireless Personal Communications: An International Journal
Ad hoc node connectivity improvement analysis - Why not through mesh clients?
Computers and Electrical Engineering
Hi-index | 0.00 |
As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari's architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.