跳到主要內容

臺灣博碩士論文加值系統

(44.192.38.248) 您好!臺灣時間:2022/11/30 20:55
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:林裕生
研究生(外文):Yu-Sheng Lin
論文名稱:無線網路上以電力平衡為考量之分散式路徑繞送通訊協定之研究
論文名稱(外文):A Study on Power-Aware Distributed Routing Protocol with Load-Balance in Wireless Networks
指導教授:許丕榮許丕榮引用關係
指導教授(外文):Pi-Rong Sheu
學位類別:碩士
校院名稱:國立雲林科技大學
系所名稱:電機工程系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:中文
論文頁數:68
中文關鍵詞:集中式演算法無線網路分散式通訊協定
外文關鍵詞:distributed routing protocolcentralized algorithmswireless network
相關次數:
  • 被引用被引用:0
  • 點閱點閱:106
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
現在的學術界再近幾年對於MANET已經有相當廣泛的研究,並且有相當豐富的研究成果。無線行動隨意網路(Mobile Ad Hoc Networks,MANET)是由一群移動式的行動裝置所形成的無線網路。由於MANET不需要建設基礎架構而且在MANET上的每一個行動裝置都具有路由器的功能。因此兩個行動裝置若在傳送範圍內則可以直接傳遞資訊,若不在傳輸範圍內就必須透過其他行動裝置來幫忙傳送封包。而MANET可以應用在,如:戰場上的通訊、災難救助等狀況。
在本論文裡主要探討分散式路徑繞送通訊協定,也就是路徑繞送之電力負載平衡問題。主要研究的問題有四個:1. 多對一最大為最小路徑繞送問題。2. 多對多最大為最小路徑繞送問題。3. 多對一Qos路徑繞送問題。4. 多對多Qos路徑繞送問題。針對此四個問題,用分散式通訊協定來求解這四個問題。由模擬結果可以得知,用分散式通訊協定求解與集中式演算法作比較,集中式演算法與分散式演算法的答案相差不遠。
在本論文裡,我們對於MANET提出以電力平衡為考量之分散式多播路徑繞送問題之研究,主要探討在分散式路徑繞送通訊協定。
Nowadays, electronics and communication engineering specialists have been exploring extensive studies in MANET and have achieved a brilliant work recently.Mobile Ad Hoc Networks, MANET Mobile Ad Hoc Networks, also known as MANET, is a wireless network that is dynamically established among a group of mobile hosts within the communication range.Concerning MANET, it doesn’t need to have Infrastructure Wireless LAN; moreover, each mobile host has the function of a router. That is to say, two mobile hosts can transmit data within the communication range, whereas other mobile hosts are needed when the hosts are beyond the communication range.MANET is now applied to the communication in battles, disaster rescues and so forth.Hence, distributed routing protocol will come forward and be the most important issue in this article, which means that we are going to discuss the load balancing of electric power of distributed routing protocol in the follow-up pages.
There are four questions that we are going through here:1.min-max routing protocol. 2.min-max routing protocol. 3.many-to-one Qos routing protocol. 4.many-to-many Qos routing protocol. We will use distributed routing protocol trying to find the keys to the questions above. In terms of the calculation , we can learn that there are no apparent differences between using distributed routing protocol and centralized algorithms.
In brief, we present a study on exact algorithms for power-aware multicast routing problem in wireless networks in this article, and we mostly want to explore the issue of distributed routing protocol.
中文摘要 I
英文摘要 III
目錄 V
表目錄 VII
圖目錄 VIII
一、導論 1
二、相關研究工作 5
2.1 路徑繞送通訊協定 5
2.1.1 Destination-Sequence Distance-Vector Routing (DSDV) 7
2.1.2 Ad Hoc On-Demand Distance Vector routing (AODV) 8
三、分散式多對1最大為最小路徑繞送通訊協定 13
3.1 通訊協定 13
3.1.1通訊協定概要 13
3.1.2通訊協定封包格式 13
3.2 虛擬碼 15
3.3通訊協定範例 16
3.4 模擬結果 21
四、分散式多對多最大為最小路徑繞送通訊協定 23
4.1 通訊協定 23
4.1.1通訊協定概要 23
4.1.2通訊協定封包格式 23
4.2 虛擬碼 25
4.3通訊協定範例 26
4.4 模擬結果 31
五、分散式多對1 QOS路徑繞送通訊協定 33
5.1 通訊協定 33
5.1.1通訊協定概要 33
5.1.2通訊協定封包格式 33
5.2 虛擬碼 35
5.3通訊協定範例 36
5.4 模擬結果 41
六、分散式多對多QOS路徑繞送通訊協定 43
6.1 通訊協定 43
6.1.1通訊協定概要 43
6.1.2通訊協定封包格式 43
6.2 虛擬碼 45
6.3通訊協定範例 46
6.4 模擬結果 51
七、結論 53
參考文獻 54
[AcRo05] T. Acharya, and R. Roy, “Distributed algorithm for power aware minimum connected dominating set for routing in wireless ad hoc network,” International Conference Workshops on Parallel Processing, pp. 387-394, 2005.
[CCWZ06]Y. Cao, H. Chen, J. Wang, and C. Zhengi, “A Distributed Algorithm for Connecting Dominating Sets in Wireless Ad Hoc Networks,” International Conference on Communications, vol. 3, pp. 1472-1476, June 2006.
[CTSK04]Y.-S. Chen, Y.-C. Tseng, J.-P. Sheu, and P.-H. Kuo, “An On-Demand, Link-State, Multi-Path QoS Routing in a Wireless Mobile Ad-Hoc Network”, Computer Communications, vol. 27, No. 1, pp. 27-40, Jan. 2004.
[ChTa99] J. H. Chang and L. Tassiulas, “Routing for Maximum System Lifetime in Wireless Ad-Hoc Networks,” Proceedings of 37-th Annual Allerton Conference on Communication Control and Computing Monticello, Sept. 1999.
[Dala97] Y.K. Dalal, “A Distributed Algorithm for Constructing Minimal Spanning Trees,” IEEE Transactions on Software Engineering, vol. SE-13, pp. 398-405, 1987.
[FKKO03] P. Flor ´een, P. Kaski, J. Kohonen, and P. Orponen, “Multicast Time Maximization in Energy Constrained Wireless Networks,” Proceedings of the 2003 joint workshop on Foundations of mobile computing, pp. 50 – 58, Sep. 2003.
[GaRU04] L. Gatani, G. L. Re, A. Urso, “Distributed algorithms for multicast tree construction,” International Symposium on Control, Communications and Signal Processing, pp. 361-364, 2004.
[Hass05] Z. J. Hass, “A new routing protocol for the reconfigurable wireless networks,” International Conference on Universal Personal Communications, pp. 562-566, 1997.
[Hung98] Y. C. Hung, “Distributed algorithms for the constrained quickest routing problem in multimedia communications,” International Conference on Computer Communications and Networks, pp. 352-359, 1998.
[JoMa96] D. B. Johnson, and D. A. Maltz, “ynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, pp. 153-81, 1996.
[KGOC02] D. Kim, J. J. Garcia, K. Obraczka, J. Cano and P. Manzoni, “Power-Aware Routing Based on Energy Drain Rate for Mobile Ad Hoc Networks,” Proc. of Computer Communication and Networks, pp. 565-569, 2002.
[LeGe01]S. J. Lee and M. Gerla, “Dynamic Load-Aware Routing in Ad Hoc Networks,” IEEE International Conference on Communications, vol. 10, pp. 3206-3210, June 2001.
[Li05]李育廷, 隨意網路上以電力效率與負載平衡為考量之高效能任意播路徑繞送通訊協定之研究, 國立雲林科技大學, 2005.
[LoLe00] C. P. L0w, and Y. J. Lee, “Distributed multicast routing, with end-to-end delay and delay variation constraints,” computer communication, pp. 848-862, 2000.
[MaCo97] J. Macker, and S. Corson, “Mobile Ad Hoc Networks (MANET),” http://www.ietf.org/html.charters/manet-charter.html, IETF Working Group Charter , 1997.
[MaLa06] R. Madan, and S. Lall, “Distributed algorithms for maximum lifetime routing in wireless sensor networks,” IEEE Transactions on Wireless Communications, vol. 55, pp. 2185-2193, 2006.
[MiBa02]A. Misra, and S. Banerjee, “MRPC: Maximizing Network Lifetime for Reliable routing in Wireless Environments,” WCNC, pp. 800-806, Mar. 2002.
[OgRS93] R.G. Ogier, V. Rutenburg, and N. Shacham, “Distributed algorithms for computing shortest pairs of disjoint paths,” IEEE Transactions on Information Theory, vol. 39, pp. 443-455, 1993.
[PeBh94]C. E. Perkins, and P. Bhagwat, “Highly Dynamic Destination-Sequence Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM, pp.234-44, Aug. 1994.
[PeRo99] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Workshop Mobile Computing Systems and Applications, 1999.
[ShHu05] X. Sheng, and Y. H. Hu, “Distributed particle filters for wireless sensor network target tracking,” IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 845-848, 2005.
[ShWo06] A. R. M. Shariff, and M. E. Woodward, “A distributed algorithm for unicast QoS-routing using path feasibility prediction,” Workshop on High Performance Switching and Routing, pp. 235-240, 2006.
[RaMu07]B. Rashid, and Muhammad, “A Distributed Geometric Routing Algorithm for Ad Hoc Wireless Networks,” International Conference on Information Technology, pp. 961-963, April 2007.
[ScBa96] K. Scott, and N. Bambos, “Routing and Channel Assignment for Low Power Transmission in PCS,” ICUPC ’96, 1996.
[SiWR98] S. Singh, M. Woo, and C. S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. MobiCom ’98, Oct. 1998.
[XiBe05] Z. Xiaoqing, and G. Bernd, “A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks,” IEEE International Conference on Multimedia and Expo, pp. 1484-1487, 2005.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文