請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43700完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 廖婉君(Wanjiun Liao) | |
| dc.contributor.author | Yi-Chin Li | en |
| dc.contributor.author | 李怡進 | zh_TW |
| dc.date.accessioned | 2021-06-15T02:26:19Z | - |
| dc.date.available | 2009-08-20 | |
| dc.date.copyright | 2009-08-20 | |
| dc.date.issued | 2009 | |
| dc.date.submitted | 2009-08-17 | |
| dc.identifier.citation | [1]. S. Jain, K. Fall and R. Patra, “Routing in a Delay Tolerant Network,” ACM
SIGCOMM’04 [2]. J. Burgess, B. Gallagher, D. Jensen and B. N. Levine, “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,” IEEE INFOCOM 2006. [3]. A. Balasubramanian, B. N. Levine and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” ACM SIGCOMM’07 [4]. X. Li, W. Shu, M. Li, H. Huang and M. Wu, “DTN Routing in Vehicular Sensor Networks,” IEEE GLOBECOM’08 [5]. S. Li, R. W. Yeung and N. Cai, “Linear Network Coding,” IEEE transactions on information theory, 2003 [6]. J. Byers, M. Luby, M. Mitzenmacher and A. Rege,” A Digital Fountain Approach to Reliable Distribution of Bulk Data,” ACM SIGSOMM, 1998 [7]. P. Maymounkov and D. Mazires,” Rateless Codes and Big Downloads,” in IPTPS’03, 2003 [8]. C. Gkantsidis and P. R. Rodriguez,” Network Coding for Large Scale Content Distribution,” IEEE INFOCOM 2005 [9]. W. Mitchener and A. Vadhaat,” Epidemic Routing for Partially Connected Ad Hoc 48 Networks,” Technical Report CS-2000-06, Duke Univ., 2000 [10]. T. Spyropoulos, K. Psounis and C. S. Raghavendra,” Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” ACM WDTN, 2005 [11]. Y. Lin, B. Li and B. Liang,” Efficient Network Coded Data Transmissions in Disruption Tolerant Networks,” IEEE INFOCOM 2008 [12]. E. Jones, L. Li and P. Ward,” Practical Routing in Delay-Tolerant Networks,” ACM Chants Workshop, 2005 [13]. TIER Project, UC Berkeley. http://tier.cs.berkeley.edu/ [14]. A. Pentland, R. Fletcher and A. Hasson,” DakNet: Rethinking Connectivity in Developing Nations,” IEEE Computer, 2004 [15]. Wizzy Project. http://www.wizzy.org.za/ [16]. S. Surana, R. Pata, S. Nedevschi and E. Brewer,” Deploying a rural Wireless Telemedicine System: Experiences in Sustainability,” IEEE Computer, 2008 [17]. A. Lindgren, A. Doria and O. Schelen,” Probabilistic Routing in Intermittently Connected Networks,” ACM MOBICOM, 2003 [18]. J. Harri, F. Filali, C. Bonnet and Marco Fiore, “Vanetmobisim: Generating Realistic Mobility Patterns for VANETs,” ACM VANET 2006 | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43700 | - |
| dc.description.abstract | 車載網路是近年非常熱門的研究領域之一，他可算是延遲容忍網路的計畫之一。以往從起點到終點傳輸資料的方法不能直接套用在車載網路乃因為以往的方法在傳輸資料前須建立一條完整的路徑。更甚，頻寬和儲存空間是有限的，如何在車載網路下有效的利用資源亦是非常重要的問題。本文中，我們提出了以網路編碼為根基的排程協定，當傳輸機會發生時排程訊息傳輸，且當緩衝空間溢出時排程訊息以丟棄。我們提出利用網路編碼的資料在車載網路下作傳輸，使得資料傳輸更加的可靠。最後從模擬結果我們可以看出，比較起其他的協定，我們提出的方法有較高的資料傳送率和較低的傳送延遲時間。 | zh_TW |
| dc.description.abstract | Vehicular network is one of the popular research areas in recent years; it's a project of Delay tolerant network (DTN). Traditional approaches that forwarding data
from source to destination fails to apply in vehicular networks because they try to establish a complete route before forwarding data. Moreover, bandwidth and storage at each node are limited, how to utilize resources in vehicular networks is also an important issue. In this thesis, we proposed CSP, which schedules messages to transmit when contact opportunity occur; and also schedules messages to drop when buffer overflow. We proposed using network coded data transmission in vehicular networks, making data transmit more reliable. From simulation we could see that we have higher delivery rate and lower delivery delay compared to other protocols. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-15T02:26:19Z (GMT). No. of bitstreams: 1 ntu-98-R96921059-1.pdf: 758444 bytes, checksum: d2743fa1547edffbaed7b7503706fa45 (MD5) Previous issue date: 2009 | en |
| dc.description.tableofcontents | 致謝................................................................................................................................ i
摘要............................................................................................................................... ii Abstract ........................................................................................................................ iii Contents ........................................................................................................................ iv List of Figures ............................................................................................................... vi 1. Introduction ................................................................................................................ 1 1.1 Vehicular Network in Developing Nations .......................................................... 2 1.2 Linear Network Coding ........................................................................................ 2 2. Motivation .................................................................................................................. 6 3. Related Work ............................................................................................................. 9 4. Coding-Based Scheduling Protocol ......................................................................... 13 4.1 System model ..................................................................................................... 13 4.2 Beacon ................................................................................................................ 14 4.3 Pair Selection ...................................................................................................... 16 4.4 Message Selection .............................................................................................. 18 4.5 Coding Operation ............................................................................................... 19 v 4.6 Decoding Operation ........................................................................................... 21 4.7 ACK ................................................................................................................... 22 4.8 Finite Storage ..................................................................................................... 23 4.9 Algorithm ........................................................................................................... 26 5. Performance Evaluation ........................................................................................... 28 5.1 simulation setup .................................................................................................. 28 5.2 Simulation Result ............................................................................................... 33 6. Conclusion and Future Work ................................................................................... 39 Reference ..................................................................................................................... 40 | |
| dc.language.iso | en | |
| dc.subject | 排程 | zh_TW |
| dc.subject | 車載網路 | zh_TW |
| dc.subject | 網路編碼 | zh_TW |
| dc.subject | vehicular networks | en |
| dc.subject | scheduling | en |
| dc.subject | network coding | en |
| dc.title | 利用網路編碼於車載網路 | zh_TW |
| dc.title | Exploiting Network Coding for Vehicular Networks | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 97-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 張正尚(Chang, Cheng-Shang),蔡子傑(Tzu-Chieh Tsai),林宗男(Tsungnan Lin) | |
| dc.subject.keyword | 車載網路,排程,網路編碼, | zh_TW |
| dc.subject.keyword | vehicular networks,scheduling,network coding, | en |
| dc.relation.page | 41 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2009-08-18 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位： | 電機工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-98-1.pdf 未授權公開取用 | 740.67 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。