An Entropy-Based Weighted Clustering Algorithm and Its Optimization for Ad Hoc Networks

As a newly-proposed weighing-based clustering algorithm, WCA has improved performance compared with other previous clustering algorithms. But the high mobility of nodes will lead to high frequency of re-affiliation which will increase the network overhead. To solve this problem, we propose an entropy- based WCA (EWCA) which can enhance the stability of the network. Meanwhile, in order better to facilitate the optimal operation of the MAC protocol and to further stabilize the network structure, this paper applies tabu search onto EWCA to choose a near optimal dominant set. Consequently, less clusterheads are required to manage the network. Simulation study indicates that the revised algorithm (EWCA-TS) has improved performance with respect to the original WCA, especially on the number of clusters and the re-affiliation frequency.

[1]  Ramez Elmasri,et al.  Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

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

[3]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[4]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[5]  Stefano Basagni,et al.  Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[6]  Ramez Elmasri,et al.  Optimizing clustering algorithm in mobile ad hoc networks using genetic algorithmic approach , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Gordon F. Royle,et al.  Graph Domination, Tabu Search and the Football Pool Problem , 1997, Discret. Appl. Math..

[8]  Geoffrey S. Ryder,et al.  A probability collectives approach to weighted clustering algorithms for ad hoc networks , 2005, Communications and Computer Networks.

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

[10]  P. W. Baier,et al.  Multicluster, mobile, multimedia radio network , 1995 .

[11]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[12]  Anthony Ephremides,et al.  A Distributed Algorithm for Organizing Mobile Radio Telecommunication Networks , 1981, IEEE International Conference on Distributed Computing Systems.

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

[14]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[15]  Symeon Papavassiliou,et al.  An entropy-based model for supporting and evaluating route stability in mobile ad hoc wireless networks , 2002, IEEE Communications Letters.

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

[17]  Basheer M. Khumawala,et al.  An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems , 1997 .

[18]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[19]  Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2007, White Plains, New York, USA, 8-10 October 2007, Proceedings , 2007, WiMob.