A novel coverage algorithm based on event-probability-driven mechanism in wireless sensor network

详细信息    查看全文

• 作者：Zeyu Sun (1) (2)
  Weiguo Wu (1)
  Huanzhao Wang (1)
  Heng Chen (1)
  Xiaofei Xing (3)
  
  1. School of Electronics and Information Engineering ; Xi鈥檃n Jiaotong University ; Xi鈥檃n ; Shaanxi Province ; 710049 ; China
  2. Department of Computer and Information Engineering ; Luoyang Institute of Science Technology ; Luoyang ; Henan Province ; 471023 ; China
  3. School of Computer Science and Education Software ; Guangzhou University ; Guangzhou ; Guangdong Province ; 510006 ; China
  
• 关键词：Wireless sensor network ; Event probability ; Coverage algorithm ; Sensor nodes
• 刊名：EURASIP Journal on Wireless Communications and Networking
• 出版年：2014
• 出版时间：December 2014
• 年：2014
• 卷：2014
• 期：1
• 全文大小：1,587 KB
• 参考文献：1. Schuragers, C, Tsiatsis, V, Ganeriwal, S, Srivastava, M (2002) Optimizing sensor networks in the energy-latency-density design space. IEEE Trans. Mobile Comput 1: pp. 70-80 CrossRef
  2. Hou, T, Shi, Y, Sherali, HD (2008) Rate allocation and network lifetime problems for WSN. IEEE/ACM Trans. Networking 16: pp. 321-334 CrossRef
  3. He, S, Chen, J, Sun, Y (2012) Coverage and connectivity in duty-cycled WSNs for event monitoring. IEEE Trans. Parallel Distr Syst 23: pp. 75-482
  4. Derr, K, Manic, M (2012) WSN configuration-part II: adaptive coverage for decentralized algorithms. IEEE Trans. Industrial Informatics 9: pp. 1728-1738 CrossRef
  5. Li, W, Zhang, W (2012) Coverage analysis and active scheme of WSNs. Inst. Eng. Technol 2: pp. 86-91
  6. Lin, K, Rodrigues, JJPC, Hongwei, G, Xiong, N, Liang, X (2011) Energy efficiency QoS assurance routing in WSN. IEEE Syst. J 5: pp. 495-505 CrossRef
  7. Zhu, R, Qin, Y, Lai, C-F (2011) Adaptive packet scheduling scheme to support real-time traffic in WLAN mesh networks. KSII Trans. Internet Inf. Syst 5: pp. 1492-1512
  8. Cheng, S-T, Shih, J-S, Chang, T-Y, Horng, G-T, Chou, C-T (2012) MLPA-conservation mechanism in WSN environments. EURASIP J. Wirel. Commun. Netw 1: pp. 1-13 CrossRef
  9. Karkvandi, HR, Recht, E, Yadid, O (2011) Pecht, Effective lifetime-aware routing in WSNs. IEEE Sensors J 11: pp. 3359-3367 CrossRef
  10. Zairi, S, Zouari, B, Niel, E, Dumitrescu, E (2012) Nodes self-scheduling approach for maximizing WSN lifetime based on remaining energy. The Institution of. Eng. Technol 2: pp. 52-62
  11. Zhu, R (2011) Intelligent rate control for supporting real-time traffic in WLAN mesh networks. J. Netw. Comput. Appl 34: pp. 1449-1458 CrossRef
  12. Hsin, C-f, Liu, M (2006) Randomly duty-cycled WSNs: dynamics of coverage. IEEE Trans. Wireless Commun 5: pp. 3182-3892 CrossRef
  13. Wang, B, Chaning, K, Wang, W (2007) Information coverage in randomly deployed WSN. IEEE Trans. Wireless. Communications 6: pp. 2994-3004 CrossRef
  14. Xiao, Y, Chen, H, Wu, K, Sun, B, Zhang, Y, Sun, X, Liu, C (2010) Coverage and detection of a randomized scheduling algorithm in WSNs. IEEE Trans. Comput 59: pp. 507-521 CrossRef
  15. Lin, J-W, Chen, Y-T (2008) Improving the coverage of randomized scheduling in WSN. IEEE Trans. Wireless Commun 7: pp. 4807-4812 CrossRef
  16. Slijepcevic, S, Potkonjak, M (2001) Power Efficient Organization of WSN. Proceedings of IEEE International Conference on Communications. pp. 472-476
  17. Berman, P, Calinescu, G, Shah, C, Zelikovsky, A (2004) Power efficient monitoring management in sensor networks. Proceeding of IEEE Wireless Communication and Networking Conference. Atlanta, USA, pp. 2329-2334
  18. Tian, D, Georganas, ND (2003) A node scheduling scheme for energy conservation in large WSNs. Wirel. Commun. Mob. Comput 3: pp. 271-290 CrossRef
  19. Abrams, Z, Goel, A, Plotkin, S (2004) Set K-cover algorithms for energy efficient monitoring in WSN. Proceeding of the 3th International Symposium on Information Processing in Sensor Networks. Berkeley, California, USA, pp. 424-432
  20. Zhang, H, Jennifer, CH (2005) Maintaining sensing coverage and connectivity in large sensor network. Ad Hoc Sensor Wireless Netw 1: pp. 89-124
  21. Huang, CF, Tseng, YC (2003) The Coverage problem in a WSN. Proceeding of the 2nd ACM International Workshop on WSNs and Applications. San Diego, California, USA, pp. 115-121
  22. Cardei, M, Du, DZ (2005) Improving WSN lifetime through power aware organization. Wirel. Netw 11: pp. 333-340 CrossRef
  23. Liu, H, Wan, P, Yi, CW, Jia, X, Makki, SAM, Pissinou, N (2005) Maximal lifetime scheduling in sensor surveillance networks. Proceedings of the 24th Conference on Computer Communications. Miami, USA, pp. 2482-2491
  24. Wu, J, Dai, F, Gao, M, Stojmenovic, I (2002) On Calculating power-aware connected dominating sets for efficient routing in Ad Hoc Wireless network. J. Commun. Netw 4: pp. 1-12
  25. Kar, K, Banerjee, S (2003) Node placement for connected coverage in sensor networks. Proceedings of the Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. Sophia-Antipolis, France
  26. Xing, X, Wang, G, Wu, J, Li, J (2010) Square region-based coverage and connectivity probability model in WSNs. Mobile Ad-Hoc and Sensor Networks (MSN), 2010 sixth International Conference. Hang Zhou, China, pp. 79-84 CrossRef
  27. Li, Y, Vu, C, Ai, C, Chen, G, Zhao, Y (2011) Transforming complete coverage algorithms to partial coverage algorithms for WSNs. IEEE Trans. Parallel Distrib. Syst 22: pp. 695-703 CrossRef
  28. Shu, W, Wang, J (2013) An optimized multi-hop routing algorithm based on clonal selection strategy for energy-efficient management in wireless sensor networks. Sensors and Transducers 22: pp. 8-14
  29. Fang, W, Liu, F, Yang, F, Shu, L, Nishio, S (2010) Energy-efficient cooperative communication for data transmission in WSN. IEEE Trans. Consum. Electron 56: pp. 2185-2192 CrossRef
  
• 刊物主题：Signal, Image and Speech Processing;
• 出版者：Springer International Publishing
• ISSN：1687-1499

文摘

Coverage problem is an important research topic in the field of wireless sensor network (WSN). The coverage algorithm based on event probability driven mechanism (EPDM) is put forward in this paper. First of all, the network probability model is established and the subordinate relation between sensor nodes and the target nodes is presented. Secondly, a series of probability is computed and the related theorems and reasoning are also proven. Thirdly, effective coverage for the monitoring region is achieved through scheduling mechanism of nodes themselves, thus the purpose of increasing network lifetime can be realized. Finally, experimental results show that the proposed algorithm could achieve complete coverage for networks of different scale and increase the network lifetime. It possesses the good quality of effectiveness and stability.