Cluster-based routing overhead in networks with unreliable nodes

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 of O(1/M) where M is the cluster size. The analytic results are validated against simulations of random network topologies running a well known (D-hop max-min) clustering algorithm.

[1]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[2]  Elizabeth M. Belding-Royer,et al.  Hierarchical routing in ad hoc mobile networks , 2002, Wirel. Commun. Mob. Comput..

[3]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .

[4]  Ram Ramanathan,et al.  On the scalability of ad hoc routing protocols , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[6]  Ivan Marsic,et al.  Clustering overhead for hierarchical routing in mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Mario Gerla,et al.  On-demand routing in large ad hoc wireless networks with passive clustering , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[8]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[9]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[10]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Alhussein A. Abouzeid,et al.  Reactive routing overhead in networks with unreliable nodes , 2003, MobiCom '03.

[12]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[13]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[14]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).