English  |  正體中文  |  简体中文  |  Items with full text/Total items : 75369/75369 (100%)
Visitors : 25484210      Online Users : 512
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/63537

    Title: Efficient Localization in Radio Interferometric Positioning System
    Authors: 高正中;Kao,Cheng-Chung
    Contributors: 資訊工程學系在職專班
    Keywords: 無線感測網路;無線干涉定位;Wireless Sensor Network;RIPS;Efficient Localization Algorithm
    Date: 2014-01-29
    Issue Date: 2014-04-02 15:47:29 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 「無線感測網路」被廣泛應用於環境監控、國土防衛等多重領域,多數應用均需要感測節點瞭解其本身之位置資訊,因感測節點通常係隨機且大量布放,故在既有條件下提升定位效能已成為重要研究課題。
    無線干涉定位技術因具有準確性高、無需額外增加設備成本、室內外環境皆可運用等特性,非常適合做為無線感測網路之定位方法,然無線干涉定位方法亦有運算負荷大、可能產生模糊結果等缺點。先前之無線干涉定位相關演算法對初始階段網路結構之假設要求過於強烈,且常忽略運算複雜度過大之問題,在本論文中我們以「無線干涉定位系統」為研究對象,先就其它相關演算法特性進行比較,再提出更具網路適應性且不增加運算負擔之演算法,並以模擬方式驗證其效能。; Wireless sensor network(WSN)has been widely applied to multiple fields such as environment monitoring, homeland security etc. Most of these applications need sensor nodes to be aware of their location informations. Since the sensor nodes in WSN are usually deployed in large numbers, and often randomly, the way to find locations of these sensor nodes precisely and efficiently thus becomes an important issue.
    There are some properties of radio interferometric positioning system(RIPS)such as high accuracy, no extra hardware cost and applicable in both indoor and outdoor circumstances; therefore, it is very suitable for WSN localization. However, heavy computing complexity and localization ambiguity under specific conditions are with coming problems. The former studies of RIPS algorithms usually neglect the calculation load of localization process and require strict presumptions of network configuration. In this paper we compare the RIPS algorithms with these concerning characteristics and propose an improved algorithm more adaptive to network topology without increasing computing complexity. The simulation results of algorithm efficiency comparison are also demonstrated.
    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 ©   - 隱私權政策聲明