K-Coverage Persevering Routing Technique Based on Event Occurrence Patterns for Wireless Sensor Networks

作者: Majid Rafigh , Maghsoud Abbaspour

DOI: 10.1155/2012/164641

关键词:

摘要: Wireless sensor networks (WSNs) comprising of tiny, power-constrained nodes are gaining popularity due to their potential use in a wide range applications, including monitoring environmental attributes, intrusion detection, and various military civilian environments. While the sensing objectives these environments unique application dependent, common performance criteria for wireless is prolonging network lifetime while satisfying coverage connectivity deployment region. In many real-world scenarios, reoccurring spatial patterns occurrence could be identified sensed event information. This paper proposes new routing algorithm schema based on history secure K-Coverage paths maintain maximum degree coverage. proposed method located around path try save battery power by not participating data packet forwarding neighbor nodes. The simulation results show that improves shifting responsibility from communication nodes, maximizing main occurrence. As consequence, increased dramatically as compared previous methods.

参考文章(25)
SangHak Lee, JuneJae Yoo, TaeChoong Chung, Distance-based energy efficient clustering for wireless sensor networks local computer networks. pp. 567- 568 ,(2004) , 10.1109/LCN.2004.44
Anthony Man-Cho So, Yinyu Ye, On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams workshop on internet and network economics. pp. 584- 593 ,(2005) , 10.1007/11600930_58
Yan Jin, Ju-Yeon Jo, Ling Wang, Yoohwan Kim, Xiaozong Yang, ECCRA: An energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks Computer Communications. ,vol. 31, pp. 2398- 2407 ,(2008) , 10.1016/J.COMCOM.2008.03.001
Ya Xu, John Heidemann, Deborah Estrin, Geography-informed energy conservation for Ad Hoc routing Proceedings of the 7th annual international conference on Mobile computing and networking - MobiCom '01. pp. 70- 84 ,(2001) , 10.1145/381677.381685
Hogil Kim, Eun Jung Kim, Ki Hwan Yum, ROAL: A Randomly Ordered Activation and Layering Protocol for Ensuring K-Coverage in Wireless Sensor Networks 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07). pp. 4- 4 ,(2007) , 10.1109/ICWMC.2007.77
J.-S. Li, H.-C. Kao, Distributed K-coverage self-location estimation scheme based on Voronoi diagram Iet Communications. ,vol. 4, pp. 167- 177 ,(2010) , 10.1049/IET-COM.2009.0288
H. Brönnimann, M. T. Goodrich, Almost optimal set covers in finite VC-dimension Discrete and Computational Geometry. ,vol. 14, pp. 463- 479 ,(1995) , 10.1007/BF02570718
D. Culler, D. Estrin, M. Srivastava, Guest Editors' Introduction: Overview of Sensor Networks IEEE Computer. ,vol. 37, pp. 41- 49 ,(2004) , 10.1109/MC.2004.93
Chi-Fu Huang, Yu-Chee Tseng, The coverage problem in a wireless sensor network sensor networks and applications. pp. 115- 121 ,(2003) , 10.1145/941350.941367
W.B. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, An application-specific protocol architecture for wireless microsensor networks IEEE Transactions on Wireless Communications. ,vol. 1, pp. 660- 670 ,(2002) , 10.1109/TWC.2002.804190