Skip to main content
Log in

Delay Constrained Relay Node Placement in Wireless Sensor Networks: A Subtree-and-Mergence-based Approach

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Wireless Sensor Networks (WSNs) are applied in many time-critical applications, e.g., industrial automation and smart grid. This highlights the importance of Delay Constrained Relay Node Placement (DCRNP) problem that builds a path fulfilling a specified delay constraint between each sensor and the sink by using a minimum number of relays. Due to the NP-hardness of the DCRNP problem, in this paper, a polynomial time Subtree-and-Mergence-based Algorithm (SMA) is proposed to approximately solve the DCRNP problem. First, a shortest path tree rooted at the sink and connecting all sensors is built to check the feasibility of the DCRNP problem. If the DCRNP problem is feasible, then the paths of this tree are progressively merged at some relays, which are not limited to those relays lying in the originally the originally built shortest path tree, to save deployed relays while maintaining the obedience of delay constraints. With the repetition of this mergence, the number of deployed relays is gradually reduced. Furthermore, the approximation ratio and the time complexity of the proposed SMA are elaborately analyzed. Finally, extensive simulations are conducted to demonstrate the effectiveness of this work. Simulation results show that SMA can significantly save deployed relays comparing with existing algorithms.

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. As ARNPc builds network topology without considering delay constraints, there is only one curve representing simulation results of ARNPc in each subfigure of Fig. 9.

References

  1. Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless Sensor Networks: A Survey. Comput Netw 38(4):393–422

    Article  Google Scholar 

  2. Yick J, Mukherjee B, Ghosal D (2008) Wireless Sensor Network Survey. Comput Netw 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. Proc ACM MobiCom’99:263–270

  4. Pan J, Hou YT, Cai L, Shi Y, Shen SX (2003) Topology Control for Wireless Sensor Networks. Proc ACM MobiCom’03:286–299

  5. Gungor VC, Hancke GP (2009) Industrial Wireless Sensor Networks: Challenges, Design Principles, and Technical Approaches. IEEE Trans Ind Electron 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 Network. Wirel Commun Mob Comput 10(2):1–23

    Google Scholar 

  7. Zheng M, Liang W, Yu H, Xiao Y (2015) Performance Analysis of the Industrial Wireless Networks Standard: WIA-PA. Mobile Networks and Applications 2015(2):1–12

    Google Scholar 

  8. Kumer A.A, Øvsthus SK, Kristensen LM (2014) An Industrial Perspective on Wireless Sensor Networks-A Survey of Requirements, Protocols, and Challeges. IEEE Commun Surv Tuts 16(3):1391–1412

    Article  Google Scholar 

  9. Bredin J, Demaine E, Hajiaghayi M, Rus D (2010) Deploying Sensor Networks with Guaranteed Fault Tolerance. IEEE/AM Trans Netw 18(1):216–228

    Article  Google Scholar 

  10. Hou YT, Shi Y, Sherali HD (2005) On Energy Provisioning and Relay Node Placement for Wireless Sensor Networks. IEEE Trans Wireless Commun 4(5):2579–2590

    Article  Google Scholar 

  11. Lin G, Xue G (1999) Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-length. Inf Process Lett 69(2):53–57

    Article  MathSciNet  Google Scholar 

  12. Chen D, Du DZ, Hu XD, Lin G, Wang L, Xue G (2000) Approximations for Steiner Trees with Mnimum Number of Steiner Points. J Glob Optim 18(3):17–33

    Article  Google Scholar 

  13. Cheng XZ, Du DZ, Wang LS, Xu BG (2007) Relay Sensor Placement in Wireless Sensor Networks. Wirel Netw 14(3):347–355

    Article  Google Scholar 

  14. Tang J, Hao B, Sen A (2006) Relay Node Placement in Large Scale Wireless Sensor Networks. Comput Commun 29(4):490–501

    Article  Google Scholar 

  15. Lloyd E, Xue G (2007) Relay Node Placement in Wireless Sensor Networks. IEEE Trans Comput 56 (1):134–138

    Article  MathSciNet  Google Scholar 

  16. Wang Q, Xe K, Takahara G, Hassanein H (2007) Device Placement for Heterogeneous Wireless Sensor Networks: Minimum Cost with Lifetime Constraints. IEEE Trans Wireless Commun 6(7):2444–2453

    Article  Google Scholar 

  17. Srinivas A, Zussman G, Modiano E (2009) Construction and Maintenance of Wireless Mobile Backbone Networks. IEEE/ACM Trans Netw 17(1):239–252

    Article  Google Scholar 

  18. Ma C, Liang W, Zheng M, Sharif H (2016) A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks. IEEE Sensors J 16(2):515–528

    Article  Google Scholar 

  19. Misra S, Hong S, Xue G, Tang J (2008) Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirement. Proc IEEE Infocom’08:879–887

  20. Misra S, Hong S, Xue G, Tang J (2010) Constrained Relay Node Placement in Wireless Sesnor Networks: Formulation and Approximations. IEEE/ACM Trans Netw 18(2):434–447

    Article  Google Scholar 

  21. Yang DJ, Misra S, Fang X, Xue GL, Zhang JS (2012) Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations. IEEE Trans Mobile Comput 11(8):1399–1411

    Article  Google Scholar 

  22. Bhattacharya A, Kumar A (2010) Delay Constrained Optimal Relay Placement for Planned Wireless Sensor Networks. Proc IEEE IWQoS’10:1–9

  23. Bhattacharya A, Kumar A (2013) QoS Aware and Survivable Network Design for Planned Wireless Sensor Networks. Tech. Rep., arXiv:1110.4746

  24. Bhattacharya A, Kumar A (2014) A Shortest Path Tree Based Algorithm for Relay Placement in A Wireless Sensor Network and Its Performance Analysis. Comput Netw 71(4):48–62

    Article  Google Scholar 

  25. Sitanayah L, Brown KN, Sreenan CJ (2012) Fault-Tolerant Relay Deployment based on Length-Constrained Connectivity and Rerouting Centrality in Wireless Sensor Networks. In: 9th European Conference on Wireless Sesnor Networks (EWSN), 115-130

    Google Scholar 

  26. Nigam A, Agarwal YK (2014) Optimal Relay Node Placement in Delay Constrained Wireless Sensor Network Design. Eur J Oper Res 233(1):220–233

    Article  MathSciNet  Google Scholar 

  27. Li J, Mohapatra P (2007) Analytical Modeling and Mitigation Techniques for The Energy Hole Problem in Sensor Networks. Pervasive Mob Comput 3(3):233–254

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the Natural Science Foundation of China under grant 61673371 and 71661147005, Youth Innovation Promotion Association, CAS (2015157) and the Program project of Beijing Municipal Education Commission (KM 201511417008), open project of Beijing Key Laboratory of Information Service Engineering (Zk20201402).

Author information

Authors and Affiliations

Authors

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. Delay Constrained Relay Node Placement in Wireless Sensor Networks: A Subtree-and-Mergence-based Approach. Mobile Netw Appl 23, 1220–1232 (2018). https://doi.org/10.1007/s11036-017-0815-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-017-0815-z

Keywords

Navigation