Self-Organization in Ad Hoc Networks

Flat ad hoc architectures are not scalable. In order to overcome this major drawback, hierarchical routing is introduced since it is found to be more effective. The main challenge in hierarchical routing is to group nodes into clusters. Each cluster is represented by one cluster head. Conventional methods use either the connectivity (degree) or the the node Id to perform the cluster head election. Such parameters are not really robust in terms of side effects. In this paper we introduce a novel measure that allows to form clusters and in the same time performs the cluster head election. Analytical models and simulations results show that this novel measure proposed for cluster head election induces less cluster head changes as compared to classical methods.

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

[2]  Ram Ramanathan,et al.  Hierarchically‐organized, multihop mobile wireless networks for quality‐of‐service support , 1998, Mob. Networks Appl..

[3]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[4]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[5]  Christian Bonnet,et al.  DDR-distributed dynamic routing algorithm for mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[6]  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).

[7]  Hwa-Chun Lin,et al.  A clustering technique for large multihop mobile wireless networks , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[8]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[9]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[10]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[11]  L. Kleinrock,et al.  Spatial reuse in multihop packet radio networks , 1987, Proceedings of the IEEE.

[12]  Zygmunt J. Haas,et al.  Using routing zones to support route maintenance in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[13]  Christian Bonnet,et al.  A New Method for Scalable and Reliable Multicast System for Mobile Networks , 2001, ICN.

[14]  Dahlia Malkhi,et al.  K-clustering in wireless ad hoc networks , 2002, POMC '02.

[15]  Prithwish Basu,et al.  A mobility based metric for clustering in mobile ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.