Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cluster-based Routing Overhead in Networks with Unreliable Nodes
 

Summary: Cluster-based Routing Overhead
in Networks with Unreliable Nodes
Huaming Wu and Alhussein A. Abouzeid
Department of Electrical, Computer and Systems Engineering
Rensselaer Polytechnic Institute, Troy, New York 12180
Email: wuhm@rpi.edu, abouzeid@ecse.rpi.edu
Abstract-- While several cluster based routing algorithms have
been proposed for ad hoc networks, there is a lack of formal
mathematical analysis of these algorithms. Specifically, there is no
published investigation of the relation between routing overhead
on one hand and route request pattern (traffic) on the other. This
paper provides a mathematical framework for quantifying the
overhead of a cluster-based routing protocol. We explicitly model
the application-level traffic in terms of the statistical description
of the number of hops between a source and a destination. The
network topology is modelled by a regular two-dimensional grid
of unreliable nodes, and expressions for various components of
the routing overhead are derived. The results show that clustering
does not change the traffic requirement for infinite scalability
compared to flat protocols, but reduces the overhead by a factor

  

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

 

Collections: Engineering; Computer Technologies and Information Sciences