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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Pothen, A., Simon, H.D., Liu, K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430–452 (1990)
Chlebikova, J.: Approximating the Maximally Balanced Connected Partition Problem in graphs. Information Processing Letters 60, 225–230 (1996)
Chan, T.F., Szeto, W.K.: On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method. SIAM J. Sci. Comput. 18(3), 943–948 (1997)
Eppstein, D., Paterson, M.S., Yao, F.F.: On Nearest-Neighbour Graphs (2000)
Kabelıkova, P.: Graph Partitioning Using Spectral Methods. VSB - Technical University of Ostrava (2006)
Slama, I., Jouaber, B., Zeghlache, D.: Energy Efficient Scheme for Large Scale Wireless Sensor Networks with Multiple Sinks. In: Wireless Communications and Networking Conference, WCNC-IEEE (2008)
Elbhiri, B., El Fkihi, S., Saadane, R., Aboutajdine, D.: Clustering in Wireless Sensor Networks Based on Near Optimal Bi-partitions. In: Next Generation Internet (NGI) (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Rehena, Z., Das, D., Roy, S., Mukherjee, N. (2012). A Comparative Study of Partitioning Algorithms for Wireless Sensor Networks. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Networks and Communications. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27299-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-27299-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27298-1
Online ISBN: 978-3-642-27299-8
eBook Packages: Computer ScienceComputer Science (R0)