The University of Southampton
University of Southampton Institutional Repository

Collaborative data dissemination in opportunistic vehicular networks

Collaborative data dissemination in opportunistic vehicular networks
Collaborative data dissemination in opportunistic vehicular networks
Future opportunistic vehicular networks offers viable means for collaborative data dissemination by high-capacity device-to-device communication. This is a highly challenging problem because a) mobile data items are heterogeneous in size and lifetime; b) mobile users have different interests to different data; and c) dissemination participants have limited storages. We study collaborative data dissemination under these realistic opportunistic vehicular network conditions and formulate the optimal data dissemination as a submodular function maximisation problem with multiple linear storage constraints. We then propose a heuristic algorithm to solve this challenging problem, and provide its theoretical performance bound. The effectiveness of our approach is demonstrated through simulation using real vehicular traces.
Li, Yong
0817e950-114f-47f3-aefe-74bf9ec0e2a3
Wang, Zhaocheng
70339538-3970-4094-bcfc-1b5111dfd8b4
Jin, Depeng
d5ef5d7e-82a7-4950-85cf-800fe7794cc5
Zeng, Lieguang
7c5984b7-b38d-44a1-a1f5-66f2b87e6ff9
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Li, Yong
0817e950-114f-47f3-aefe-74bf9ec0e2a3
Wang, Zhaocheng
70339538-3970-4094-bcfc-1b5111dfd8b4
Jin, Depeng
d5ef5d7e-82a7-4950-85cf-800fe7794cc5
Zeng, Lieguang
7c5984b7-b38d-44a1-a1f5-66f2b87e6ff9
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80

Li, Yong, Wang, Zhaocheng, Jin, Depeng, Zeng, Lieguang and Chen, Sheng (2012) Collaborative data dissemination in opportunistic vehicular networks. 31st Progress In Electromagnetics Research Symposium (PIERS 2012), Malaysia. 5 pp .

Record type: Conference or Workshop Item (Paper)

Abstract

Future opportunistic vehicular networks offers viable means for collaborative data dissemination by high-capacity device-to-device communication. This is a highly challenging problem because a) mobile data items are heterogeneous in size and lifetime; b) mobile users have different interests to different data; and c) dissemination participants have limited storages. We study collaborative data dissemination under these realistic opportunistic vehicular network conditions and formulate the optimal data dissemination as a submodular function maximisation problem with multiple linear storage constraints. We then propose a heuristic algorithm to solve this challenging problem, and provide its theoretical performance bound. The effectiveness of our approach is demonstrated through simulation using real vehicular traces.

Text
M-piers2012.pdf - Version of Record
Download (271kB)
Text
P-piers2012.pdf - Other
Download (767kB)

More information

e-pub ahead of print date: 9 March 2012
Venue - Dates: 31st Progress In Electromagnetics Research Symposium (PIERS 2012), Malaysia, 2012-03-09
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 335084
URI: http://eprints.soton.ac.uk/id/eprint/335084
PURE UUID: fb7d2929-5a68-43e9-b15b-48487b5916dc

Catalogue record

Date deposited: 13 Mar 2012 10:24
Last modified: 19 Jul 2019 22:05

Export record

Contributors

Author: Yong Li
Author: Zhaocheng Wang
Author: Depeng Jin
Author: Lieguang Zeng
Author: Sheng Chen

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×