(3.236.100.86) 您好!臺灣時間:2021/05/07 09:15
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:黃健豐
研究生(外文):Jian-Feng Huang
論文名稱:無線隨意網路上指派傳輸範圍的廣播方式
論文名稱(外文):Transmission Range Designation Broadcasting Methods for Wirelss Ad Hoc Networks
指導教授:王勝德王勝德引用關係
指導教授(外文):Sheng-De Wang
學位類別:碩士
校院名稱:國立臺灣大學
系所名稱:電機工程學研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:英文
論文頁數:33
中文關鍵詞:power-adaptivedominant pruning廣播無線 ad hoc 網路
外文關鍵詞:power-adaptivedominant pruningwireless ad hoc networksbroadcasting
相關次數:
  • 被引用被引用:0
  • 點閱點閱:89
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在無線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 ..............................................32
[1]Wei Lou and Jie Wu,"On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks," IEEE Trans. On Mobile Computing, Volume: 1, Issue: 2, Apr-Jun 2002.
[2]Xiaohu Chen, Michalis Faloutsos, and Srikanth V. Krishnamurthy, "Power adaptive broadcasting with local information in ad hoc networks," Proc. International Conference on Network Protocols (ICNP''03), 2003.
[3]J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," Proc. nineteenth Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), 2000.
[4] J. Cartigny, D. Simplot, and I. Stojmenovic, "Localized minimum-energy broadcasting in ad-hoc networks," Proc. 22nd Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), 2003.
[5]T.S Rappaport, Wireless Communications, Principles and Practices, Prentice Hall,1996
[6] G.Toussaint, "the relative neighborhood graph of finite planar set," Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980
[7]H. Lim and C. Kim, “Muticast Tree Construction and Flooding in Wireless ad hoc networks,” Proc. ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), 2000.
[8]J.P. Linnartz, Narrow Band Land-Mobile Radio Networks, Artech House, 1993.
[9]W. Peng and X. Lu, “Efficient broadcast in mobile ad hoc networks using connected dominating sets,” Journal of software, vol. 12, no. 4, pp. 529-536, 2001.
[10]Wei Lou and Jie Wu, Localized broadcasting in mobile ad hoc networks using neighbor designation, accepted to appear in Handbook of Mobile Computing, I. Maghoub (ed.), CRC Press, 2004.
[11]L. Lovasz, “On the ration of optimal integral and fractional covers,” Discrete mathematics 13 (1975) 383-390.
[12]GloMoSim website, http://pcl.cs.ucla.edu/projects/glomosim/.
[13]S. Ni, Y. Tsereng, Y. Chen and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,”Proc. IEEE/ACM International Conference on Mobile Computing and Networking (MOBICOM), 1999.
[14]Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2000.
[15]I. Stojmenovic, S. Seddigh, and J. Zunic, “Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks,” IEEE Trans. Parallel and Distributed Systems, 13(1):14-25, Jan. 2002.
[16]Andrew S. Tanenbaum, Computer Networks, 4th Edition, Prentice Hall, 2003.
[17]E. M. Royer and C. K. Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Personal Communications, 6(2):46-55, 1999.
[18]C. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 90-100, Feb. 1999.
[19]D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks,” Mobile computing, T. Imielinski and H. Korth, Eds., Kluwer Academic Publ. 1996.
[20]V. D. Park and M. S. Corson,“A Highly Adaptive Distributed Routing Protocol for Mobile Wireless Networks,” Proc. Annual Joint Conference of the IEEE Computer and Communication (INFOCOM), 1997.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔