Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Scheduling algorithms for K-barrier coverage to improve transmission efficiency in WSNs

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

K-barrier coverage optimization problem is concentrating on how to select sensor nodes from the monitoring area of the wireless sensor networks (WSNs) to form the highest quality of k-barrier coverage. Sink-connected barrier coverage optimization problem (SCBCOP) focuses on how to choose the minimum number of forwarding nodes to make each detecting node sink-connected for the security requirements of the belt monitoring region. However, the existing algorithm, such as optimal node selection algorithm(ONSA), can find the optimized k-barrier coverage of sink-connected, but it may form a large number of data packets interference (or collisions) and cannot transfer the information to sink nodes in time because the different detecting nodes can transmit invasive information at the same time. The purpose of this paper is to discuss how to reduce interference among the nodes and select routing path to optimize k-barrier coverage and satisfy sink-connected. In this paper a scheduling algorithm is proposed to build the routing path and maintain sink-connected. The algorithms is present in detail through forwarding routing tree and multi-channel scheduling to further reduce the interference of packet transmission among sensor nodes. Moreover, the comparison between other approaches and our proposal is mentioned through the simulation to show the potential efficiency and better performance of interference of packet transmission among sensor nodes with the lower packet loss rate, the shorter packet delay and the larger network average throughput.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Bhatia A, Hansdah RC (2014) A fast and fault-tolerant distributed algorithm for near-optimal TDMA scheduling in WSNs[C]. In: IEEE international conference on distributed computing in sensor systems. IEEE, pp 294–301

  2. Elsts A, Duquennoy S, Fafoutis X, Oikonomou G, Craddock I (2017) Microsecond-accuracy time synchronization using the IEEE 802.15.4 TSCH protocol[C]. In: Local computer networks workshops. IEEE

  3. Fujimoto M, Ozaki H, Suzuki T, Koyamashita H, Okada H (2013) Effective barrier coverage constructions for improving border security in wireless sensor networks. IEICE Trans Commun E96.B(12):3007–3016

    Article  Google Scholar 

  4. Ghosal A, Halder S, Dasbit S (2012) A dynamic TDMA based scheme for securing query processing in WSN[J]. Wirel Netw 18(2):165–184

    Article  Google Scholar 

  5. Hadi A, Wahidah I (2017) Delay estimation using compressive sensing on WSN IEEE 802.15.4[C]. In: International conference on control, electronics, renewable energy and communications. IEEE, pp 192–197

  6. Haghighi MS, Xiang Y, Varadharajan V, Quinn B (2015) A stochastic time-domain model for burst data aggregation in IEEE 802.15.4 wireless sensor networks[J]. IEEE Trans Comput 64(3):627–639

    Article  MathSciNet  Google Scholar 

  7. Huynh TT, Dinh-Duc AV, Tran CH (2014) Energy efficient delay-aware routing in multi-tier architecture for wireless sensor networks[C]. In: International Conference on Advanced Technologies for Communications. IEEE, pp 439–444

  8. Luo J, Ren X, Zou S (2016) A decentralized K-barriers construction approach based on nearest neighbors rule for two-dimensional rectangular region[J]. Wirel Netw:1–11

  9. Mehrjoo S, Shanbehzadeh J, Pedram MM (2010) A novel intelligent energy-efficient delay-aware routing in WSN, based on compressive sensing[C]. In: International symposium on telecommunications. IEEE, pp 415–420

  10. Ren X, Liang W, Xu W (2014) Data collection maximization in renewable sensor networks via time-slot scheduling[J]. IEEE Trans Comput 64(7):1870–1883

    Article  MathSciNet  Google Scholar 

  11. Santoso F (2010) Sub-optimal decentralised control algorithms for blanket and k-barrier coverage in autonomous robotic wireless sensor networks[J]. IET Commun 4(17):2041–2057

    Article  MathSciNet  Google Scholar 

  12. Shimada N (2016) Study on Acces control method of IEEE802.15.4 in wireless LAN Coexistense[J]. Health Serv Res 42(1 Pt 2):577–586

    Google Scholar 

  13. Wang Z, Cao Q, Qi H et al (2017) Cost-effective barrier coverage formation in heterogeneous wireless sensor networks[J]. Ad Hoc Netw 64:65–79

    Article  Google Scholar 

  14. Yamamoto K, Ozaki H, Suzuki T, Wada T, Mutsuura K, Okada H (2011) Barrier coverage constructions for border security systems using wireless sensors[C]. In: 2011 international conference on parallel processing workshops, Taipei, Taiwan, pp 50–56

  15. Yoo SE, Chong PK, Kim D et al (2010) Guaranteeing real-time Services for Industrial Wireless Sensor Networks with IEEE 802.15.4[J]. IEEE Trans Ind Electron 57(11):3868–3876

    Article  Google Scholar 

  16. Zhang Y, Sun X, Wang B (2016) Efficient algorithm for k-barrier coverage based on integer linear programming[J]. China Commun 13(7):16–23

    Article  Google Scholar 

  17. Zhuang Y, Wu C, Zhang Y et al (2016) Compound event barrier coverage in wireless sensor networks under multi-constraint conditions[J]. Sensors 17(12):1–17

Download references

Acknowledgments

The research is supported by the National Science Foundation for Young Scientists of China(No. 61702011) and the National Natural Science Foundation of China(No. 61872006).

Author information

Authors and Affiliations

  1. School of Computer and Information, Anhui Normal University, Wuhu, 241002, China

    Yujun Zhu & Zetian Zheng

  2. School of Electronics and Information Engineering, Tongji University, Shanghai, 201804, China

    Meng Mei

Authors
  1. Yujun Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meng Mei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zetian Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meng Mei.

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

Zhu, Y., Mei, M. & Zheng, Z. Scheduling algorithms for K-barrier coverage to improve transmission efficiency in WSNs. Multimed Tools Appl 79, 10505–10518 (2020). https://doi.org/10.1007/s11042-019-7316-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-019-7316-y

Keywords

Search

Navigation