English  |  正體中文  |  简体中文  |  Items with full text/Total items : 50124/85142 (59%)
Visitors : 7911041      Online Users : 54
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106390


    Title: Location Estimation Based on Convex Overlapping Communication Regions in Wireless Sensor Networks
    Authors: Chen, Yeong-Sheng;Chang, Shih-Hao;Teng, Chun-Chien
    Keywords: 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
    Date: 2014-05-11
    Issue Date: 2016-04-27 11:11:35 (UTC+8)
    Abstract: 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.
    Relation: IEEE Xplore Library
    DOI: 10.1109/VITAE.2014.6934471
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML71View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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