earticle

논문검색

A Recovery Algorithm based on Minimum Distance Redundant Nodes in Fault Management in WSNs

초록

영어

Fault recovery is vital to WSNs since node death is a typical fault. Aiming to recover the “coverage hole”, a Recovery Algorithm based on Minimum Distance Redundant Nodes (MDRN) is proposed in this paper. By employing redundant nodes carefully, the recovery algorithm is deployed on the sink node with unconstrained energy consumption which knows the locations of all active nodes and redundant nodes in the WSNs. Simulation results demonstrate that, by choosing appropriate number of redundant nodes, this algorithm will have great recovery accuracy and coverage quality, also achieve the purpose of prolonging the lifecycle of WSNs.

목차

Abstract
 1. Introduction
 2. Related work
  2.1. Restructure the network
  2.2. Using mobile node
 3. Localized Faulty Recovery Algorithms
  3.1. Assumptions
  3.2. Session Scenario
  3.3. Derivation of recovery procedure
  3.4. Algorithm
 4. Simulation and discussions
  4.1. Design of simulation experiment
  4.2. Discussions
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Song Jia School of Information and Electrical Engineering Harbin Institute of Technology at Weihai, Shandong, China, Automatic Test and Control Institute Harbin Institute of Technology, Harbin, China
  • Wang Bailing School of Computer Science and Technology Harbin Institute of Technology at Weihai, Shandong, China
  • Peng Xiyuan Automatic Test and Control Institute Harbin Institute of Technology, Harbin, China
  • Li Jianfeng School of Information and Electrical Engineering Harbin Institute of Technology at Weihai, Shandong, China
  • Zhong Cheng School of Information and Electrical Engineering Harbin Institute of Technology at Weihai, Shandong, China

참고문헌

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

    함께 이용한 논문

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

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