earticle

논문검색

A Nonlinear Multi-objective k-degree Coverage Protocol Based on Optimization Nodes Scheduling in Wireless Sensor Networks

초록

영어

In the process of coverage for multiple targets, due to the existence of a large number of redundant data make the effective monitoring area coverage decreased and force the network to consume more energy. Therefore, this paper proposes a multi-target k-coverage preservation protocol. First of all, establish the affiliation between the sensor nodes and target nodes through the network model, present a method to compute the coverage expected value of the monitoring area; secondly, in the network energy conversion, using scheduling mechanism in sensor nodes to attain the network energy balance, and achieve different network coverage quality through different nodes energy conversion. Finally, simulation results show that NMCP can effectively reduce the number of active nodes meeting certain coverage requirements and then improve the network lifetime.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Network Model and Coverage Quality
  3.1 basic definitions
  3.2. Coverage Quality
 4. NMCP Protocol
  4.1. Energy Conversion
  4.2. NMCP Algorithm Idea
  4.3. NMCP Algorithm Steps
  4.3. NMCP Algorithm Description
  4.4. Complexity Analysis of NMCP Algorithm
 5. System Evaluation
 6. Conclusion
 Acknowledgments
 References

저자정보

  • Zeyu Sun School of Computer and Information Engineering, Luoyang Institute of Technology, Luoyang Henan 471023, China; School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an, Shanxi, 710049, China
  • Chuanfeng Li School of Computer and Information Engineering, Luoyang Institute of Technology, Luoyang Henan 471023, China
  • Yuanbo Li School of Computer and Information Engineering, Luoyang Institute of Technology, Luoyang Henan 471023, China

참고문헌

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.