Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks

A distributed algorithm is presented that partitions the nodes of a fully mobile network (multi-hop network) into clusters, thus giving the network a hierarchical organization. The algorithm is proven to be adaptive to changes in the network topology due to nodes' mobility and to nodes addition/removal. A new weight-based mechanism is introduced for the efficient cluster formation/maintenance that allows the cluster organization to be configured for specific applications and adaptive to changes in the network status, not available in previous solutions. Specifically, new and flexible criteria are defined that allow the choice of the nodes that coordinate the clustering process based on mobility parameters and/or their current status. Simulation results are provided that demonstrate up to an 85% reduction on the communication overhead associated with the cluster maintenance with respect to techniques used in clustering algorithms previously proposed.

[1]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

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

[3]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

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

[5]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

[6]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.