Skip to main content
Log in

Weighted relay node placement for wireless sensor network connectivity

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In wireless sensor networks (WSN), which are composed of unreliable sensor nodes, preserving the connectivity is a serious problem and one of the most effective solutions of this problem is to deploy powerful relay nodes (RN). The location of the RN is an important parameter for the network performance. In this paper, we investigate relay node placement (RNP) problem on a weighted terrain structure to satisfy WSN connectivity. Contrary to the existing studies, instead of minimizing the number of RN, the main objective of weighted RNP is to minimize the total weight of the points on which RN are deployed. In order to solve the weighted RNP problem, a mathematical formulation is proposed to find the optimal solution. However, because of the NP-complete nature of the problem, a polynomial time heuristic algorithm is also developed. Performance results show that the proposed heuristic algorithm can find near-optimal solutions in a reasonable time bound.

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.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Jiang, H., Chen, L., Wu, J., Chen, S., & Leung, H. (2009). A reliable and high-bandwidth multihop wireless sensor network for mine tunnel monitoring. Sensors Journal IEEE, 9,1511–1517.

    Article  Google Scholar 

  2. Ledeczi, A., Hay, T., Volgyesi, P., Hay, D., Nadas, A., & Jayaraman, S. (2009). Wireless acoustic emission sensor network for structural monitoring. Sensors Journal, IEEE, 9, 1370–1377.

    Article  Google Scholar 

  3. Suryadevara, N., & Mukhopadhyay, S. (2012). Wireless sensor network based home monitoring system for wellness determination of elderly. Sensors Journal, IEEE, 12, 1965–1972.

    Article  Google Scholar 

  4. See, C., Horoshenkov, K., Abd-Alhameed, R., Hu, Y. F., & Tait, S. (2012). A low power wireless sensor network for gully pot monitoring in urban catchments. Sensors Journal, IEEE, 12, 1545–1553.

    Google Scholar 

  5. Bekmezci, I., & Alagöz, F. (2009). Energy efficient, delay sensitive, fault tolerant wireless sensor network for military monitoring. IJDSN, 5(6), 729–747.

    Google Scholar 

  6. AlShawi, I. S., Yan, L., Pan, W., & Luo, B. (2012). Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm. Sensors Journal, IEEE, 12, 3010–3018.

    Article  Google Scholar 

  7. Yick, J., Mukherjee, B., & Ghosal, D. (2008). Wireless sensor network survey. Computer Networks, 52, 2292–2330.

    Article  Google Scholar 

  8. Vallimayil, A., Dhulipala, V., Raghunath, K., & Chandrasekaran, R. (2011). Role of relay node in wireless sensor network: A survey. In Electronics Computer Technology (ICECT), 2011 3rd international conference on 5 (pp. 160–167).

  9. Younis, M., & Akkaya, K. (2008). Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6, 621–655.

    Article  Google Scholar 

  10. Lin, G.-H., & Xue, G. (1999). Steiner tree problem with minimum number of steiner points and bounded edge-length. Information Processing Letters, 69, 53–57.

    Article  MathSciNet  Google Scholar 

  11. Chen, D., Du, D.-Z., Hu, X.-D., Lin, G.-H., Wang, L., & Xue, G. (2000). Approximations for steiner trees with minimum number of steiner points. Journal of Global Optimization, 18, 17–33.

    Article  MATH  MathSciNet  Google Scholar 

  12. Cheng, X., Du, D.-Z., Wang, L., & Xu, B. (2008). Relay sensor placement in wireless sensor networks. Wireless Networks, 14, 347–355.

    Article  Google Scholar 

  13. Lloyd, E. L., & Xue, G. (2007). Relay node placement in wireless sensor networks. IEEE Transactions on Computers, 56, 134–138.

    Article  MathSciNet  Google Scholar 

  14. Hao B., Tang J., & Xue, G. (2004). Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation. In 2004 workshop on high performance switching and routing HPSR (pp. 246–250).

  15. Tang, J., Hao, B., & Sen, A. (2006). Relay node placement in large scale wireless sensor networks. Computer Communications, 29(4), 490–501.

    Article  Google Scholar 

  16. Liu, H., Wan, P.-J., & Jia X. (2005). Fault-tolerant relay node placement in wireless sensor networks. In L. Wang (Ed.), Computing and combinatorics 3595 of lecture notes in computer science (pp. 230–239). Berlin: Springer.

  17. Srinivas, A., Zussman, G., & Modiano, E. (2006). Mobile backbone networks: Construction and maintenance. In Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc ’06 (pp. 166–177). ACM, New York, NY, USA.

  18. Misra, S., Hong, S. D., Xue, G., & Tang, J. (2010). Constrained relay node placement in wireless sensor networks: Formulation and approximations. IEEE/ACM Transactions on Networking, 18, 434–447.

    Article  Google Scholar 

  19. Yang D., Misra, S., Fang, X., Xue, G., & Zhang, J. (2012). Two-tiered constrained relay node placement in wireless sensor networks: Computational complexity and efficient approximations. IEEE Transactions on Mobile Computing, 11, 1399–1411.

    Google Scholar 

  20. Durbach, I. N., & Stewart, T. J. (2012). Modelling uncertainty in multi-criteria decision analysis. European Journal of Operational Research, 223, 1–14.

    Google Scholar 

  21. Ke, W.-C., Liu, B.-H., & Tsai, M.-J. (2007). Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is np-complete. Computers, IEEE Transactions on, 56, 710–715.

    Article  MathSciNet  Google Scholar 

  22. Williams, H. P. (1999). Model building in mathematical programming (4th Edn). London: Wiley.

    Google Scholar 

  23. Prömel, H., & Steger, A. (2002). The Steiner tree problem: A tour through graphs, algorithms, and complexity. Advanced lectures in mathematics. Braunschweig: Vieweg.

  24. Kou, L., Markowsky, G., & Berman, L. (1981). A fast algorithm for Steiner trees. Acta Informatica (Historical Archive), 15, 141–145.

    Article  MATH  MathSciNet  Google Scholar 

  25. ILOG CPLEX Optimization Studio. (2011). version 12.4. Armonk. New York: IBM Corp.

  26. MATLAB. (2010). version 7.10.0 (R2010a). Natick, MA: The MathWorks Inc.

  27. Fournier, A., Fussell, D., & Carpenter, L. (1982). Computer rendering of stochastic models. Communications of the ACM, 25, 371–384.

    Article  Google Scholar 

  28. Hill algorithm. (2013). http://www.stuffwithstuff.com/robot-frog/3d/hills/hill.html. Last visited on 02/27/2013.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to İlker Bekmezci.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kimençe, Ş., Bekmezci, İ. Weighted relay node placement for wireless sensor network connectivity. Wireless Netw 20, 553–562 (2014). https://doi.org/10.1007/s11276-013-0624-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-013-0624-7

Keywords

Navigation