DV-Distance Localization Algorithm of Wireless Sensor Networks
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    With regard to the problem of DV-Distance in localizing, this paper puts forward an improved localization algorithm with more precision. DV-Distance deduces the coordinate of unknown nodes by estimating the sum of the hop distance between unknown nodes and reference nodes. Based on DV-Distance, this improved localization algorithm makes ratio of the real distance between reference nodes to the distance of sum of hops between those reference nodes as a weight, with which the precision of estimated distance for localizing is improved. And with the technique of RSSI to limit nodes to be a valid node, the precision of localizing can be improved with this improved localization algorithm. Simulation demonstrates that the improved algorithm obviously reduces the error and is more precise than traditional DV-Distance localiza- tion algorithms.

    Reference
    Related
    Cited by
Get Citation

付华,孙蕾.无线传感器网络DV-Distance定位算法.计算机系统应用,2010,19(3):56-58

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 12,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