A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks

Authors:
Abdelmorhit El Rhazi;Samuel Pierre
Affiliations:
Ecole Polytechnique de Montréal, Montréal;Ecole Polytechnique de Montréal, Montréal
Venue:
IEEE Transactions on Mobile Computing
Year:
2009

Citing 0
Cited 6

An ant-colony-system-based activity scheduling method for the lifetime maximization of heterogeneous wireless sensor networks

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Energy-Efficient Routing Protocol for Wireless Sensor Networks with Static Clustering and Dynamic Structure

Wireless Personal Communications: An International Journal
Routing Protocol Based on Tabu Search for Wireless Sensor Networks

Wireless Personal Communications: An International Journal
Asymmetric multi-path division communications in underwater acoustic networks with fading channels

Journal of Computer and System Sciences
Lifetime Maximization in Wireless Sensor Networks

International Journal of Wireless Networks and Broadband Technologies
Energy efficient approach with integrated key management scheme for wireless sensor networks: c.2.2 [network protocols]

Proceedings of the second ACM MobiHoc workshop on Airborne networks and communications

Quantified Score

Hi-index	0.00

Visualization

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.