English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78852/78852 (100%)
Visitors : 37730933      Online Users : 997
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/8512

    Title: 使用功率調整來增加多節點封包無線網路;Increasing the Throughput of Multihop Packet Radio Networks with Power Adjustment
    Authors: 黃啟富;Chi-Fu Huang
    Contributors: 資訊工程研究所
    Keywords: 編碼分配;封包無線網路;功率控制;Code Assignment;Packet Radio Network;Power Control
    Date: 2001-07-03
    Issue Date: 2009-09-22 11:28:57 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 封包無線網路(Packet Radio Network [ PRN] )對於支援移動及無線通訊是一個極具吸引力的架構。在這樣的網路架構下,雖然編碼分配(Code Assignment)的問題己經被廣泛的討論,但是我們發現在大多數的研究中,對於網路效能有重大影響的功率控制(Power Control)問題卻都被忽略了。所謂的功率控制指的是站台的傳輸範圍是可調整的。對於一個所有站台都己分配到編碼的PRN ,我們展示了如何在不違反原來編碼分的前題下,透過功率的調整來控制/改善網路的拓樸。數種不同的方法這裡被提出。透過模擬的方示,我們展示了雖然編碼分配的問題是NP-complete 且因此運算成本是非常昂貴地,但是使用我們的功率調整,只需要有限的成本就可增加約20%的網路效能。 The Packet Radio Network (PRN) is an attractive architecture to support mobile and wireless communication. Although the code assignment problem has been studied extensively on PRN, we observe in this paper that the power control problem has been ignored by most works, but may have signicant impact on performance. By power control, we mean that the transmission ranges of stations are tunable. We show given a PRN in which each host already received a code, how to adjust the powers of stations to control/improve thetopology of the PRN without violating the original code assignment. Several schemes are proposed. Through simulations, we demonstrate that although the code assignment problem is NP-complete and thus computationally very expensive, using our power adjustment schemes can easily improve the network performance by about 20% with polynomial costs.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明