(3.237.178.91) 您好!臺灣時間:2021/03/07 02:04
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:蘇育瑤
論文名稱:考量轉送節點間競賽之無線網狀網路機會路由機制
論文名稱(外文):Opportunistic Routing with Considering Race among Forwarders in Wireless Mesh Networks
指導教授:梁世聰
學位類別:碩士
校院名稱:臺北市立教育大學
系所名稱:資訊科學系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2011
畢業學年度:99
語文別:中文
中文關鍵詞:機會路由無線網狀網路IEEE 802.11
外文關鍵詞:opportunistic routing, wireless mesh network, IEEE 802.11s
相關次數:
  • 被引用被引用:0
  • 點閱點閱:143
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:14
  • 收藏至我的研究室書目清單書目收藏:0
研究顯示機會路由應用於具遺失通道的無線網狀網路環境可有效提升網路吞吐量。不同於傳統的路由機制其封包之傳輸僅經由既定路徑之節點來轉發,機會路由技術允許多個收聽到封包的節點形成一轉發集,集合中之成員皆有機會實際參與該封包之轉發。現有機會路由協定通常由傳送端主導實際轉發節點之選擇,而忽略轉發集成員當前之負載。本論文提出一考慮轉發集成員負載之機會路由機制。具體來說,除了考量封包遞送機率之外,一傳送封包之可能轉發集僅能包含彼此在傳輸範圍覆蓋的無線節點。搭配有效的佇列管理機制,所提方案將使得從一封包傳送之轉發集脫穎而出的實際轉發節點係最早為該封包轉送取得無線通道之節點。因此,無線網狀網路中有效率和支援負載平衡之機會路由當可實現。數值分析結果顯示所提方法相較於傳統路由機制可達較高之封包遞送率。整體來看,所提機制不僅簡單、效率高,而且符合IEEE802.11s的MAC協議。
Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from traditional routing mechanisms in which a transmitting packet is only forwarded by the node along with the deterministic path, the opportunistic routing technique allows multiple nodes hearing the packet to form the forwarder set containing promising candidates for the packet forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic routing mechanism with considering race among forwarders is proposed. Specifically, in addition to the consideration of delivery probability, a candidate of the forwarder set for a given transmitter is restricted to those wireless nodes whose transmission range covers one another. Augmented with the novel queue management, our proposal makes the true forwarder picked from the forward set of a given transmitting packet being the one who gains access to wireless channel for the packet before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Numerical results show that the proposed method compared to the traditional routing methodology can achieve the high packet delivery ratio. Overall, the proposed scheme is simple, efficient, and compliant to the IEEE 802.11s MAC protocol.
中文摘要 i
Abstract ii
目次 iii
圖目次 iv
表目次 v
1、緒論 1
1.1、研究背景 1
1.2、研究動機與目的 3
1.3、論文組織與架構 4
2、相關研究 5
2.1、IEEE802.11s 簡介 5
2.2、ExOR機制 9
2.3、其他相關路由機制 11
2.3.1、COPE機制 11
2.3.2、MORE機制 13
2.3.3、EMORE機制 15
2.3.4、CORE機制 16
3、考量轉送節點間競賽之無線網狀網路機會路由機制 18
3.1、實例說明 19
3.2、系統模型 22
3.3、演算法 23
3.4、IEEE802.11s機會路由之實現 25
4、數值分析 37
5、結論及未來展望 39
參考文獻 40
[1] C. Cetinkaya and E. Knightly, “Opportunistic traffic scheduling over multiple network paths,” In Proceedings of IEEE Infocom, September 2004.
[2] B. Sadeghi, V. Kanodia, A. Sabharwal, and E. Knightly, “Opportunistic media access for multirate ad hoc networks,” In Proceedings of ACM Mobicom 2002, September 2002.
[3] Szymon Chachulski, Michael Jennings, Sachin Katti, and Dina Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing,” In Proc. of ACM SIGCOMM 2007.
[4] Fan Wu, Vijay Raman, and Nitin Vaidya, “Being Opportunistic or Being Concurrent— On Designing Channel Assignment Algorithms in Multi-Radio, Multi-Channel Wireless Mesh Networks,” 2010 7th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks (SECON), 2010.
[5] YAN YAN and BAOXIAN ZHANG, “CORE: A Coding-Aware Opportunistic Routing Mechanism For Wireless Mesh Networks,” IEEE Wireless Communications, vol. 17(3), pp. 96–103, June 2010.
[6] S. Katti et al., “XORs in the Air: Practical Wireless Network Coding,” In Proceedings of ACM SIGCOMM ‘06, Pisa, Italy, Sept. 2006, pp. 243–54.
[7] Sanjit Biswas and Robert Morris, “ExOR: Opportunistic MultiHop Routing for Wireless Networks,” In Proceedings of SIGCOMM, 2005, pp. 133-144.
[8] YAN YAN and BAOXIAN ZHANG, “CORE: A Coding-Aware Opportunistic Routing Mechanism For Wireless Mesh Networks” , IEEE Wireless Communications, vol. 17(3), pp. 96–103, June 2010.
[9] Szymon Chachulski, Michael Jennings, Sachin Katti, and Dina Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing” , In Proc. of ACM SIGCOMM 2007.
[10] Fan Wu, Vijay Raman, and Nitin Vaidya, “Being Opportunistic or Being Concurrent— On Designing Channel Assignment Algorithms in Multi-Radio, Multi-Channel Wireless Mesh Networks” , 2010 7th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks (SECON), 2010.
[11] S. Katti et al., “XORs in the Air: Practical Wireless Network Coding” , In Proceedings of ACM SIGCOMM ‘06, Pisa, Italy, Sept. 2006, pp. 243–54.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔