王勝德臺灣大學：電機工程學研究所黃健豐Huang, Jian-FengJian-FengHuang2007-11-262018-07-062007-11-262018-07-062004http://ntur.lib.ntu.edu.tw//handle/246246/53011在無線Ad Hoc網路中，廣播的操作雖然是基本的，但就能量消耗的方面而言，卻是昂貴的。在DP (dominant pruning) 演算法中，forward nodes 的數量是被視作為評估能量消耗的準則。然而如果power-adaptive的特性是被支援的話，這個原則將不再適用；在這樣的支援下，每個節點能夠感測出收到封包的訊號強度，並且還可以調整本身傳送訊息的必v強度。所以在這篇論文中我們提出一個修改版本的DP演算法，其目標在於減少forward nodes 的總消耗能量。和原本的 DP演算法比較，我們方法中的傳送端點不但選定了forward nodes，並且指派每個forward node的傳輸範圍。結果這些傳輸範圍不僅維持和DP相同的涵遢d圍，同時減緩總共消耗的能量。我們提出一個新的forward nodes selection process，在新的方法中每個節點的權重主要取自於增加的傳輸成本(incremental transmission cost)，而不是有效的維度(effective degree)。雖然我們的方法會產生較多的forward nodes，但是從模擬的結果來看，我們所消耗的能量會小於DP所消耗的。The broadcast operation in ad hoc wireless networks is essential, but expensive in terms of power consumption. In DP (dominant pruning) algorithms, the number of forward nodes is treated as a criterion to measure the consumed power. However, this principle is not suitable anymore if the power-adaptive characteristic is supported where each node can detect the strength of a received packet and tune its transmission power level. Thus, in this thesis, we propose a modified version of the DP algorithm with the objective being to minimize the total power consumption of forward nodes. Comparing with original DP algorithms, the sender in our algorithm not only chooses its forward nodes, but also designates the transmission ranges of its forward nodes. As a result, the designated transmission ranges not only maintain the same coverage as DP algorithms, but also reduce the total power consumption. We propose a new forward nodes selection process where the weight of a node is dependent on the incremental transmission cost rather than the effective degree. Although the resultant number of forward node in the proposed approach is often greater than DP algorithms, the power consumption shown in simulations is less than DP algorithms.謝辭 .....................................................1 中文摘要 .................................................2 Abstract .................................................3 目錄 .....................................................4 表格 .....................................................5 圖列 .....................................................6 1. Introduct .............................................7 2. Wireless Communication Model .........................10 3. Related Works ........................................11 3.1 Dominant Pruning Algorithm .......................11 3.2 PowerAdaptive Broadcast Algorithms ...............13 4. The Transmission Range Designation Broadcast Algorithm .........................................................14 4.1 Basic Idea .......................................15 4.2 The Transmission Range Designation Broadcast Algorithm .........................................................17 4.3 Reduce the uncovered twohop neighbor set U .......21 4.4 The full coverage of nodes within the two-hop neighborhood ............................................22 4.5 The simple power-adaptive DP algorithms ...........................................22 4.6 Interference and spatial reuse ...................23 5. Simulations ..........................................24 5.1 Simulation descriptions ..........................24 5.2 Simulation Results ...............................25 6. Conclusion ...........................................31 References ..............................................32833215 bytesapplication/pdfen-USpower-adaptivedominant pruning廣播無線 ad hoc 網路wireless ad hoc networksbroadcastingthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/53011/1/ntu-93-R91921084-1.pdf