A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks
Authors:
- 12 September 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 8 (4) , 433-444
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- A Data Collection Algorithm Using Energy Maps in Sensor Networks2007
- Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach2004
- Effect of overhearing transmissions on energy efficiency in dense sensor networks2004
- An application-specific protocol architecture for wireless microsensor networksIEEE Transactions on Wireless Communications, 2002
- Optimal Energy Aware Clustering in Sensor NetworksSensors, 2002
- A local search approximation algorithm for k-means clustering2002
- Exact and Approximation Algorithms for ClusteringAlgorithmica, 2002
- TAG2002
- A user's guide to tabu searchAnnals of Operations Research, 1993
- Optimization by Simulated AnnealingScience, 1983