A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks

The main challenge in wireless sensor network deployment pertains to optimizing energy consumption when collecting data from sensor nodes. This paper proposes a new centralized clustering method for a data collection mechanism in wireless sensor networks, which is based on network energy maps and quality-of-service (QoS) requirements. The clustering problem is modeled as a hypergraph partitioning and its resolution is based on a tabu search heuristic. Our approach defines moves using largest size cliques in a feasibility cluster graph. Compared to other methods (CPLEX-based method, distributed method, simulated annealing-based method), the results show that our tabu search-based approach returns high-quality solutions in terms of cluster cost and execution time. As a result, this approach is suitable for handling network extensibility in a satisfactory manner.

[1]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[2]  Bhaskar Krishnamachari,et al.  Impact of heterogeneous deployment on lifetime sensing coverage in sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[3]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[4]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[5]  Majid Sarrafzadeh,et al.  Optimal Energy Aware Clustering in Sensor Networks , 2002 .

[6]  J. Redi,et al.  Effect of overhearing transmissions on energy efficiency in dense sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[7]  Pankaj K. Agarwal,et al.  Exact and Approximation Algortihms for Clustering , 1997 .

[8]  Samuel Pierre,et al.  A Data Collection Algorithm Using Energy Maps in Sensor Networks , 2007 .

[9]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2002, SCG '02.

[12]  A. Mishra,et al.  A self-adaptive clustering based algorithm for increased energy-efficiency and scalability in wireless sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[13]  Samuel Pierre,et al.  A Data Collection Algorithm Using Energy Maps in Sensor Networks , 2007, Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007).

[14]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[15]  Mohamed Naimi,et al.  A novel clustering algorithm for efficient energy saving in wireless sensor networks , 2006, 2006 International Symposium on Computer Networks.

[16]  Weifa Liang,et al.  Online Data Gathering for Maximizing Network Lifetime in Sensor Networks , 2007, IEEE Transactions on Mobile Computing.