The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A multicast-based protocol for IP mobility support
COMM '00 Proceedings of NGC 2000 on Networked group communication
Application-layer mobility using SIP
ACM SIGMOBILE Mobile Computing and Communications Review
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
Optimized Smooth Handoffs in Mobile IP
ISCC '99 Proceedings of the The Fourth IEEE Symposium on Computers and Communications
The design and implementation of Zap: a system for migrating computing environments
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The capacity of wireless networks
IEEE Transactions on Information Theory
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
A survey on wireless mesh networks
IEEE Communications Magazine
Mobile ad hoc networks - current approaches and future directions
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Most of the current topological based routing algorithms used in MANETs treat all the nodes in the network like independent peers, making them not scalable with respect to the number of nodes in the network. Since hierarchical routing techniques have been known to afford scalability in large networks (e.g. Internet), and taking advantage of the existence of scenarios in which the nodes of a MANET can be aggregated in a natural manner, we propose a two level hierarchical routing scheme for MANETs. In this paper we present the main components and an analytical performance evaluation of our proposal, with the number of control packets per second as the metric of our interest. The evaluation shows a significant overhead reduction from Θ(N2) to Θ(N). However, a trade-off between the # of nodes in the network and the complexity of the system has to be achieved.