簡易檢索 / 詳目顯示

研究生: 何承宜
Cheng-Yi He
論文名稱: 在無線隨意網路上有效節省能源的拓樸控制
Energy-Efficient Topology Control Protocols in Wireless Ad Hoc Networks
指導教授: 蔡明哲
Ming-Jer Tsai
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2006
畢業學年度: 94
語文別: 英文
論文頁數: 37
中文關鍵詞: 無線隨意網路節能拓樸控制
外文關鍵詞: wireless ad hoc networks, power efficient, topology control
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在無線隨意網路的環境之下,由於每個節點是由電池所提供電力,所以省電一直是個非常重要的議題。在本文之中,我們想要解決的問題是,如何在無線網路的環境之下,藉由調整網路的拓樸,使得每個一個節點可以調降自己的傳輸電力,讓整個網路的傳輸電力可以盡可能的達到最小值,並且維持網路的聯通性。在本文之中,我們提出了分散式的拓樸控制演算法,在保持網路連通性的前提之下,我們的方法可以繼續降低整個網路的傳輸電量,並且可以架在其他的拓樸控制演算法之上,繼續改善整個網路所需的傳輸電量。接著我們介紹此方法的生成樹結構,此生成樹可以節省更多的電量,由於只需要由某一個點做出廣播的動作,所以只需要少量額外的封包訊息,但也因此會有網路的延遲效應問題。模擬結果顯示,不管架在哪一種網路拓樸控制之上,我們的方法可以有效率的降低整個網路所需要的傳輸電量,而我們所提出的生成樹結構也可以進一步的降低整個網路所需的傳輸電量,並且需要額外的封包訊息。


    In this thesis, we consider the minimum total node transmission power problem in a wireless ad hoc network, where each node is capable of adjusting the transmission range. To this purpose, we introduce the localized topology control incremental power protocol (LTIP). In addition, a localized method (LTIPT) of constructing a spanning tree is proposed to further decrease the total node transmission power. We compare by simulations the performance with several well-known existing topology control protocols. Simulations show that our methods improve the total node transmission power in the cost of moderate message communication overhead.

    Abstract Table of Contents List of Figures Chapter 1 Introduction Chapter 2 Related Works 2.1 RNG 2.2 LMST, LMST-, and LMST+ 2.3 IMRG, IMRG-, and IMRG+ Chapter 3 Topology Control Incremental Power Protocols 3.1 LTIP 3.2 LTIPT Chapter 4 Analysis of LTIP and LTIPT 4.1 Network Connectivity 4.2 Message Overhead Chapter 5 Performance Evaluation 5.1 Study of Node Degree 5.2 Evaluation of Transmission Power 5.3 Message Overhead Chapter 6 Conclusions Reference

    [1] Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Karayan, and Miodrag Potkonjak, “Localized Algorithms in Wireless Ad-Hoc Networks: Location Discovery and Sensor Exposure,” in Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pp. 106-116, October 2001.
    [2] L. Fang, W. Du, and P. Ning, “A Beacon-Less Location Discovery Scheme for Wireless Sensor Networks,” in Proceedings of the IEEE INFOCOM'05, March , 2005.
    [3] Ying-Hong Wang, and Chih-Chieh Chuang, “Ad Hoc On-Demand Backup Node Setup Routing Protocol,” Journal of Information Science and Engineering, 20(5), pp. 821-843, 2004.
    [4] A. Caruso, S. Chessa, S. De, and A. Urpi, “GPS Free Coordinate Assignment and Routing in Wireless Sensor Networks,” in Proceedings of the IEEE INFOCOM'05, March , 2005.
    [5] Stuart Cheshire, Bernard Aboba, and Erik Guttman, “Dynamic Con_guration of IPv4 Link-Local Addresses,” draft-ietf-zeroconf-ipv4-linklocal-07.txt, 23rd August 2002 .
    [6] Yibin Liang, “Multipath “Fresnel Zone” Routing For Wireless Ad Hoc Networks,” IEEE Wireless Communications and Networking Conference, vol. 4, pp. 1958- 1963, 2005.
    [7] W. Lou and J. Wu, “Double-covered broadcast (DCS): a simple reliable broadcast algorithm in MANETs,” in Proceedings of the IEEE INFOCOM'04, April 2004.
    [8] F. Ye, A. Chen, S. Lu, and L. Zhang, “A Scalable Solution to Minimum Cost Forwarding in Large Sensor Networks,” in Proceedings of 2001 IEEE International Conference on Computer Communications and Networks (ICCCN’2001).
    [9] D. Li, X. Jia, and H. Liu, “Energy efficient broadcast routing in static ad hoc wireless networks,” IEEE Transactions on Mobile Computing, vol. 3, pp. 144-151, 2004.
    [10] J. Hill, R. Szewczyk, A. Woo, S. Hollar, D.E. Culler, and K.S.J. Pister, “System Architecture Directions for Networked Sensors,” Architectural Support for Programming Languages and Operating Systems, pp. 93-104, 2000.
    [11] J. Wieselthier, G. Nguyen, and A. Ephremides, “On the construction of energy-efficient broadcast and multicast trees in wireless networks,” in in Proceedings of the IEEE INFOCOM 2000, 2000.
    [12] W. Liang, “Constructing minimum-energy broadcast trees in wireless ad hoc networks,” in Proceedings of Annual Workshop on Mobile and Ad Hoc Networking and Computing (MobiHoc’2002), Lausanne, Switzerland, 2002.
    [13] O. Eˇgecioˇglu and T. Gonzalez, “Minimum-energy broadcast in simple graphs with limited node power,” in Proceedings of IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2001), pages 334--338, Anaheim, CA, August 2001.
    [14] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized minimum-energy broadcasting in ad hoc networks,” in Proceedings of the IEEE INFOCOM'03, April 2003.
    [15] N. Li, JC Hou, and L. Sha, “Design and analysis of an MST-based topology control algorithm,” in Proceedings of the IEEE INFOCOM'03, April 2003.
    [16] Xiang-Yang Li, Yu Weng, Peng-Jun Wan, Wen-Zhan Song, and Ophir Frieder, “Localized Low-Weight Graph and Its Applications in Wireless Ad Hoc Networks,” in Proceedings of the IEEE INFOCOM'04, April 2004.
    [17] R. Prim, “Shortest connection networks and some generalizations,” The Bell System Technical Journal, vol. 36, pp. 1389-1401, 1957.
    [18] Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder, “Minimum-energy broadcast routing in static ad hoc wireless networks,” ACM Wireless Networks, 2002.

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