淡江大學機構典藏:Item 987654321/106390
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62819/95882 (66%)
造访人次 : 3999273      在线人数 : 357
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/106390


    题名: Location Estimation Based on Convex Overlapping Communication Regions in Wireless Sensor Networks
    作者: Chen, Yeong-Sheng;Chang, Shih-Hao;Teng, Chun-Chien
    关键词: averaged point;beacon messages;convex overlapping communication regions;estimative rectangle;intersection points;localization accuracy;location estimation;position estimation;range free localization scheme;reference nodes;unknown node;wireless ad hoc sensor networks
    日期: 2014-05-11
    上传时间: 2016-04-27 11:11:35 (UTC+8)
    摘要: This paper proposes a range free localization scheme based on identifying the overlapped communication regions of reference nodes. In the proposed scheme, an unknown node identifies the communication regions of reference nodes from which it can receive beacon messages. The overlapped region of all the communication regions should be the area where the unknown node is located. First, the intersection points of every two communication circles are derived by using the proposed formula. Then, all the intersection points that are not located in the Estimative Rectangle (ER) are discarded. Besides, an overlap degree, which is the number of the communication regions that include this intersection point, is associated with each intersection point. All the intersection points with degree n, which is the total number of reference nodes that the unknown node can hear, are shown to be the vertices of the overlapped region of the communication regions. Since the overlapped region is a convex, the averaged point of the intersection points with degree n must be located within this region and hence can be a good position estimation of the unknown node. Experimental results show that the proposed scheme outperforms the related works, including Centroid, ER and Grid Scan algorithms, in term of better localization accuracy.
    關聯: IEEE Xplore Library
    DOI: 10.1109/VITAE.2014.6934471
    显示于类别:[資訊工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML320检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈