Multiple Sink Placement in Partitioned Wireless Sensor Networks


Zeenat Rehena
Debasree Das
Sarbani Roy
Nandini Mukherjee


Multiple sink deployment in large-scale wireless sensor networks (WSNs) can reduce transmission distance between source nodes to sink. This reduces energy consumption for data transmission and extends the network life time. However, proper placement of sinks has a great impact on the performance of the WSNs. This paper introduces six sink placement strategies and discusses their advantages and disadvantages. The network is assumed to be partitioned into several sub-networks and therefore the objective of each strategy is to place a sink in each partition. These strategies are based on a grid structure that divides the network into square-shaped grid cells. Results of application of the six strategies in a network with random deployment of sensor nodes are analyzed. Performances of the network after application of these strategies are also analyzed and analysis results are presented in this paper.


How to Cite
Zeenat Rehena, Debasree Das, Sarbani Roy, & Nandini Mukherjee. (2015). Multiple Sink Placement in Partitioned Wireless Sensor Networks. International Journal of Next-Generation Computing, 6(2), 79–94.


  1. Bogdanov, A., Maneva, E., and Riesenfeld, S. 2004. Power-aware base station positioning for sensor networks. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies. Vol. 1.
  2. Chen, F. and Li, R. 2013. Sink node placement strategies for wireless sensor networks. Wirel. Pers. Commun. 68, 2, 303{319.
  3. Chen, Y., Chan, E., and Han, S. 2005. Energy efficient multipath routing in large scale sensor networks with multiple sink nodes. In Proceedings of the 6th International Conference on Advanced Parallel Processing Technologies. APPT'05. Springer-Verlag, 390{399.
  4. Flathagen, J., Kure, ., and Engelstad, E. P. 2011. Constrained-based multiple sink placement for wireless sensor networks. In Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on. 783{788.
  5. Forgy, E. 1965. Cluster analysis of multivariate data: Efficiency versus interpretability of classi cation. Biometrics 21, 3, 768{769.
  6. Guney, E., Aras, N., Altinel, I. K., and Ersoy, C. 2010. Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks. Comput. Netw. 54, 11 (Aug.), 1805{1822.
  7. Kabelikova, P. 2006. Graph partitioning using spectral methods. In VSB - Technical University of Ostrava.
  8. Kim, H., Seok, Y., Choi, N., Choi, Y., and Kwon, T. 2005. Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks. In Proceedings of the 2005 International Conference on Information Networking: Convergence in Broadband and Mobile Networking. ICOIN'05. Springer-Verlag, Berlin, Heidelberg, 264{274.
  9. Li, J., Ji, S., Jin, H., and Ren, Q. 2008. Routing in multi-sink sensor networks based on gravitational eld. In Embedded Software and Systems, 2008. ICESS '08. International Conference on. 368{375.
  10. Oyman, E. and Ersoy, C. 2004. Multiple sink network design problem in large scale wireless sensor networks. In Communications, 2004 IEEE International Conference on. Vol. 6. 3663{3667 Vol.6.
  11. Poe, W. and Schmitt, J. 2009a. Self-organized sink placement in large-scale wireless sensor networks. In Modeling, Analysis Simulation of Computer and Telecommunication Systems, 2009. MASCOTS '09. IEEE International Symposium on. 1{3.
  12. Poe, W. Y. and Schmitt, J. B. 2009b. Sink placement without location information in large-scale wireless sensor networks. In Asian Internet Engineering Conference. AINTEC '09. ACM, New York, NY, USA, 69{76.
  13. Rehena, Z., Das, D., Roy, S., and Mukherjee, N. 2012. A comparative study of partitioning algorithms for wireless sensor networks. In Advances in Computer Science and Information Technology. Networks and Com- munications. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol. 84. 445{454.