簡易檢索 / 詳目顯示

研究生: 何志翔
Chih-Hsiang Ho
論文名稱: 無線感測網路上基於涵蓋的路由協定設計
The Design of Coverage-Based Routing Protocols for Wireless Sensor networks
指導教授: 蔡育仁
Yuh-Ren Tsai
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 通訊工程研究所
Communications Engineering
論文出版年: 2005
畢業學年度: 93
語文別: 英文
論文頁數: 56
中文關鍵詞: 無線感測網路路由協定感測涵蓋範圍叢聚涵蓋的維持聚集
外文關鍵詞: wireless sensor networks, routing protocols, sensing coverage, cluster, coverage preservation, aggregation
相關次數: 點閱:3下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 摘要
    在本論文中,我們藉由對感測涵蓋範圍 (sensing coverage) 的考量設計了在無線感測網路上的路由協定,稱之為基於涵蓋的路由協定 (Coverage-based routing protocols)。針對無線感測網路,多數已發展出來的路由協定都是基於能量如何有效的被運用為考量。然而,他們卻沒有針對如何維持感測涵蓋範圍的問題去設計其路由協定。在許多的應用上,感測裝置是被任意的散佈在欲觀察的區域。因此,這個欲觀察區域的某些地方可能被數個感測裝置點給涵蓋。同時,在觀察區域的另外一些地方可能僅僅被一個感測裝置點給涵蓋。這意味著當這些感測裝置消耗完他們的能量之後,不同的地方將造成涵蓋上不同程度的損失。所以,為了獲得較好的涵蓋表現,我們提出的路由協定是以每個感測裝置點涵蓋範圍與鄰近感測裝置點涵蓋範圍所造成的重疊量做為設計上的考量,亦即是從感測裝置點在觀察區的散佈情況 (即網路拓撲)考量每個感測裝置點有效的涵蓋。我們所提出的基於涵蓋的路由協定是根據原來LEACH (Low Energy Adaptive Clustering Hierarchy)和以格子為基礎的路由協定 (Grid-based routing protocols) 所修改而成的。在LEACH方面,我們修改了原來Cluster-Head 選取機制 (Cluster-head selection algorithm)讓感測裝置點當Cluster-head的機會與每個感測裝置點有效的涵蓋量有關。在以格子為基礎的路由協定方面,我們採用了相似的做法。模擬的結果顯示基於涵蓋的路由協定在整個網路的感測涵蓋表現上大約比相對應原來相關的路由協定有15% ~ 20% 的增益。


    Abstract

    In this thesis, we design the routing protocols with the consideration of sensing coverage for wireless sensor works, which is called coverage-based routing protocols. The majority of routing protocols have been developed for wireless sensor networks are based on energy-efficient consideration. However, they do not address the problem of preserving sensing coverage. In many applications, sensor nodes are deployed randomly over the desired area. Therefore, some area may be covered by several nodes. Concurrently, there may be also some other area that is covered by only one node. This implies that after nodes have used up their own energy resource, nodes in different area may result in different amount of coverage loss. Consequently, in order to obtain better coverage performance, the proposed routing protocols take the amount of overlapped coverage of each node into account, i.e. considering the effective coverage from the node distribution (i.e. network topology). The proposed coverage-based routing protocols are modified from the original LEACH and grid-based routing protocols. Simulation results show that coverage-based routing protocols perform approximately 15% ~ 20% better than the other related protocols in the term of network sensing coverage.

    Contents Abstract i Contents ii 1 Introduction 1 2 Review of Related Routing Protocols 4 2.1 LEACH Routing Protocol...............4 2.1.1 Cluster-Head Selection Algorithm (CHSA).................................................4 2.1.2 The Detailed Operation in LEACH...............5 2.1.2.1 Setup Phase..........................6 2.1.2.2 Steady-State Phase ..........7 2.2 Extended LEACH’s CHSA with Energy Factor......9 2.3 Gird-Based Routing Protocols..................10 3 Coverage-Based Routing Protocols 14 3.1 Motivation....................................14 3.2 Overlapped Coverage Metric....................16 3.3 Coverage-Based Routing Protocol Based on LEACH..................................................20 3.3.1 CHSA with the Consideration of Coverage Preservation...........................................20 3.3.2 The Detailed Operation for the Coverage-Based Routing Protocol Based on LEACH........................22 3.4 Coverage-Based Routing Protocol Based on Gird-Based Routing..........................................26 3.4.1 The Design of Local Aggregator (LA) Selection..............................................27 3.4.2 The Detailed Operation for the Coverage-Based Routing Protocol Based on Grid-Based Routing...........28 4 Simulation Results & Discussions 32 4.1 System Model for Experiment...................32 4.1.1 Basic Assumptions & Simulation Parameters.....32 4.1.2 Power Consumption Model.......................35 4.2 Simulation Results for the Coverage-Based Routing Protocol Based on LEACH................................37 4.2.1 Performance Comparisons.......................37 4.2.2 Comparisons in Different System Parameters....41 4.3 Simulation Results for the Coverage-Based Routing Protocol Based on Grid-Based Routing...................47 5 Conclusion 54 Bibliography 55

    Bibliography

    [1] R. C. Shah and J. M. Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sensor Network,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), vol. 1, pp. 350-355, Mar. 2002.
    [2] W. R. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-Efficient
    Communication Protocol for Wireless Microsensor Networks,” in Proc. 33rd Hawaii International Conference on System Sciences, vol. 2, Jan. 2000.
    [3] S. Lindsey and C. S. Raghavendra, “PEGASIS: Power-Efficient Gathering in Sensor Information Systems,” in Proc. IEEE Aerospace Conference, pp. 1125-1130, Mar. 2002.
    [4] W. Ye, J. Heidemann and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” in Proc. IEEE INFOCOM, pp. 1567-1576, June. 2002.
    [5] S. Meguerdichian, F. Koushanfar, M. Potkonjak and M. B. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” in Proc. IEEE INFOCOM, vol. 3, pp. 1380–1387, Apr. 2001.
    [6] C.-F. Huang and Y.-C. Tseng, “The Coverage Problem in a Wireless Sensor Network,” in Proc. ACM International Conference on Wireless Sensor Networks and Applications (WSNA), pp. 115–121, Sep. 2003.
    [7] D. Tian and N. D. Georganas, “A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks,” in Proc. ACM International Workshop on Wireless Sensor Networks and Applications, Oct. 2002.
    [8] M. J. Handy, M. Haase and D. Timmermann, “Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection,” in Proc. International Workshop Mobile and Wireless Communications Network, pp. 368-372, Sep. 2002.
    [9] N. Bulusu, J. Heidemann and D. Estrin, “GPS-less low cost outdoor localization for very small devices”, IEEE Personal Communications Magazine, vol. 7, no. 5, pp. 28-34, Oct. 2000.
    [10] S. Capkun, M. Hamdi and J. Hubaux, “GPS-free Positioning in Mobile Ad Hoc Networks,” in Proc. 34th Hawaii International Conference on System Sciences, pp. 3481-3490, Jan. 2001.
    [11] W.-H. Liao, Y.-C. Tseng and J.-P. Sheu, "GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks," Telecommunication Systems, vol.18, pp. 37-60, 2001.
    [12] Y. Xu, J. Heidemann and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” in Proc. ACM/IEEE International Conference on Mobile Computing and Networking, pp. 70–84, July 2001.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
    QR CODE