Research Article
A Comparative Study of Partitioning Algorithms for Wireless Sensor Networks
@INPROCEEDINGS{10.1007/978-3-642-27299-8_47, author={Zeenat Rehena and Debasree Das and Sarbani Roy and Nandini Mukherjee}, title={A Comparative Study of Partitioning Algorithms for Wireless Sensor Networks}, proceedings={Advances in Computer Science and Information Technology. Networks and Communications. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part I}, proceedings_a={CCSIT PART I}, year={2012}, month={11}, keywords={Partitioning Algorithms WSN Nearest Neighbour Graph}, doi={10.1007/978-3-642-27299-8_47} }- Zeenat Rehena
Debasree Das
Sarbani Roy
Nandini Mukherjee
Year: 2012
A Comparative Study of Partitioning Algorithms for Wireless Sensor Networks
CCSIT PART I
Springer
DOI: 10.1007/978-3-642-27299-8_47
Abstract
In many applications large scale Wireless Sensor Networks (WSNs) use multiple sinks for fast data dissemination and energy efficiency. A WSN may be divided into a number of partitions and each partition may contain a sink, thereby reducing the distance between source nodes and sink node. This paper focuses on partitioning algorithms for WSN. Some existing graph partitioning algorithms are studied that can be applied for partitioning a WSN. A novel partitioning approach for WSN is proposed along with its modification. Simulation of the proposed algorithms has been carried out and their performances are compared with some existing algorithms. It is demonstrated that the proposed algorithms perform better than the existing algorithms.
