Hierarchical Routing Overhead in Mobile Ad Hoc Networks

Authors:
John Sucec;Ivan Marsic
Affiliations:
IEEE;IEEE
Venue:
IEEE Transactions on Mobile Computing
Year:
2004

Citing 0
Cited 15

An efficient clustering scheme for large and dense mobile ad hoc networks (MANETs)

Computer Communications
Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks

Journal of Computer and System Sciences - Special issue: Performance modelling and evaluation of computer systems
Performance analysis of mobility-based d-hop (MobDHop) clustering algorithm for mobile ad hoc networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks

International Journal of Network Management
MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

Wireless Personal Communications: An International Journal
A unified framework for cluster manager election and clustering mechanism in mobile ad hoc networks

Computer Standards & Interfaces
The performance comparison of flat routing and hierarchical routing in ad hoc wireless networks in the presence of faulty nodes

Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Two-layer hierarchical wavelength routing for islands of transparency optical networks

Computer Communications
An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network

Computers and Electrical Engineering
Effects of mobility in hierarchical mobile ad hoc networks

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
HCRS: a routing scheme for ad hoc networks as a QoS guarantee primitive

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Analyzing the effect of node mobility in clustered wireless ad hoc networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A routing layer-based hierarchical service advertisement and discovery for MANETs

Ad Hoc Networks
Optimal cluster-based routing scheme using node mobility in ad hoc networks

Wireless Networks
Network-Tree routing model for large scale networks: theories and algorithms

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of hierarchical routing was undertaken in the 1970s. However, there has been little published work that assesses analytically the communication overhead incurred in hierarchical routing. This paper assesses the scalability, with respect to increasing node count, of hierarchical routing in mobile ad hoc networks (MANETs). The performance metric of interest is the number of control packet transmissions per second per node (\phi). To derive an expression for \phi, the components of hierarchical routing that incur overhead as a result of hierarchical cluster formation and location management are identified. It is shown here that \phi is only polylogarithmic in the node count.