English  |  正體中文  |  简体中文  |  Items with full text/Total items : 74010/74010 (100%)
Visitors : 24619015      Online Users : 430
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/72044

    Title: On Ambiguity of Localization in Randomly Deployed Large-Scale RIPS
    Authors: 林琪華;Lin,Chi-Hua
    Contributors: 資訊工程學系在職專班
    Keywords: 無線感測網路;無線定位;無線干涉定位系統;Sensor Networks;Localization;RIPS
    Date: 2016-07-28
    Issue Date: 2016-10-13 14:23:17 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 無線感測網路中,定位技術是極其重要的一個角色,在其應用領域內,事件發生的位置是感測節點監測訊息中的重要訊息,因位沒有節點位置資訊的數據是毫無意義的。
    ;Localization is one of the fundamental services in wireless sensor networks. Many
    applications, such as environmental monitoring and tra c control, rely on the avail-
    ability of location information for wireless sensors. Among all types of localization
    techniques, the Radio Interferometric Positioning System (RIPS) is promising due
    to its high accuracy and low hardware requirements. However, when RIPS is ap-
    plied to a large-scale wireless sensor network, at times the RIPS measurements may
    lead to ambiguous positioning for a free node, i.e., there may be more than one pos-
    sible position for a free node. If the free node is assigned an incorrect location, the
    error will be propagated to other free nodes, leading to increasing localization errors
    in the network. In this thesis, a localization algorithm is proposed which utilizes
    redundant location information from multiple cases to identify the true location of
    free nodes. The proposed algorithm is fully distributed, and the extra overhead
    is paid only when the ambiguity issue occurs. The simulation results demonstrate
    that the proposed algorithm is able to localize more than 90% of the free nodes with
    adequate node density or enough number of anchors.
    Appears in Collections:[資訊工程學系碩士在職專班 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明