Show simple item record

dc.contributor.authorXeros, Andreasen
dc.contributor.authorLestas, Mariosen
dc.contributor.authorAndreou, Maria I.en
dc.contributor.authorPitsillides, Andreasen
dc.creatorXeros, Andreasen
dc.creatorLestas, Mariosen
dc.creatorAndreou, Maria I.en
dc.creatorPitsillides, Andreasen
dc.date.accessioned2019-11-13T10:43:00Z
dc.date.available2019-11-13T10:43:00Z
dc.date.issued2010
dc.identifier.isbn978-1-4244-9525-2
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/55153
dc.description.abstractInformation Hovering 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. To alleviate this problem in this work we propose a scheme which is based on the application of epidemic routing within the hovering area and probabilistic flooding outside the hovering area. Informed vehicles outside the area can serve as information bridges towards partitioned uninformed areas thus leading to high reachability. A unique feature of the proposed protocol is that it is adaptive in the sense that the rebroadcast probability outside the hovering area is adaptively regulated based on estimates of the vehicle density within the hovering area. We evaluate the performance of the proposed scheme using VISSIM. The reference model used in all simulation experiments represents a section of the road network in the cities of Bellevue and Redmond in Washington. The obtained simulation results indicate that the proposed protocol is successful in satisfying its design objectives and that it outperforms other candidate hovering protocols. © 2010 IEEE.en
dc.source2010 IEEE Vehicular Networking Conference, VNC 2010en
dc.source2010 IEEE Vehicular Networking Conference, VNC 2010en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-79951804680&doi=10.1109%2fVNC.2010.5698250&partnerID=40&md5=e0a7e0b0fbfbcd8e1c8f93b37671f972
dc.subjectComputer simulationen
dc.subjectAd hoc networksen
dc.subjectMobile ad hoc networksen
dc.subjectVehiclesen
dc.subjectReachabilityen
dc.subjectSpecific timeen
dc.subjectUnique featuresen
dc.subjectMotor transportationen
dc.subjectRoad networken
dc.subjectSimulation resulten
dc.subjectDesign objectivesen
dc.subjectProbabilistic floodingen
dc.subjectTraffic densitiesen
dc.subjectVehicular ad hoc networksen
dc.subjectGeographical areaen
dc.subjectEpidemic routingen
dc.subjectInformation needen
dc.subjectLow marketsen
dc.subjectReference modelsen
dc.subjectSimulation experimentsen
dc.subjectVehicle densityen
dc.subjectWashingtonen
dc.titleAdaptive probabilistic flooding for Information Hovering in VANETsen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.identifier.doi10.1109/VNC.2010.5698250
dc.description.startingpage239
dc.description.endingpage246
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Conference code: 83890en
dc.description.notesCited By :12</p>en
dc.contributor.orcidPitsillides, Andreas [0000-0001-5072-2851]
dc.contributor.orcidXeros, Andreas [0000-0002-6616-5954]
dc.gnosis.orcid0000-0001-5072-2851
dc.gnosis.orcid0000-0002-6616-5954


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record