Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Information Theoretic Analysis of Proactive Routing Overhead in Mobile Ad Hoc Networks
 

Summary: Information Theoretic Analysis of Proactive Routing
Overhead in Mobile Ad Hoc Networks
Nianjun Zhou and Alhussein A. Abouzeid 1
Abstract
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 proper-
ties, 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 mem-
bership. Two types of overheads are considered; the memory needed to store routing-
related information, including link-states and cluster membership, and the messages
that need to be exchanged to keep track of the changes in the network. Memory over-
head is important practically for dimensioning network nodes, while message 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 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.
1
Nianjun Zhou is with IBM, 294 Route 100, Somers, NY 10589; This work was conducted as part of his
Ph.D. thesis work at RPI, Troy NY; Tel: (914) 843-3180; e-mail: jzhou@us.ibm.com

  

Source: Abouzeid, Alhussein A. - Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute

 

Collections: Engineering; Computer Technologies and Information Sciences