earticle

논문검색

Optimal Coverage Algorithm of Wireless Sensor Networks Based on Particle Swarm Optimization with Coherent Velocity

초록

영어

Optimal coverage of wireless sensor networks is one of the most fundamental problems for constructing efficient perception layer of the Internet of Things. On the basis of research on spatial neighborhood, the node coverage and area coverage models are analyzed, then an optimal coverage algorithm of wireless sensor networks is proposed based on particle swarm optimization with coherent velocity. Experimental results show that the algorithm can significantly improve the network coverage; in addition, the coherent velocity can effectively avoid network prematurely into a local optimal solution, so as to enhance the network coverage.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Preliminary Modeling
  3.1. Spatial Neighborhood
  3.2. Node Coverage Model
  3.3. Area Coverage Model
 4. Coverage Optimization Algorithm
  4.1. Node Position Optimization
  4.2. Inertia Weight of Velocity
  4.3. Coherent Velocity
 5. Implementation Description
  5.1. Node Attributes
  5.2. Spatial Neighborhood Construction
  5.3. Local Neighborhood Coverage Computation
  5.4. Procedure of Coverage Optimization
 6. Experiment and Analysis
  6.1. Experimental Settings
  6.2. Communication Radius Selection
  6.3. Network Coverage Discussion
  6.4. Coherent Velocity Effects
  6.5. Running Time Analysis
 7. Conclusions
 Acknowledgement
 References

저자정보

  • Chuanyun Wang College of Computer Science, Shenyang Aerospace University, Shenyang, China
  • Enyan Sun College of Computer Science, Shenyang Aerospace University, Shenyang, China
  • Feng Tian College of Automation, Shenyang Aerospace University, Shenyang, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

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

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