Adaptive probabilistic flooding for Information Hovering in VANETs

Xeros, Andreas; Lestas, Marios; Andreou, Maria I.; Pitsillides, Andreas

doi:10.1109/vnc.2010.5698250

Cited by 20 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A significant part of the overall design procedure is the determination of the probability function f . After careful evaluation of a number of candidate functions in [11] and [12], a Gaussian like function was chosen of the form:…”

Section: Proposed Traffic Adaptive Information Hovering Protocolmentioning

confidence: 99%

“…Higher vehicle density values, imply greater probability of high connectivity and so a lower value of σ suffices to guarantee high reachability and low number of exchanged messages. The exact function, mapping the vehicle density to the desired value of σ was determined in [11] using simulations and the main features of the design procedure are also presented here. The reference model used in all simulation experiments, represents a section of the road network in the cities of Bellevue and Redmond in Washington and is shown in Fig.…”

Section: Proposed Traffic Adaptive Information Hovering Protocolmentioning

confidence: 99%

“…The challenge is then to find a way to estimate the vehicle density online. In [11] we present such an estimation method which is based on measurements of the average number of neighbors. The latter quantity is obtained via a beaconing mechanism.…”

Section: Proposed Traffic Adaptive Information Hovering Protocolmentioning

confidence: 99%

“…In our work in [11], [12] we adopt an alternative approach which involves employing epidemic routing inside the area and probabilistic flooding outside the hovering area. Employing probabilistic flooding outside the hovering and by carefully designing the probabilistic function one can significantly reduce the number of exchanged messages and at the same time maintain high reachability values.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Adaptive information hovering in VANETs: Robustness and enhancements

Xeros

Constantinides

Lestas

et al. 2013

2013 International Conference on Connected Vehicles and Expo (ICCVE)

Self Cite

View full text Add to dashboard Cite

Information hovering is relevant in vehicular ad hoc networks in cases where critical information needs to be made available to all vehicles in a bounded geographical area, called the hovering area, for a specific amount of time. In cases of low traffic density within the hovering area, a number of vehicles may not receive the critical information due to partitioning of the vehicular network. In previous work we proposed an information hovering scheme which increases the achieved reachability, by employing probabilistic flooding outside the hovering area. Informed vehicles outside the hovering area offer alternative paths towards the uninformed vehicles thus increasing reachability. In this work we investigate the robustness of the proposed protocol with respect to changing hovering area, transmission range of the vehicles and the message loss probability. We verify that the protocol continues to work effectively in all scenarios outperforming other approaches which have been proposed in literature. In addition, we investigate enhancements to the proposed protocol which ensure improved performance in cases of high traffic density within the hovering area. We apply probabilistic flooding within the hovering area and we observe that retransmission probabilities less than one suffice to lead to high reachability values.

show abstract

Section: Proposed Traffic Adaptive Information Hovering Protocolmentioning

confidence: 99%

Section: Proposed Traffic Adaptive Information Hovering Protocolmentioning

confidence: 99%

Section: Proposed Traffic Adaptive Information Hovering Protocolmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Adaptive information hovering in VANETs: Robustness and enhancements

Xeros

Constantinides

Lestas

et al. 2013

2013 International Conference on Connected Vehicles and Expo (ICCVE)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Maintaining clusters is an overhead for Little's system. Xeros et al [101] introduced a system for information propagation at intersections. Hafeez et al…”

Section: Information Dissemination Systemsmentioning

confidence: 99%

Friend: A cyber-physical system for traffic flow related information aggregation and dissemination

El-Tawab

Olariu

Almalag

2012

2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)

View full text Add to dashboard Cite

A cyber-physical system for traffic Flow-Related Information aggrEgatioN and Dissemination. By integrating resources and capabilities at the nexus between the cyber and physical worlds, FRIEND will contribute to aggregating traffic flow data collected by the huge fleet of vehicles on our roads into a comprehensive, near real-time synopsis of traffic flow conditions. We anticipate providing drivers with a meaningful, color-coded, at-a-glance view of flow conditions ahead, alerting them to congested traffic.FRIEND can be used to provide accurate information about traffic flow and can be used to propagate this information. The workhorse of FRIEND is the ubiquitous lane delimiters (a.k.a. cat's eyes) on our roadways that, at the moment, are used simply as dumb reflectors.Our main vision is that by endowing cat's eyes with a modest power source, detection and communication capabilities they will play an important role in collecting, aggregating and disseminating traffic flow conditions to the driving public. We envision the cat's eyes system to be supplemented by road-side units (RSU) deployed at regular intervals (e.g. every kilometer or so). The RSUs placed on opposite sides of the roadway constitute a logical unit and are connected by optical fiber under the median. Unlike inductive loop detectors, adjacent RSUs along the roadway are not connected with each other, thus avoiding the huge cost of optical fiber. Each RSU contains a GPS device (for time synchronization), an active Radio Frequency Identification (RFID) tag for communication with passing cars, a radio transceiver for RSU to RSU communication and a laptop-class computing device.The physical components of FRIEND collect traffic flow-related data from passing vehicles. The collected data is used by FRIEND's inference engine to build beliefs about the state of the traffic, to detect traffic trends, and to disseminate relevant traffic flow-related information along the roadway. The second contribution of this thesis is the development of an incident classification and detection algorithm that can be used to classify different types of traffic incident. Then, it can notify the necessary target of the incident. We also compare our incident detection technique with other VANET techniques.Our third contribution is a novel strategy for information dissemination on highways. First, we aim to prevent secondary accidents. Second, we notify drivers far away from the accident of an expected delay that gives them the option to continue or exit before reaching the incident location. A new mechanism tracks the source of the incident while notifying drivers away from the accident. The more time the incident stays, the further the information needs to be propagated. Furthermore, the denser the traffic, the faster it will backup. In high density highways, an incident may form a backup of vehicles faster than low density highways. In order to satisfy this point, we need to propagate information as a function of density and time.iv

show abstract