BAHG: Back-bone-assisted hop greedy routing for VANET's city environments

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/106380

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106380

Title:	BAHG: Back-bone-assisted hop greedy routing for VANET's city environments
Authors:	吳曉光;Sahu, P. K.;Wu, E. H.;Sahoo, J.;Gerla, M.
Contributors:	資訊電機學院資訊工程學系
Keywords:	Bones;Cities and towns;Destination discovery;greedy routing;Roads;Routing;Routing protocols;Studies;unicast routing;Vehicles;vehicular ad hoc network (VANET)
Date:	2013-01-01
Issue Date:	2026-04-23 13:19:13 (UTC+8)
Publisher:	Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
Abstract:	摘要： Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc. Multihop information dissemination in VANETs is constrained by the high mobility of vehicles and the frequent disconnections. Currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. To obtain destination position, some protocols use flooding, which can be detrimental in city environments. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay. 其他題名： TITS 出版者： New York: IEEE 出版日期： 2013-03-01 出處： IEEE transactions on intelligent transportation systems, 2013-03, Vol.14 (1), p.199-213 資源來源： IEEE Electronic Library (IEL) 版權： Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2013 識別號： ISSN: 1524-9050 識別號： EISSN: 1558-0016 識別號： DOI: 10.1109/TITS.2012.2212189 識別號： CODEN: ITISFG
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	14	View/Open

社群 sharing

Loading...