Information-theoretic lower bounds on the routing overhead in mobile ad-hoc networks
Nianjun Zhou, Alhussein A. Abouzeid · 2003
This paper describes the performance of variable topology routing protocol in comparison with a theoretical minimum routing overhead, which is the amount of information needed to describe the changes in a dynamic network topology. A network of identical but distinguishable nodes lies within a bounded region of space. There are two levels of hierarchy for nodes. All the nodes of a sub-region form a cluster and randomly select a cluster head from the nodes within the same sub-region. A cluster-head maintains two types of topology information: (i) Local cluster topology information, (ii) Global topology information.