A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
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
Query localization techniques for on-demand routing protocols in ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE 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
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Scalable routing protocol for ad hoc networks
Wireless Networks
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Scalable AODV with efficient flooding based on on-demand clustering
ACM SIGMOBILE Mobile Computing and Communications Review
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Scalability study of the ad hoc on-demand distance vector routing protocol
International Journal of Network Management
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A new approach to on-demand loop-free routing in ad hoc networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Design and performance analysis of a proxy-based indirect routing scheme in ad hoc wireless networks
Mobile Networks and Applications
Multi-level hierarchies for scalable ad hoc routing
Wireless Networks
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A Distributed Transmission Power Control Protocol for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Performance evaluation of routing protocols for ad hoc wireless networks
Mobile Networks and Applications
Selecting a routing strategy for your ad hoc network
Computer Communications
Scalable routing strategies for ad hoc 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
IEEE Journal on Selected Areas in Communications
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Wireless Personal Communications: An International Journal
Cluster overlay-dynamic source routing: highly scalable routing protocol
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper, we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a one-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders, we formally prove that, if there exists a route from a source to a destination node with a minimum hop count of \Delta, then COB discovers a route with at most O(\Delta) hops from the source to the destination node in at most O(\Delta) time and by sending at most O(\Delta^2) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments, we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing.