English  |  正體中文  |  简体中文  |  Items with full text/Total items : 16335/24215 (67%)
Visitors : 11535719      Online Users : 322
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://ir.nknu.edu.tw/ir/handle/987654321/17549

    題名: 一個提升車載網路上網速度的K-Hop資料轉送機制
    K-Hop Data Forwarding to Speed-Up Internet Access in Vehicular Networks
    Authors: 邱柏昇
    貢獻者: 曾秀松
    Show-Shiow Tzeng
    Keywords: K-Hop;地理機會路由;車載網路
    K-Hop;Geographical Opportunistic Routing;Vehicular Networks
    Date: 2012-07-19
    Issue Date: 2012-11-27 16:30:18 (UTC+8)
    Abstract: 車載網路是無線網路的一種,它的組成包含了兩個群組,第一個群組為裝載了無線通訊裝置(例如:WiFi)的車子們,車子之間可以透過無線通訊裝置互相溝通,第二個群組為可連接網際網路的資訊站,資訊站通常設置在路邊,提供車輛以低成本就能與網際網路連線。由於無線通訊裝置的傳輸範圍是有限的,但車輛與資訊站的距離卻有可能十分遙遠,所以一輛車輛想要傳送封包給資訊站時,中間有可能必須經過一輛或多輛車輛來幫忙轉發封包,在這種情況下,要將封包送達目的資訊站,有可能會造成過多的時間延遲以及掉包的現象,我們需要盡可能的縮短傳輸時間以及封包的遺失率,提供使用者更好的服務。

    Vehicular networks, which consist of (i) vehicles equipped with communication devices e.g. WiFi interface and (ii) infostations which are access points connecting Internet and usually are placed around the road side, provide vehicles with Internet services in a cheap and scalable manner. Due to the short transmission range of WiFi and possible long distance between a vehicle and an infostation, a vehicle sending a message to an infostation may require one or more vehicles to forward the message. It is critical to route the message such that the total time to arrive the destined infostation is short with low message loss.

    In previous geographical opportunistic routing, within the transmission range of a vehicle currently carrying a message, the vehicle attempts to find an eligible vehicle through which the message is delivered to the destination in a shorter time. If there is no eligible next vehicle, the vehicle continues carrying the message; however, due to privacy, lack of navigation equipment installation or sparse density of vehicles, a vehicle may not frequently find an eligible vehicle within one hop range to forward the message. In this paper, we propose a k-hop search to find an eligible vehicle, which core idea is to enlarge the search range. The difficulty of the k-hop search is that the intermediate hop must be selected carefully; otherwise, the message will be incorrectly forward to a wrong vehicle which prolongs delivery time and increases message loss. Simulation results show that the proposed k-hop search produces significantly lower packet delay than the one-hop search.
    Appears in Collections:[光電與通訊工程學系] 博碩士論文
    [光通系] 曾秀松

    Files in This Item:

    File SizeFormat

    All items in NKNUIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback