Hierarchical routing overhead in mobile ad hoc networks
Sucec, J.
Marsic, I.
Center for Adv. Inf. Process., Rutgers Univ., Piscataway, NJ, USA;
This paper appears in: Mobile Computing, IEEE Transactions on
Publication Date: Jan-Feb 2004
Volume: 3,
Issue: 1
On page(s): 46- 56
ISSN: 1536-1233
INSPEC Accession Number: 7991131
Digital Object Identifier: 10.1109/TMC.2004.1261816
Current Version Published: 2004-08-02
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 (Φ). To derive an expression for Φ, 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 Φ is only polylogarithmic in the node count.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
