Skip to main content
SpringerLink
Log in

Approximation algorithm for minimizing relay node placement in wireless sensor networks

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

To eliminate the routing load unbalance among sensor nodes, one approach is to deploy a small number of powerful relay nodes acting as routing nodes in wireless sensor networks, the major optimization objective of which is to minimize the number of relay nodes required. In this paper, we prove that the relay node placement problem in a bounded plane is a P problem, but its computational complexity in general case is quite great. From the geometric cover feature of the relay node placement problem, an O(n 2 log n) time greedy approximation algorithm is proposed, where n is the number of sensor nodes. Particularly, at each stage of this algorithm’s iterative process, we first select a critical node from uncovered sensor nodes, and then determine the location of relay node based on the principle of preferring to cover the sensor node closer to the critical node, so as to prevent the emergence of isolated node. Experiment results indicate that our proposed algorithm can generate a near optimum feasible relay node deployment in a very short time, and it outperforms existing algorithms in terms of both the size of relay node deployment and the execution time.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akyildiz I F, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks: a survey. Comput Netw, 2002, 38: 393–422

    Article  Google Scholar 

  2. Cui L, Ju H L, Miao Y, et al. Overview of wireless sensor networks (in Chinese). J Comput Res Devel, 2005, 42: 163–174

    Article  Google Scholar 

  3. Zhang W. A probabilistic approach to tracking moving targets with distributed sensors. IEEE Trans Syst Man Cybern, 2007, 37: 721–731

    Article  Google Scholar 

  4. Snidaro L, Niu R, Foresti G L, et al. Quality-based fusion of multiple video sensors for video surveillance. IEEE Trans Syst Man Cybern, 2007, 37: 1044–1051

    Article  Google Scholar 

  5. Tang Q L, Yang L Q, Qin T F, et al. Energy-saving PPM schemes for WSNs. Sci China Ser F-Inf Sci, 2008, 51: 571–585

    Article  MATH  Google Scholar 

  6. Li J S, Kao H C, Ke J D. Voronoi-based relay placement scheme for wireless sensor networks. IET Commun, 2009, 3: 530–538

    Article  Google Scholar 

  7. Pan J, Hou Y T, Cai L, et al. Topology control for wireless sensor networks. In: Proceedings of the 9th Annual ACM International Conference on Mobile Computing and Networking (MobiCom). New York: ACM Press, 2003. 286–299

    Chapter  Google Scholar 

  8. Gupta G, Younis M. Fault-tolerant clustering of wireless sensor networks. In: Proceedings of the IEEE Wireless Communication and Networking Conference (WCNC). New York: IEEE CS Press, 2003. 1579–1584

    Google Scholar 

  9. Gupta G, Younis M. Load-Balanced clustering of wireless sensor networks. In: Proceedings of the 38th IEEE International Conference on Communications (ICC). New York: IEEE CS Press, 2003. 1848–1852

    Google Scholar 

  10. Tang J, Hao B, Sen A. Relay node placement in large scale wireless sensor networks. Comput Commun, 2006, 29: 490–501

    Article  Google Scholar 

  11. Lloyd E, Xue G. Relay node placement in wireless sensor networks. IEEE Trans Comput, 2007, 56: 134–138

    Article  MathSciNet  Google Scholar 

  12. Wang Q, Xu K, Takahara G, et al. Device placement for. heterogeneous wireless sensor networks: minimum cost with lifetime constraints. IEEE Trans Wirel Commun, 2007, 6: 2444–2453

    Article  Google Scholar 

  13. Cormen T H, Leiserson C, Rivest R L, et al. Introduction to Algorithms. 2nd ed. Cambridge, MA: The MIT Press, 2001. 1033–1038

    MATH  Google Scholar 

  14. Cheng X, Du D, Wang L, et al. Relay sensor placement in wireless sensor networks. Wirel Netw, 2008, 14: 347–355

    Article  Google Scholar 

  15. Hao B, Tang J, Xue G. Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation. In: Proceedings of the IEEE International Workshop on High Performance Switching and Routing (HPSR). New York: IEEE CS Press, 2004. 246–250

    Google Scholar 

  16. Hochbaum D S, Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. J ACM, 1985, 32: 130–136

    Article  MATH  MathSciNet  Google Scholar 

  17. LU K Z. RNPlace. http://hpc.szu.edu.cn/rnplace/. 2010

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, 518060, China

    KeZhong Lu, GuoLiang Chen, YuHong Feng, Gang Liu & Rui Mao

  2. National High Performance Computing Center at Shenzhen, Shenzhen, 518060, China

    KeZhong Lu, GuoLiang Chen, YuHong Feng, Gang Liu & Rui Mao

Authors
  1. KeZhong Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. GuoLiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. YuHong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Rui Mao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to KeZhong Lu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, K., Chen, G., Feng, Y. et al. Approximation algorithm for minimizing relay node placement in wireless sensor networks. Sci. China Inf. Sci. 53, 2332–2342 (2010). https://doi.org/10.1007/s11432-010-4092-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-4092-8

Keywords

Search

Navigation