An Improved DV-Hop Localization Algorithm Based on the Ordered Neighboring Nodes in Space
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The precision of DV-Hop localization algorithm is not good enough when it is used to compute the distance value between unknown nodes and beacon nodes. To overcome its disadvantage, a precision improved algorithm based on DV-Hop is proposed. The three neighboring nodes in the route of the unknown node to the beacon node are analyzed, and an improced DV-Hop Location Algorithm based on the Ordered Neighboring Nodes in Space is proposed. Simulation proves that the improved algorithm is effective and feasible.

    Reference
    Related
    Cited by
Get Citation

钟进发,许力,叶阿勇.基于邻节点空间顺序序列优化的DV-Hop定位算法.计算机系统应用,2010,19(2):62-66

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 08,2009
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063