Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電機工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/46798
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor郭斯彥
dc.contributor.authorPei-Ju Chenen
dc.contributor.author陳沛汝zh_TW
dc.date.accessioned2021-06-15T05:41:35Z-
dc.date.available2013-08-22
dc.date.copyright2011-08-22
dc.date.issued2011
dc.date.submitted2011-08-19
dc.identifier.citation[1] S. Biswas and R. Morris, 'ExOR: opportunistic multi-hop routing for wireless networks,' ACM SIGCOMM Comput. Commun. Rev., vol. 35, pp. 133-144, Oct. 2005.
[2] D. S. J. D. Couto, D. Aguayo, J. Bicket, and R. Morris, 'A high-throughput path metric for multi-hop wireless routing,' Wireless Netw., vol. 11, pp. 419-434, 2005.
[3] M. Zorzi and R. R. Rao, 'Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance,' IEEE Trans. Mobile Comput., vol. 2, pp. 337-348, Oct.-Dec. 2003.
[4] D. B. Johnson, D. A. Maltz, and J. Broch, 'DSR: the dynamic source routing protocol for multihop wireless ad hoc networks,' in Ad Hoc Networking, ed: Addison-Wesley Longman Publishing Co., Inc., 2001, pp. 139-172.
[5] C. E. Perkins and E. M. Royer, 'Ad-hoc on-demand distance vector routing,' in IEEE Workshop Mobile Comput. Sys. Appl., 1999, pp. 90-100.
[6] C. E. Perkins and P. Bhagwat, 'Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers,' SIGCOMM Comput. Commun. Rev., vol. 24, pp. 234-244, 1994.
[7] R. Draves, J. Padhye, and B. Zill, 'Comparison of routing metrics for static multi-hop wireless networks,' SIGCOMM Comput. Commun. Rev., vol. 34, pp. 133-144, 2004.
[8] P. Larsson, 'Selection diversity forwarding in a multihop packet radio network with fading channel and capture,' presented at the Proc. ACM Int. Symp. Mobile Ad Hoc Netw. Comput., Long Beach, CA, USA, 2001.
[9] S. Jain and S. R. Das, 'Exploiting path diversity in the link layer in wireless ad hoc networks,' in IEEE Int. Symposium World Wireless Mobile Multimedia Netw. , 2005, pp. 22-30.
[10] C. Lott and D. Teneketzis, 'Stochastic routing in ad-hoc networks,' IEEE Trans. Autom. Control, vol. 51, pp. 52-70, Jan. 2006.
[11] E. M. Royer and C.-K. Toh, 'A review of current routing protocols for ad hoc mobile wireless networks,' IEEE Personal Commun., vol. 6, pp. 46-55, 1999.
[12] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, 'Trading structure for randomness in wireless opportunistic routing,' SIGCOMM Comput. Commun. Rev., vol. 37, pp. 169-180, Oct. 2007.
[13] X. Mao, S. Tang, X. Xu, X.-Y. Li, and H. Ma, 'Energy efficient opportunistic routing in wireless networks,' IEEE Trans. Parallel Distrib. Syst., vol. 8, pp. 1-8, Feb. 2011.
[14] A. N. Plymoth, A. Bhorkar, and P. Johansson, 'Common opportunistic routing and forwarding,' in IEEE Veh. Technol. Conf., May 2010, pp. 1-5.
[15] M. Kurth and J.-P. Redlich, 'Delay properties of opportunistic back-pressure routing in CSMA-based wireless mesh networks,' in IEEE Int. Symp. Personal, Indoor and Mobile Radio Commun., 2010, pp. 479-484.
[16] J. Bicket, D. Aguayo, S. Biswas, and R. Morris, 'Architecture and evaluation of an unplanned 802.11b mesh network,' in Proc. Annual Int. Conf. Mobile Comput. and Netw., Aug. 2005, pp. 31-42.
[17] Y. Li, Y.-A. Liu, and P. Luo, 'Link probability based opportunistic routing metric in wireless network,' in Int. Conf.Commun. and Mobile Comput., Jan. 2009, pp. 308-312.
[18] L. Pelusi, A. Passarella, and M. Conti, 'Opportunistic networking: data forwarding in disconnected mobile ad hoc networks,' IEEE Commun. Mag., vol. 44, pp. 134-141, 2006.
[19] H. Liu, B. Zhang, H. T. Mouftah, X. Shen, and J. Ma, 'Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions,' IEEE Commun. Mag., vol. 47, pp. 103-109, 2009.
[20] H. Wu, G. Wang, and X. Lin, 'On the effectiveness of opportunistic routing over wireless mesh networks,' in Int. Conf. Wireless Commun. Netw. Mobile Comput., Sep. 2010, pp. 1-4.
[21] O. R. Helgason and K. V. Jonsson, 'Opportunistic networking in OMNeT++,' presented at Proc. Int. Conf. Simulation Tools Tech. Commun., Net. and Sys., Marseille, France, 2008.
[22] M. Naghshvar and T. Javidi, 'Opportunistic routing with congestion diversity and tunable overhead,' in IEEE Int. Symposium on Commun., Control and Signal Process., Mar. 2010, pp. 1-6.
[23] M. Naghshvar and T. Javidi, 'Opportunistic routing with congestion diversity in wireless multi-hop networks,' in Proc. IEEE INFOCOM, Mar. 2010, pp. 1-5.
[24] M. J. Neely and R. Urgaonkar, 'Optimal backpressure routing for wireless networks with multi-receiver diversity,' ACM Ad Hoc Netw., vol. 7, pp. 862-881, Jul. 2009.
[25] Y. Li, W. Chen, and Z.-L. Zhang, 'Optimal forwarder list selection in opportunistic routing,' in IEEE Int. Conf. Mobile Adhoc and Sensor Systems, 2009, pp. 670-675.
[26] E. Rozner, J. Seshadri, Y. Mehta, and Q. Lili, 'Simple opportunistic routing protocol for wireless mesh networks,' in IEEE Workshop Wireless Mesh Netw., Sep. 2006, pp. 48-54.
[27] A. A. Bhorkar, B. D. Rao, M. Naghshvar, and T. Javidi, 'An adaptive opportunistic routing scheme for wireless ad-hoc networks,' in IEEE Int. Symp. Inf. Theory, Jun.-Jul. 2009, pp. 2838-2842.
[28] R. C. Shah, S. Wietholter, A. Wolisz, and J. M. Rabaey, 'When does opportunistic routing make sense?' in IEEE Int. Conf. Pervasive Comput. Commun. Workshops, 2005, pp. 350-356.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/46798-
dc.description.abstract多跳躍無線網狀網路的架構設計提供普及的無線存取服務。近年來如何有效傳輸多跳躍網狀網路之頻寬資源,以及利用臨機路由來增進網路效能,已受到諸多的關注。在多跳躍無線網狀網路中,傳輸穩定性與封包遺失交互影響並決定網狀網路之傳輸量。目前已有文獻指出同時解決傳輸穩定性與封包遺失問題,可以使網狀網路達到較高傳輸量的效能。雖然已經有非常多學術論文致力於解決網狀網路中之傳輸穩定性與封包遺失問題,但其中大多數都忽略了網路中重複傳送之成本,亦或假設使用傳送資料表(forwarding list)來傳輸資料。在本篇論文中,我們將討論以最小花費回饋上游目前評估之傳輸成本的方法,以及提出利用回饋訊號的傳輸策略以避免封包重複傳送和封包遺失。接著,我們會結合上述的兩個機制,提出一個新的合作臨機路由。藉由OMNet++進行模擬驗證。zh_TW
dc.description.abstractThe architecture of Multi-hop wireless mesh networks (WMNs) provides widespread wireless access services. In recent years, much attention has been paid to the problem of the efficient transmission in multi-hop mesh networks, and the network performance with opportunistic routing. In multi-hop WMNs, the transmission stability interacted with packet loss ratio determines the transmission throughput. Recent studies have shown that the performance of higher throughput can be achieved while addressing both the transmission stability and packet loss problems. Although there are many papers dedicated to solve those problem, most of them have ignored the repeated transmission cost, or assumed that the forwarding list is used to transmit data. In this dissertation, we first discuss the methods to assess the minimum transmission cost of the current networks. Then, we propose a strategy which requires acknowledge signal to avoid duplicated transmission and packet loss. Moreover, we combine the above two mechanisms and propose a new cooperative opportunistic routing mechanism. Our experimental results are simulated and verified on OMNet++.en
dc.description.provenanceMade available in DSpace on 2021-06-15T05:41:35Z (GMT). No. of bitstreams: 1
ntu-100-R98921030-1.pdf: 2416147 bytes, checksum: 8b7a5cb11865f86d28b8e52d444327f4 (MD5)
Previous issue date: 2011
en
dc.description.tableofcontents口試委員會審定書 #
誌謝 i
中文摘要 ii
ABSTRACT iii
CONTENTS iv
LIST OF FIGURES vi
LIST OF TABLES vii
Chapter 1 Introduction 1
1.1 Background 2
1.2 Contribution 7
Chapter 2 Related Works 8
2.1 Traditional Routing 8
2.2 Earlier Opportunistic Routing 8
2.3 Related Works 9
2.3.1 ExOR 9
2.3.2 GeRaf 11
2.3.3 MORE 12
2.4 Summary 13
Chapter 3 Problem Assumptions and Model 15
3.1 Problem Assumption 15
3.2 Problem Model 16
3.2.1 Network Model 16
3.2.2 Calculating Expected Cost 17
3.2.3 Selecting Candidate Nodes 19
Chapter 4 Propose Method 21
Chapter 5 Simulation Results 24
5.1 Network Description 24
5.2 Performance Evaluations 25
Chapter 6 Conclusion 31
REFERENCE 32
dc.language.isoen
dc.subject無線路由zh_TW
dc.subject無線網狀網路zh_TW
dc.subject臨機路由zh_TW
dc.subject傳送資料表zh_TW
dc.subjectWireless mesh networken
dc.subjectwireless routingen
dc.subjectforwarding listen
dc.subjectopportunistic routingen
dc.title利用合作臨機路由增進多跳躍無線網狀網路之效能zh_TW
dc.titleOn Throughput Efficiency of Cooperative Opportunistic Routing in Multi-hop Wireless Mesh Networksen
dc.typeThesis
dc.date.schoolyear99-2
dc.description.degree碩士
dc.contributor.oralexamcommittee雷欽隆,陳俊良,陳英一,呂學坤
dc.subject.keyword無線網狀網路,臨機路由,傳送資料表,無線路由,zh_TW
dc.subject.keywordWireless mesh network,opportunistic routing,forwarding list,wireless routing,en
dc.relation.page35
dc.rights.note有償授權
dc.date.accepted2011-08-19
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電機工程學研究所zh_TW
顯示於系所單位:電機工程學系

文件中的檔案:
檔案 大小格式 
ntu-100-1.pdf
  未授權公開取用
2.36 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved