By Topic

Information Theoretic Analysis of Proactive 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 ; T.J. Watson Res. Center, IBM, Hawthorne, NY, USA ; Abouzeid, A.A.

This paper considers basic bounds on the overhead of link-state protocols in mobile ad hoc networks. Hierarchical protocols are known for their good scalability properties, and hence this paper considers a two-level hierarchical protocol. In such protocols, nodes need to keep track of shortest path information, link states and cluster membership. Two types of overheads are considered; the memory needed to store routing-related information, including link-states and cluster membership, and the control messages that need to be exchanged to keep track of the changes in the network. Memory overhead is important practically for dimensioning network nodes, while message routing overhead is important since it reduces the effective capacity of the network to carry user data (vis-a-vis control data). The scalability properties of the message routing overhead are analyzed for different modes of network scaling. Practical implications, such as optimal cluster size, average/fixed memory requirement and routing protocol parameter selections are discussed.

Published in:

Information Theory, IEEE Transactions on  (Volume:55 ,  Issue: 10 )