Skip to main content

Advertisement

SpringerLink
Log in

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Delay constrained relay node placement (DCRNP) problem minimizes the quantity of deployed relays that are employed to build at least one path between the sink and each sensor, while guaranteeing that the delay constraints for the built paths are fulfilled. Published literature only focus on the DCRNP problem in single-tiered wireless sensor networks (WSNs). Considering the benefits in terms of network scalability and energy consumption by the two-tiered network topology, this paper studies the DCRNP problem in two-tiered WSNs and proposes a pruning-and-substitution-based-heuristic (PSH) algorithm to solve the DCRNP problem. PSH consists of two phases, i.e., the covering phase and the connecting phase. In the covering phase, a shortest-path-based algorithm (SPA) is proposed to deploy relays at a subset of predetermined deployment locations such that each sensor is covered by at least one relay, meanwhile ensuring the obedience of delay constraints. Then, in the connecting phase, a tree-based connecting algorithm (TCA) is proposed to build the high-tier network connectivity. TCA first builds a shortest path tree to connect the relays deployed by SPA to the sink, and then, saves the deployed relays by gradually pruning or substituting them by the relays placed at the locations that several feasible paths pass through. The time complexity and the approximation ratio of this work are explicitly analyzed and extensive simulations are implemented to demonstrate its effectiveness.

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

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. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: A survey. Computer Networks Journal, 38(4), 393–422.

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999). Next century challenges: Scalable coordination in sensor networks. In Proceedings of ACM MobiCom’99 (pp. 263–270).

  4. Pan, J., Hou, Y. T., Cai, L., Shi, Y., & Shen, S. X. (2003). Topology control for wireless sensor networks. In Proceedings of ACM MobiCom’03 (pp. 286–299).

  5. Gungor, V. C., & Hancke, G. P. (2009). Industrial wireless sensor networks: Challenges, design principles, and technical approaches. IEEE Transactions on Industrial Electronics, 56(10), 4258–4265.

    Article  Google Scholar 

  6. Lin, J., Zhu, B., Zeng, P., Liang, W., Yu, H., & Xiao, Y. (2014). Monitoring power transmission lines using a wireless sensor networks. Wireless Communications and Mobile Computing,. doi:10.1002/wcm.2458.

    Google Scholar 

  7. Liang, W., Zhang, X., Xiao, Y., Wang, F., Zeng, P., & Yu, H. (2011). Survey and experiments of WIA-PA specification of industrial wireless network. Wireless Communications and Mobile Computing, 11(8), 1197–1212.

    Article  Google Scholar 

  8. Bredin, J., Demaine, E., Hajiaghayi, M., & Rus, D. (2010). Deploying sensor networks with guaranteed fault tolerance. IEEE/ACM Transactions on Networking, 18(1), 216–228.

    Article  Google Scholar 

  9. Hou, Y. T., Shi, Y., & Sherali, H. D. (2005). On energy provisioning and relay node placement for wireless sensor networks. IEEE Transactions on Wireless Communications, 4(5), 2579–2590.

    Article  Google Scholar 

  10. Lin, G., & Xue, G. (1999). Steiner tree problem with minimum number of Steiner points and bounded edge-length. IEEE Transactions on Wireless Communications, 69(2), 53–57.

    MathSciNet  MATH  Google Scholar 

  11. Chen, D., Du, D. Z., Hu, X. D., Lin, G., Wang, L., & Xue, G. (2000). Approximations for Steiner trees with mnimum number of Steiner points. IEEE Transactions on Wireless Communications, 18(3), 17–33.

    MATH  Google Scholar 

  12. Cheng, X. Z., Du, D. Z., Wang, L. S., & Xu, B. G. (2007). Relay node placement in wireless sensor networks. Wireless Networks, 14(3), 347–355.

    Article  Google Scholar 

  13. Misra, S., Hong, S., Xue, G., & Tang, J. (2008). Constrained Relay node placement in wireless sensor networks to meet connectivity and survivability requirement. In Proceedings of IEEE Infocom’08 (pp. 879–887).

  14. Misra, S., Hong, S., Xue, G., & Tang, J. (2010). Constrained relay node placement in wireless sensor networks: Formulation and approximations. Wireless Networks, 18(2), 434–447.

    Google Scholar 

  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. Lloyd, E., & Xue, G. (2007). Relay node placement in wireless sensor networks. IEEE Transactions on Computers, 56(1), 134–138.

    Article  MathSciNet  Google Scholar 

  17. Srinivas, A., Zussman, G., & Modiano, E. (2009). Construction and maintenance of wireless mobile backbone networks. IEEE Transactions on Computers, 17(1), 239–252.

    Google Scholar 

  18. Wang, Q., Xe, K., Takahara, G., & Hassanein, H. (2007). Device placement for heterogeneous wireless sensor networks: Minimum cost with lifetime constraints. IEEE Transactions on Wireless Communications, 6(7), 2444–2453.

    Article  Google Scholar 

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

    Google Scholar 

  20. Ma, C., Liang, W., Zheng, M., & Sharif, H. (2016). A connectivity-aware approximation algorithm for relay node placement in wireless sensor networks. IEEE Transactions on Wireless Communications, 16(2), 515–528.

    Google Scholar 

  21. Bhattacharya, A., & Kumar, A. (2010). Delay constrained optimal relay placement for planned wireless sensor networks. In IEEE proceedings of IWQoS’10 (pp. 1–9).

  22. Bhattacharya, A., & Kumar, A. (2013). QoS aware and survivable network design for planned wireless sensor networks. Technical reports. arxiv.org/pdf/1110.4746.

  23. Bhattacharya, A., & Kumar, A. (2014). A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis. Computer Networks, 71(4), 48–62.

    Article  Google Scholar 

  24. Sitanayah, L., Brown, K. N., & Sreenan, C. J. (2012). Fault-tolerant relay deployment based on length-constrained connectivity and rerouting centrality in wireless sensor networks. In Proceeding of the 9th European conference on wireless sesnor networks (EWSN’12) (pp. 115–130). Berlin: Springer.

  25. Nigam, A., & Agarwal, Y. K. (2014). Optimal relay node placement in delay constrained wireless sensor network design. European Journal of Operational Research, 233(1), 220–233.

    Article  MathSciNet  MATH  Google Scholar 

  26. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithm. Cambridge: MIT Press.

    MATH  Google Scholar 

  27. Claude, F., Dorrigiv, R., Durocher, S., & Fraser, R. (2009). Practical discrete unit disk cover using an exact line-separable algorithm. In Proceedings of international symposium algorithms and computation (ISAAC’09) (pp. 45–54).

  28. Xu, K., Hassanein, H., Takahara, G., & Wang, Q. (2010). Relay node deployment strategies in heterogeneous wireless sensor networks. European Journal of Operational Research, 9(2), 145–159.

    Google Scholar 

Download references

Acknowledgments

This work was supported by the Natural Science Foundation of China under Grant 61304263, 61673371 and 71602124, and Liaoning Provincial Natural Science Foundation of China under Grant 2014020081.

Author information

Authors and Affiliations

  1. Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang, 110016, China

    Chaofan Ma, Wei Liang & Meng Zheng

  2. University of Chinese Academy of Sciences, Beijing, 100049, China

    Chaofan Ma

Authors
  1. Chaofan Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meng Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Wei Liang or Meng Zheng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ma, C., Liang, W. & Zheng, M. PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks. Wireless Pers Commun 94, 1491–1510 (2017). https://doi.org/10.1007/s11277-016-3694-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3694-x

Keywords

Search

Navigation