Scheduling algorithms for K-barrier coverage to improve transmission efficiency in WSNs
- 3 Downloads
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.
KeywordsWireless sensor networks K-barrier coverage Sink-connected Forwarding routing tree Multi-channel scheduling
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).
- 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–301Google Scholar
- 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. IEEEGoogle 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–197Google 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–444Google Scholar
- 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–11Google Scholar
- 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–420Google 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–586Google 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–56Google 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–17Google Scholar