Advertisement

An Approach to Place Sink Node in a Wireless Sensor Network (WSN)

  • S. VeeramaniEmail author
  • Sk. Noor Mahammad
Article
  • 7 Downloads

Abstract

In wireless sensor network (WSN), the data collected from the different sensor nodes are collectively forwarded to the special node called sink node. The placement of such sink nodes plays a vital role in reducing the propagation latency/delay and energy consumption of WSN. This paper addresses the problem of placing the minimum number of sink nodes in an un-weighted topology in such a way to maximize the link connecting different sensor nodes and proposes a heuristic approach to place the sink node in an appropriate location in the WSN.

Keywords

Node placement WSN Sink node Heuristic 

Notes

References

  1. 1.
    Pottie, G. J. (1998). Wireless sensor networks. In IEEE information theory workshop (pp. 139–140).Google Scholar
  2. 2.
    Garey, M. R., & Johnson, D. S. (1979). A guide to the theory of NP-completeness. New York: WH Freemann.zbMATHGoogle Scholar
  3. 3.
    Khuller, S., & Sussmann, Y. J. (2000). The capacitated k-center problem. SIAM Journal on Discrete Mathematics, 13(3), 403–18.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Hochbaum, D. S., & Shmoys, D. B. (1985). A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10(2), 180–4.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Cheng, P., Chuah, C. N., & Liu, X. (2004). Energy-aware node placement in wireless sensor networks. In IEEE global telecommunications conference (GLOBECOM) (Vol. 5, pp. 3210–3214).Google Scholar
  6. 6.
    Younis, M., & Akkaya, K. (2008). Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6(4), 621–55.CrossRefGoogle Scholar
  7. 7.
    Njoya, A. N., Thron, C., Barry, J., Abdou, W., Tonye, E., Konje, N. S., et al. (2017). Efficient scalable sensor node placement algorithm for fixed target coverage applications of wireless sensor networks. IET Wireless Sensor Systems, 7(2), 44–54.CrossRefGoogle Scholar
  8. 8.
    Liu, X., & Mohapatra, P. (2004). Placement of sensor nodes in wireless sensor networks (Vol 1, pp. 1–12), University of California.Google Scholar
  9. 9.
    Gupta, S. K., Kuila, P., & Jana, P. K. (2016). Genetic algorithm approach for k-coverage and m-connected node placement in target based wireless sensor networks. Computers and Electrical Engineering, 1(56), 544–56.CrossRefGoogle Scholar
  10. 10.
    Kar, K., & Banerjee, S. (2003). Node placement for connected coverage in sensor networks. In Modeling and optimization in mobile, ad hoc and wireless networks (p. 2).Google Scholar
  11. 11.
    Cormen, T. H. (2009). Introduction to algorithms. Cambridge: MIT Press.zbMATHGoogle Scholar
  12. 12.
  13. 13.
    Kurant, M., Markopoulou, A., & Thiran, P. (2010). On the bias of BFS (breadth first search). In 22nd international IEEE teletraffic congress (ITC) (pp. 1–8)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Indian Institute of Information Technology Design and Manufacturing Kancheepuram (IIITDM)ChennaiIndia

Personalised recommendations