Earticle

초록

영어

How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem for maximizing the network lifetime. We propose a novel energy-efficient target coverage algorithm to solve this problem based on clustering architecture. 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.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Basic Problem and Network Model
  3.1. Basic Definitions
  3.2. Network Model
  3.3. The Improved Coverage Algorithm
 4. Evaluation of Performance
 5. Conclusions
 Acknowledgments
 References

키워드

저자

• Zeyu Sun [ School of Computer and Information Engineering, Luoyang Institute of Science and Technology, Luoyang 471023, China, Electrical and information Engineering, Xi’an Jiaotong University Xi’an 710049, China ]
• Tao Yang [ School of Mathematics, Luoyang Institute of Science and Technology, Luoyang 471023, China ]
• Xiaoming Dong [ School of Information and Technology, Anqing Teachers college, Anqing, Anhui, 246011, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605