博碩士論文 995302012 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:10 、訪客IP:3.229.142.104
姓名 高正中( Cheng-Chung Kao)  查詢紙本館藏   畢業系所 資訊工程學系在職專班
論文名稱
(Efficient Localization in Radio Interferometric Positioning System)
相關論文
★  Dynamic Overlay Construction for Mobile Target Detection in Wireless Sensor Networks★ 車輛導航的簡易繞路策略
★ 使用傳送端電壓改善定位★ 利用車輛分類建構車載網路上的虛擬骨幹
★ Why Topology-based Broadcast Algorithms Do Not Work Well in Heterogeneous Wireless Networks?★ 針對移動性目標物的有效率無線感測網路
★ 適用於無線隨意網路中以關節點為基礎的分散式拓樸控制方法★ A Review of Existing Web Frameworks
★ 將感測網路切割成貪婪區塊的分散式演算法★ 無線網路上Range-free的距離測量
★ Inferring Floor Plan from Trajectories★ An Indoor Collaborative Pedestrian Dead Reckoning System
★ Dynamic Content Adjustment In Mobile Ad Hoc Networks★ 以影像為基礎的定位系統
★ 大範圍無線感測網路下分散式資料壓縮收集演算法★ 車用WiFi網路中的碰撞分析
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 「無線感測網路」被廣泛應用於環境監控、國土防衛等多重領域,多數應用均需要感測節點瞭解其本身之位置資訊,因感測節點通常係隨機且大量布放,故在既有條件下提升定位效能已成為重要研究課題。
無線干涉定位技術因具有準確性高、無需額外增加設備成本、室內外環境皆可運用等特性,非常適合做為無線感測網路之定位方法,然無線干涉定位方法亦有運算負荷大、可能產生模糊結果等缺點。先前之無線干涉定位相關演算法對初始階段網路結構之假設要求過於強烈,且常忽略運算複雜度過大之問題,在本論文中我們以「無線干涉定位系統」為研究對象,先就其它相關演算法特性進行比較,再提出更具網路適應性且不增加運算負擔之演算法,並以模擬方式驗證其效能。
摘要(英) 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.
關鍵字(中) ★ 無線感測網路
★ 無線干涉定位
關鍵字(英) ★ Wireless Sensor Network
★ RIPS
★ Efficient Localization Algorithm
論文目次 1. Introduction 1
2. Related Work 3
2.1 Wireless Sensor Network Localization Techniques 3
2.2 Research Fields of WSN Localization 5
3. Concept of Improved Algorithm 8
3.1 Characteristics of RIPS 8
3.2 Problem Description 9
3.3 Efficient Localization Algorithm 12
3.3.1 Distributed Self-Localization [2] 12
3.3.2 Node Self-Localization in Large Scale Sensor Networks [4] 13
3.3.3 Improved Trilateration 15
3.3.4 Comparison of Algorithms in Efficiency and Availability 17
4. Analysis of Simulation Result 20
4.1 Simulation Parameters 20
4.2 Simulation Result 21
5. Conclusion 23
References 24
參考文獻 [1] M. Maroti et al, ”Radio interferometric geolocation”,in 3rd International Conference on Embedded Networked Sensor Systems, SenSys’05, San Diego, CA, USA, 2005, pp. 1-12.
[2] M. Brazil et al, “Distributed Self-Localization in Sensor Networks using RIPS Measurements”, Proceeding of the world Congress on Engineering 2007 Vol II, WCE 2007, 2-4 July 2007, London, U.K.
[3] X. Wang, B. Moran, M. Brazil, “Hyperbolic Positioning Using RIPS Measurements for Wireless Sensor Networks”, ICON, 2007
[4] L. S. Barbara, X. Wang, and B. Moran, “Node self-localisation in large scale sensor networks”, Proceeding of International Conference on Information, Decision and Control (IDC 2007), pp. 188-192, Adelaide, Australia, 11-14 Feb. 2007
指導教授 孫敏德(Min-Te Sun) 審核日期 2014-1-29
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明