簡易檢索 / 詳目顯示

研究生: 沈易宗
I-Tsung Shen
論文名稱: 一個在無線感測網路上的分散式導航協定
A Distributed Guiding Navigation Protocol for Wireless Sensor Networks
指導教授: 陳文村教授
Prof. Wen-Tsuen Chen
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2005
畢業學年度: 94
語文別: 中文
論文頁數: 1冊
中文關鍵詞: 無線感測網路導航系統
外文關鍵詞: Wireless sensor networks, guiding navigation, Delaunay Triangulation
相關次數: 點閱:4下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 導航系統(Guiding Navigation System)是在無線感測網路(Wireless Sensor Networks)上的一種重要應用。這種應用的主要目標在於,在一個被感測網路監控的環境中,由感測器(sensor)建造出導航到出口最適當的路徑,並且在不接近危險區域的前提之下,將環境中的人安全的導引出去。在本篇論文中,我們提出了一個分散式的導航協定來建立一種區域對區域(area-to-area)的最佳導航路徑。我們使用了一個localized Delaunay triangulation的方法來將無線感測網路分割成許多的三角區域,並且提出了判斷的規則來將這些區域連結成區域對區域的導航路徑。再者我們對於危險狀況的出現也提出了一套相對應的路徑更改措施。最後,對於多出口環境中有可能會出現的出口負載不平衡問題,我們在環境中加入了額外的無線網路基地台(AP)來做負載分散的工作,如此能夠平均的將環境中的人導引到不同的出口進而有效的解決這個問題。相關的效能分析顯示,我們的方法可以正常的運作在不同的網路拓樸和不同的危險區域位置上,而且反應時間都相當的快速。此外我們的負載分散方法在不同的出口容量及使用者分布中都能有很好的分散表現。


    One of the major applications of sensor networks is guiding navigation whose goal is to find a way to guide moving objects across a region covered by sensors. Sensor networks maintain safe paths by which the moving objects can be guided safely to exits. In this thesis, we propose a distributed protocol for constructing area-to-area optimal guiding paths that do not traverse through the dangerous areas and use the localized Delaunay triangulation method [2, 3] to divide the region covered by a sensor network into many small triangular areas. Moreover, we propose a load-balance algorithm including an additional AP layer for moving objects registration and path assignment in multi-exits scenario. Hence, the moving objects can be properly dispersed to multiple paths leading to exits to avoid congestion.

    第一章 簡介............................1 第二章 相關研究........................2 第三章 分散式導航協定..................3 第四章 模擬結果與效能評估..............4 第五章 結論與未來研究..................5

    [1] Q. Li, M.D. Rosa, and D. Rus, “Distributed algorithms for guiding navigation across a sensor network,” in Proc. ACM Mobicom, pp. 313-325, Sept. 2003.

    [2] X. Y. Li, G. Calinescu, P. J. Wan, and Y. Wang, “Localized Delaunay triangulation with application in ad hoc wireless networks,” IEEE Trans. Parallel and Distributed Systems, Vol. 14, Issue 10, Oct. 2003.

    [3] X. Y. Li, G. Calinescu, and P. J. Wan, “Distributed construction of a planar spanner and routing for ad hoc wireless networks,” in Proc. IEEE INFOCOM, Vol. 3, pp. 1268-1277, June 2002.

    [4] X. Y. Li, P. J. Wan, and O. Frieder, “Coverage in wireless ad hoc sensor networks,” IEEE Trans. Computers, Vol. 52, Issue 6, June 2003.

    [5] S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak, ”Exposure in wireless Ad-Hoc sensor networks” in Proc. ACM SIGMOBILE, pp.139-150, July 2001.

    [6] Crossbow Technology Inc. http://www.xbow.com/

    [7] TINYOS http://www.tinyos.net/

    [8] K. Langendoen, and N. Reijers, “Distributed localization in wireless sensor networks: a quantitative comparison” Computer Networks: The Int. Journal of Computer and Telecommunications Networking, Vol. 43, Issue 4, Nov. 2003.

    [9] N. Bulusu, J. Heidemann, and D. Estrin, “Adaptive beacon placement,” in Proc. IEEE ICDCS, pp.489-498, Apr. 2001.

    [10] A. Galstyan, B. Krishnamachari, and K. Lerman, “Distributed online localization in sensor networks using a moving target,” in Proc. ACM IPSN, pp. 61-70, Apr. 2004.

    [11] P. Corke, R. Peterson, and D.Rus, “Communication-assisted Localization and Navigation for Networked Robots,” Int. Journal of Robotics Research, June 2004.

    [12] M. A. Batalin and G. S. Sukhatme, “Coverage, Exploration and Deployment by a Mobile Robot and Communication Network,” in Proc. Int. Workshop on Information Processing in Sensor Networks, pp. 376-391, Apr. 2003.

    [13] M. A. Batalin, G. S. Sukhatme, and Myron Hattig, “Mobile Robot Navigation using a Sensor Network,” in Proc. IEEE ICRA, pp. 636-642, Apr. 2003.

    [14] CSIM http://mesquite.com/documentation/index.htm

    [15] F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, “A Two-Tier Data Dissemination Model for Large-scale Wireless Sensor Networks” in Proc. ACM Mobicom, pp. 148-159, Sept. 2002.

    [16] P.Bose and P.Morin, “Online routing in triangulations,” in Proc. 10th Ann. Int. Symp. on Algorithms and Computation ISAAC, pp. 113-122, 1999.

    [17] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with guaranteed delivery in ad hoc wireless networks,” in Proc. ACM Wireless Networks, Vol. 7, pp. 609-616, Nov. 2001.

    [18] E. Kranakis, H. Singh, and J. Urrutia, “Compass routing on geometric networks,” in Proc. 11th Canadian Conference on Computational Geometry, pp. 51–54, Aug. 1999.

    [19] K. J. O`Hara, T. R. Balch, “Distributed Path Planning for Robots in Dynamic Environments Using a Pervasive Embedded Network,” in Proc. ACM Int. Joint Conf. on Autonomous Agents and Multiagent Systems, pp. 1538-1539, July 2004.

    [20] F. P.Preparata, M.I.Shamos, “Computational Geometry: An Introduction,” Springer-Verlag, 1985.

    [21] S. Meguerdichian, F. Koushanfar, M. Potkonjak, M. B. Srivastava, “Coverage Problems in Wireless Ad-hoc Sensor Networks,” in Proc. IEEE INFOCOM, Vol. 3, pp. 1380-1387, Apr. 2001.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE