Multihop uncoordinated cooperative forwarding in highly dynamic networks

Zhang, X; Mao, G; Tao, X; Cui, Q; Liu, B

Multihop uncoordinated cooperative forwarding in highly dynamic networks

Zhang, X Mao, G

Tao, X Cui, Q Liu, B

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings of the 11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QSHINE 2015, 2015, pp. 194 - 200
Issue Date:: 2015-11-19

Closed Access

	Filename	Description	Size
	Zhang15Multihop.pdf	Published version	304.6 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, X	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Tao, X	en_US
dc.contributor.author	Cui, Q	en_US
dc.contributor.author	Liu, B	en_US
dc.date.available	2015-06-15	en_US
dc.date.issued	2015-11-19	en_US
dc.identifier.citation	Proceedings of the 11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QSHINE 2015, 2015, pp. 194 - 200	en_US
dc.identifier.isbn	9781631900631	en_US
dc.identifier.uri	http://hdl.handle.net/10453/41056
dc.description.abstract	© 2015 ICST. This paper investigates cooperative forwarding in large highly dynamic wireless networks. Unlike traditional coordinated cooperative forwarding schemes that require a large amount of neighborhood discovery and coordination information to be exchanged before making the forwarding decision, this paper proposes an uncoordinated cooperative forwarding scheme where each node determines whether or not to forward a received packet independently based on a forwarding probability determined by its own location, the density of nodes in the network and the locations of the destination and the transmitter from which it receives the packet, without the costly or even impractical neighbor discovery and coordination process. Analytical results are derived on the successful transmission probability and the expected number of forwarding nodes involved in the cooperative forwarding process. On that basis, discussions are presented on the optimal forwarding probability design that meets a pre-designated successful transmission probability target using minimum number of forwarding nodes. Simulations are conducted to evaluate the performance of the proposed scheme.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP120102030
dc.relation	http://purl.org/au-research/grants/arc/DP110100538
dc.relation.ispartof	Proceedings of the 11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QSHINE 2015	en_US
dc.relation.isbasedon	10.4108/eai.19-8-2015.2260846	en_US
dc.title	Multihop uncoordinated cooperative forwarding in highly dynamic networks	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	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:

© 2015 ICST. This paper investigates cooperative forwarding in large highly dynamic wireless networks. Unlike traditional coordinated cooperative forwarding schemes that require a large amount of neighborhood discovery and coordination information to be exchanged before making the forwarding decision, this paper proposes an uncoordinated cooperative forwarding scheme where each node determines whether or not to forward a received packet independently based on a forwarding probability determined by its own location, the density of nodes in the network and the locations of the destination and the transmitter from which it receives the packet, without the costly or even impractical neighbor discovery and coordination process. Analytical results are derived on the successful transmission probability and the expected number of forwarding nodes involved in the cooperative forwarding process. On that basis, discussions are presented on the optimal forwarding probability design that meets a pre-designated successful transmission probability target using minimum number of forwarding nodes. Simulations are conducted to evaluate the performance of the proposed scheme.

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

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