TY - GEN
T1 - Information hovering in vehicular ad-hoc networks
AU - Xeros, Andreas
AU - Lestas, Marios
AU - Andreou, Maria
AU - Pitsillides, Andreas
AU - Ioannou, Petros
PY - 2009
Y1 - 2009
N2 - Information Hovering is a relatively new concept of information dissemination over a mobile set of peers. It naturally applies in many applications in Vehicular Ad-Hoc Networks, where useful information needs to be made available to all vehicles within a confined geographical area for a specific time interval. A straightforward approach, is to have all vehicles within the hovering area exchange messages with each other. However, this method does not guarantee that all vehicles within the hovering area will receive the message due to potential partitioning of the network in areas with low traffic density and/or low market penetration rate. In this work, we address the problem by applying probabilistic flooding schemes outside the hovering area. Informed vehicles outside the hovering area can serve as information bridges towards partitioned uninformed areas thus leading to high reachability.We consider a number of rebroadcast probability functions and we evaluate their performance using the microscopic simulation tool VISSIM. Our reference model represents a section of the road network in the cities of Bellevue and Redmond in Washington. The obtained results indicate that probabilistic flooding with a Gaussian like probability function outperforms other approaches by achieving high reachability values and a relatively small number of exchanged messages.
AB - Information Hovering is a relatively new concept of information dissemination over a mobile set of peers. It naturally applies in many applications in Vehicular Ad-Hoc Networks, where useful information needs to be made available to all vehicles within a confined geographical area for a specific time interval. A straightforward approach, is to have all vehicles within the hovering area exchange messages with each other. However, this method does not guarantee that all vehicles within the hovering area will receive the message due to potential partitioning of the network in areas with low traffic density and/or low market penetration rate. In this work, we address the problem by applying probabilistic flooding schemes outside the hovering area. Informed vehicles outside the hovering area can serve as information bridges towards partitioned uninformed areas thus leading to high reachability.We consider a number of rebroadcast probability functions and we evaluate their performance using the microscopic simulation tool VISSIM. Our reference model represents a section of the road network in the cities of Bellevue and Redmond in Washington. The obtained results indicate that probabilistic flooding with a Gaussian like probability function outperforms other approaches by achieving high reachability values and a relatively small number of exchanged messages.
UR - http://www.scopus.com/inward/record.url?scp=77951193840&partnerID=8YFLogxK
U2 - 10.1109/GLOCOMW.2009.5360695
DO - 10.1109/GLOCOMW.2009.5360695
M3 - Conference contribution
AN - SCOPUS:77951193840
SN - 9781424456260
T3 - 2009 IEEE Globecom Workshops, Gc Workshops 2009
BT - 2009 IEEE Globecom Workshops, Gc Workshops 2009
T2 - 2009 IEEE Globecom Workshops, Gc Workshops 2009
Y2 - 30 November 2009 through 4 December 2009
ER -