2006 IEEE International Conference on Communications 2006
DOI: 10.1109/icc.2006.254764
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Fully Ad-Hoc Multi-Hop Broadcast Protocol for Inter-Vehicular Communication Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0
2

Year Published

2010
2010
2019
2019

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 75 publications
(46 citation statements)
references
References 9 publications
0
44
0
2
Order By: Relevance
“…In the MANET and VANET literature, previous proposed methods that avoid broadcast storm problem include hop-based, location-based, cluster-based, probabilistic-based, and trafficbased suppression schemes such as [11] and [12]. Our method to improve broadcast reliability integrates the vehicular communication system with traffic flow by dynamically adjusting transmission range based on traffic density and vehicle speed characteristics.…”
Section: Related Workmentioning
confidence: 99%
“…In the MANET and VANET literature, previous proposed methods that avoid broadcast storm problem include hop-based, location-based, cluster-based, probabilistic-based, and trafficbased suppression schemes such as [11] and [12]. Our method to improve broadcast reliability integrates the vehicular communication system with traffic flow by dynamically adjusting transmission range based on traffic density and vehicle speed characteristics.…”
Section: Related Workmentioning
confidence: 99%
“…It updates M 1 = 1 at each node when passing through. The propagation will stop at the "end node" u of the segment which is closer to the intersection and have a better coverage to receive signals from both street and avenue [16]. To avoid the use of redundant information, any propagation will stop when it encounters another propagation ahead.…”
Section: According To Different Types Of Zones Our Information M Is mentioning
confidence: 99%
“…It updates M q = 1 at each node. It stops at an "end node" [16], which can receive signals from both the street and avenue, but not necessarily every end node.…”
Section: Label Information and Its Usementioning
confidence: 99%
“…Working of AMB Protocol: In this protocol, directional broadcast mechanism is employed of UMB protocol but different intersection broadcast mechanism from that of UMB protocol is proposed where vehicles find the best candidate among themselves to propagate the packets to other road segments. The vehicle closest to the intersection is a good candidate for this function since it is assumed that vehicles closer to the intersections have a better coverage of other road segments [12]. This intersection broadcast mechanism is composed of two phases: i) Selecting the HUNTER vehicle: The Hunter vehicle tries to select the closest vehicle to the intersection.…”
Section: 2ad-hoc Multihop Broadcast Protocolmentioning
confidence: 99%
“…In the AMB protocol, directional broadcast is same as that of UMB protocol but in case of Intersection broadcast-vehicles attempt to choose the closest vehicle to the intersection using a fully adhoc algorithm and the chosen vehicle forwards the packet to all road segments except the road segment the packet is received from [12]. Working of AMB Protocol: In this protocol, directional broadcast mechanism is employed of UMB protocol but different intersection broadcast mechanism from that of UMB protocol is proposed where vehicles find the best candidate among themselves to propagate the packets to other road segments.…”
Section: 2ad-hoc Multihop Broadcast Protocolmentioning
confidence: 99%