Geographic validity aware content retention in vehicular networks

dc.contributor.advisorBandara, HMND
dc.contributor.authorPerera, HJ
dc.date.accept2018
dc.date.accessioned2018
dc.date.available2018
dc.date.issued2018
dc.description.abstractIn Vehicle-to-Vehicle (V2V) communication, interest-based content dissemination carries equal importance. For example, a group of vehicles involved in a safari may communicate with each other about the location of rare animals. These messages are useful only within a certain geography and within a certain timespan. Hence, messages injected into the V2V network should be retained within these boundaries regardless of the highly dynamic nature of the underlying V2V network. To ensure that the content is retained within the V2V network both efficiently and with high certainty, it is important to address problems such as how and when to disseminate content, how to maintain order and honor priorities of content, how many replicas to maintain, and when to evict the content. However, if the content message is passed every time a pair of vehicles comes into each other's range, it will lead to message implosion while suboptimally utilizing the wireless links, power, and content storage. Therefore, to ensure that all the vehicles get the message without high certainty and efficiency, it is imperative to identify with what probability a message should be disseminated. In this research, we identify this probability value that could lead to successful retention of the message within the network given the parameters such as the valid geographical boundary, time span, and vehicle arrival rate. We developed a model that estimates the minimum probability that needs to be maintained to ensure that the specific content is seeded among other nodes. The model was developed for straight roads, T-junctions, and four-way intersections by varying other parameters such as the valid geographic area, vehicle speed, and density. Simulation bases analysis shows that the proposed model could reasonably estimate the minimum probability that needs to be met for the message to be replicated in other nodes.
dc.identifier.accnoTH3996en_US
dc.identifier.degreeMSc in Computer Science and Engineeringen_US
dc.identifier.departmentDepartment of Computer Science & Engineeringen_US
dc.identifier.facultyEngineeringen_US
dc.identifier.urihttp://dl.lib.mrt.ac.lk/handle/123/16025
dc.language.isoenen_US
dc.subjectCOMPUTER SCIENCE AND ENGINEERING-Dissertationsen_US
dc.subjectCOMPUTER SCIENCE-Dissertationsen_US
dc.subjectMOBILE AD-HOC NETWORKSen_US
dc.subjectVEHICULAR AD-HOC NETWORKSen_US
dc.subjectVEHICULAR NETWORKSen_US
dc.titleGeographic validity aware content retention in vehicular networksen_US
dc.typeThesis-Full-texten_US

Files

Original bundle

Now showing 1 - 3 of 3
Loading...
Thumbnail Image
Name:
TH3996-1.pdf
Size:
1.74 MB
Format:
Adobe Portable Document Format
Description:
Pre-text
Loading...
Thumbnail Image
Name:
TH3996-2.pdf
Size:
623.96 KB
Format:
Adobe Portable Document Format
Description:
Post-text
Loading...
Thumbnail Image
Name:
TH3996.pdf
Size:
14.84 MB
Format:
Adobe Portable Document Format
Description:
Full-thesis