English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51491/86611 (59%)
Visitors : 8247284      Online Users : 77
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/87993

    Title: 無線隨意網路中省電傳遞路徑分析
    Other Titles: Energy efficient paths analysis in wireless ad hoc network
    Authors: 邱立平;Ciou, Li-Ping
    Contributors: 淡江大學資訊工程學系資訊網路與通訊碩士班
    Keywords: 省電;無線隨意網路;選徑;Energy Efficient;Wireless ad hoc network;routing
    Date: 2012
    Issue Date: 2013-04-13 11:55:44 (UTC+8)
    Abstract: 在無線隨意網路中,所有裝置都是倚賴電池來維持動力。當無線裝置傳輸狀態時,耗電量是最大的。傳統無線隨意網路中,選徑協定在有資料要傳輸時尋找一條傳輸路徑,而所找到的傳輸路徑往往是使用最少跳躍次數的路徑。由於傳輸所需電力與距離平方成正比,所以最短路徑可能並不是最省電的路徑。
    Energy Conservation has been the focus in the ad hoc wireless network study. As the capacity of battery is limited, node will lose its function once its energy is exhausted. This thesis is aiming to calculate among the multiple transmission paths and find out a path which consumes the least energy. Previous studies are focused on finding the minimum hop path in transmission. In this study we propose to use the square of the distance between nodes as a proxy to the power consumption as the transmission power is proportional to the square of the distance between the nodes.
    We simulate the node transmission by limiting node out-degree in broadcasting and calculate the minimum sum of the square of distance between nodes in the path to find a path which has the least energy consumption.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback