Cooperative information forwarding in vehicular networks subject to channel randomness

Zhang, Z; Mao, G; Han, T; Anderson, BDO

Cooperative information forwarding in vehicular networks subject to channel randomness

Zhang, Z Mao, G

Han, T Anderson, BDO

Permalink

Publication Type:: Conference Proceeding
Citation:: 2014 IEEE International Conference on Communications, ICC 2014, 2014, pp. 324 - 329
Issue Date:: 2014-01-01

Closed Access

	Filename	Description	Size
	co.pdf	Published version	205.32 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, Z	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Han, T	en_US
dc.contributor.author	Anderson, BDO	en_US
dc.date.issued	2014-01-01	en_US
dc.identifier.citation	2014 IEEE International Conference on Communications, ICC 2014, 2014, pp. 324 - 329	en_US
dc.identifier.isbn	9781479920037	en_US
dc.identifier.uri	http://hdl.handle.net/10453/121608
dc.description.abstract	This paper investigates the information dissemination process in wireless communication networks formed by vehicles. As vehicles are moving constantly, a vehicular ad-hoc network exhibits a highly-dynamic network topology and a fast-changing radio environment. These distinguishing characteristics result in random and unreliable wireless connections between vehicles. Consequently, vehicles need to work cooperatively to disseminate a piece of information to the destination. This paper analyses cooperative information forwarding schemes where each vehicle determines whether or not to forward a received packet in a decentralized manner, without the costly or even impractical demand for the knowledge of network topology. Considering a generic wireless connection model incorporating wireless channel randomness, analytical results are derived for the probability of successful delivery and the expected number of packet forwardings. Moreover, analysis is conducted on the optimal information forwarding scheme that meets a pre-designated probability of successful delivery objective using the minimum number of packet forwardings. © 2014 IEEE.	en_US
dc.relation.ispartof	2014 IEEE International Conference on Communications, ICC 2014	en_US
dc.relation.isbasedon	10.1109/ICC.2014.6883339	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Cooperative information forwarding in vehicular networks subject to channel randomness	en_US
dc.type	Conference Proceeding
utslib.for	080501 Distributed and Grid Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US

Abstract:

This paper investigates the information dissemination process in wireless communication networks formed by vehicles. As vehicles are moving constantly, a vehicular ad-hoc network exhibits a highly-dynamic network topology and a fast-changing radio environment. These distinguishing characteristics result in random and unreliable wireless connections between vehicles. Consequently, vehicles need to work cooperatively to disseminate a piece of information to the destination. This paper analyses cooperative information forwarding schemes where each vehicle determines whether or not to forward a received packet in a decentralized manner, without the costly or even impractical demand for the knowledge of network topology. Considering a generic wireless connection model incorporating wireless channel randomness, analytical results are derived for the probability of successful delivery and the expected number of packet forwardings. Moreover, analysis is conducted on the optimal information forwarding scheme that meets a pre-designated probability of successful delivery objective using the minimum number of packet forwardings. © 2014 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/121608