Anchor Node Distribution Algorithm Based on RGM Algorithm
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    All current localization algorithm study focuses on how to improve the positioning accuracy, but rarely studys how to arrange node. Just randomly selecting anchor nodes meet the conditions, however, the algorithm does not explicitly request how to arranged anchor node, so you want to get the appropriate anchor node at all times can only randomly arranged a large number of anchor nodes. However, a large number of increasing the number of anchor nodes is bound to greatly increase the cost of the system and in the actual operation of the arranged is unrealistic. Based on the above issue, this paper proposes a distribution optimization algorithm basis on RGM algorithm. Algorithm detailed analysis of the coverage area of each set of positioning unit, positioning accuracy meets the conditions for the basis to calculate the coordinates of each anchor node. Simulation results show that according to the algorithm arranging anchor nodes does not reduce the positioning accuracy.

    Reference
    Related
    Cited by
Get Citation

冯小杰,彭勇,吴锡生.基于RGM算法的锚节点布点算法.计算机系统应用,2016,25(7):151-155

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 10,2015
  • Revised:December 20,2015
  • Adopted:
  • Online: July 21,2016
  • 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