The potential of infrastructureless vehicular ad hoc networks (VANETs) for providing multihop applications is quite significant. Although the Epidemic Routing protocol performs well in highly mobile and frequently disconnected VANETs with low vehicle densities or light packet traffic loads, its performance degrades greatly in environments of high vehicle density together with heavy packet traffic loads that create serious bandwidth contention and frequent collisions. We propose a new epidemic routing protocol in urban environments called Greedy Zone Epidemic Routing (GZER), in which the neighbors of a vehicle are divided into different zones according to their physical locations. Each vehicle maintains a summary vector (SV) of packets buffered locally and zone summary vectors (ZSVs) of all packets buffered in each zone. Whether the infection will be transmitted in each zone is decided by the difference between SV and ZSV. Simulation results show that the proposed GZER protocol outperforms the existing solutions significantly, especially in the environments of high vehicle densities together with heavy packet traffic loads.
Guangchun LUO
University of Electronic Science and Technology of China
Haifeng SUN
Southwest University of Science and Technology
Ke QIN
University of Electronic Science and Technology of China
Junbao ZHANG
Zhongyuan University of Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Guangchun LUO, Haifeng SUN, Ke QIN, Junbao ZHANG, "Greedy Zone Epidemic Routing in Urban VANETs" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 1, pp. 219-230, January 2015, doi: 10.1587/transcom.E98.B.219.
Abstract: The potential of infrastructureless vehicular ad hoc networks (VANETs) for providing multihop applications is quite significant. Although the Epidemic Routing protocol performs well in highly mobile and frequently disconnected VANETs with low vehicle densities or light packet traffic loads, its performance degrades greatly in environments of high vehicle density together with heavy packet traffic loads that create serious bandwidth contention and frequent collisions. We propose a new epidemic routing protocol in urban environments called Greedy Zone Epidemic Routing (GZER), in which the neighbors of a vehicle are divided into different zones according to their physical locations. Each vehicle maintains a summary vector (SV) of packets buffered locally and zone summary vectors (ZSVs) of all packets buffered in each zone. Whether the infection will be transmitted in each zone is decided by the difference between SV and ZSV. Simulation results show that the proposed GZER protocol outperforms the existing solutions significantly, especially in the environments of high vehicle densities together with heavy packet traffic loads.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.219/_p
Copy
@ARTICLE{e98-b_1_219,
author={Guangchun LUO, Haifeng SUN, Ke QIN, Junbao ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Greedy Zone Epidemic Routing in Urban VANETs},
year={2015},
volume={E98-B},
number={1},
pages={219-230},
abstract={The potential of infrastructureless vehicular ad hoc networks (VANETs) for providing multihop applications is quite significant. Although the Epidemic Routing protocol performs well in highly mobile and frequently disconnected VANETs with low vehicle densities or light packet traffic loads, its performance degrades greatly in environments of high vehicle density together with heavy packet traffic loads that create serious bandwidth contention and frequent collisions. We propose a new epidemic routing protocol in urban environments called Greedy Zone Epidemic Routing (GZER), in which the neighbors of a vehicle are divided into different zones according to their physical locations. Each vehicle maintains a summary vector (SV) of packets buffered locally and zone summary vectors (ZSVs) of all packets buffered in each zone. Whether the infection will be transmitted in each zone is decided by the difference between SV and ZSV. Simulation results show that the proposed GZER protocol outperforms the existing solutions significantly, especially in the environments of high vehicle densities together with heavy packet traffic loads.},
keywords={},
doi={10.1587/transcom.E98.B.219},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Greedy Zone Epidemic Routing in Urban VANETs
T2 - IEICE TRANSACTIONS on Communications
SP - 219
EP - 230
AU - Guangchun LUO
AU - Haifeng SUN
AU - Ke QIN
AU - Junbao ZHANG
PY - 2015
DO - 10.1587/transcom.E98.B.219
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2015
AB - The potential of infrastructureless vehicular ad hoc networks (VANETs) for providing multihop applications is quite significant. Although the Epidemic Routing protocol performs well in highly mobile and frequently disconnected VANETs with low vehicle densities or light packet traffic loads, its performance degrades greatly in environments of high vehicle density together with heavy packet traffic loads that create serious bandwidth contention and frequent collisions. We propose a new epidemic routing protocol in urban environments called Greedy Zone Epidemic Routing (GZER), in which the neighbors of a vehicle are divided into different zones according to their physical locations. Each vehicle maintains a summary vector (SV) of packets buffered locally and zone summary vectors (ZSVs) of all packets buffered in each zone. Whether the infection will be transmitted in each zone is decided by the difference between SV and ZSV. Simulation results show that the proposed GZER protocol outperforms the existing solutions significantly, especially in the environments of high vehicle densities together with heavy packet traffic loads.
ER -