By Topic

Information-theoretic lower bounds on the routing overhead in mobile ad-hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nianjun Zhou ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; Abouzeid, A.A.

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.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003