Skip to main content

Advertisement

Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Pottie, G. J. (1998). Wireless sensor networks. In IEEE information theory workshop (pp. 139–140).

  2. Garey, M. R., & Johnson, D. S. (1979). A guide to the theory of NP-completeness. New York: WH Freemann.

    MATH  Google Scholar 

  3. Khuller, S., & Sussmann, Y. J. (2000). The capacitated k-center problem. SIAM Journal on Discrete Mathematics, 13(3), 403–18.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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).

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  8. Liu, X., & Mohapatra, P. (2004). Placement of sensor nodes in wireless sensor networks (Vol 1, pp. 1–12), University of California.

  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.

    Article  Google Scholar 

  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).

  11. Cormen, T. H. (2009). Introduction to algorithms. Cambridge: MIT Press.

    MATH  Google Scholar 

  12. http://www.topology-zoo.org/dataset.html.

  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)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Veeramani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Veeramani, S., Noor Mahammad, S. An Approach to Place Sink Node in a Wireless Sensor Network (WSN). Wireless Pers Commun 111, 1117–1127 (2020). https://doi.org/10.1007/s11277-019-06904-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06904-y

Keywords

Navigation