English  |  正體中文  |  简体中文  |  Items with full text/Total items : 16335/24215 (67%)
Visitors : 11477573      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
    高師機構典藏 NKNUIR > 理學院 > 數學系 > 會議論文 >  Item 987654321/23845
    Please use this identifier to cite or link to this item: http://ir.nknu.edu.tw/ir/handle/987654321/23845

    題名: K-Hop Search Based Geographical Opportunistic Routing for Query Messages in Vehicular N etworks
    Authors: 林盈甄;曾秀松;王釋毅
    Ying-Jen Lin;Bo-Sheng Chiou;Yu-Ching Hsu;Shyh-Yih Wang;Show-Shiow Tzeng;Jian-Yu Huang
    Keywords: Delays;IEEE 802.11 Standards;Navigation;Next generation networking;Routing;Simulation;Vehicles
    Date: 2013-02-25
    Issue Date: 2015-05-07 15:46:00 (UTC+8)
    Abstract: Vehicular networks provide Internet services for vehicles equipped with communication devices such as 802.11 based interface in a cheap and scalable manner. Due to the short transmission range of 802.11 and possible long distance between a vehicle and a destination, a vehicle sending a query message to a destination 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 destination is short with low message loss; to achieve this goal, previous geographical opportunistic routing provides a way that 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 a destination in a shorter time. If there is no eligible vehicle, the vehicle continues carrying 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 such that a vehicle with shorter delivery time is possibly found. Extensive simulations are conducted to study the performance, in terms of packet delay, of the k-hop search. Simulation results show that the proposed k-hop search produces significantly lower packet delay than the one-hop search.
    關聯: IEEE 2nd International Symposium on Next-Generation Electronics (ISNE]), 25-26 Feb. 2013, P.279-282, DOI: 10.1109/ISNE.2013.6512341
    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