Caching algorithms for broadcasting and multicasting in disruption tolerant networks

Tian, F; Liu, B; Zhou, H; Rui, Y; Chen, J; Xiong, J; Gui, L

Caching algorithms for broadcasting and multicasting in disruption tolerant networks

Tian, F Liu, B

Zhou, H Rui, Y Chen, J Xiong, J Gui, L

Permalink

Publisher:: WILEY-HINDAWI
Publication Type:: Journal Article
Citation:: Wireless Communications and Mobile Computing, 2016, 16, (18), pp. 3377-3390
Issue Date:: 2016-12-25

Closed Access

	Filename	Description	Size
	Wireless Communications - 2016 - Tian - Caching algorithms for broadcasting and multicasting in disruption tolerant.pdf	Published version	1.65 MB	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	Tian, F
dc.contributor.author	Liu, B https://orcid.org/0000-0002-3603-6617
dc.contributor.author	Zhou, H
dc.contributor.author	Rui, Y
dc.contributor.author	Chen, J
dc.contributor.author	Xiong, J
dc.contributor.author	Gui, L
dc.date.accessioned	2022-08-15T21:06:13Z
dc.date.available	2022-08-15T21:06:13Z
dc.date.issued	2016-12-25
dc.identifier.citation	Wireless Communications and Mobile Computing, 2016, 16, (18), pp. 3377-3390
dc.identifier.issn	1530-8669
dc.identifier.issn	1530-8677
dc.identifier.uri	http://hdl.handle.net/10453/160248
dc.description.abstract	In delay and disruption tolerant networks, the contacts among nodes are intermittent. Because of the importance of data access, providing efficient data access is the ultimate aim of analyzing and exploiting disruption tolerant networks. Caching is widely proved to be able to improve data access performance. In this paper, we consider caching schemes for broadcasting and multicasting to improve the performance of data access. First, we propose a caching algorithm for broadcasting, which selects the community central nodes as relays from both network structure perspective and social network perspective. Then, we accommodate the caching algorithm for multicasting by considering the data query pattern. Extensive trace-driven simulations are conducted to investigate the essential difference between the caching algorithms for broadcasting and multicasting and evaluate the performance of these algorithms. Copyright © 2016 John Wiley & Sons, Ltd.
dc.language	English
dc.publisher	WILEY-HINDAWI
dc.relation.ispartof	Wireless Communications and Mobile Computing
dc.relation.isbasedon	10.1002/wcm.2761
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.title	Caching algorithms for broadcasting and multicasting in disruption tolerant networks
dc.type	Journal Article
utslib.citation.volume	16
utslib.for	0805 Distributed Computing
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
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 Computer Science
utslib.copyright.status	closed_access	*
dc.date.updated	2022-08-15T21:06:11Z
pubs.issue	18
pubs.publication-status	Published
pubs.volume	16
utslib.citation.issue	18

Abstract:

In delay and disruption tolerant networks, the contacts among nodes are intermittent. Because of the importance of data access, providing efficient data access is the ultimate aim of analyzing and exploiting disruption tolerant networks. Caching is widely proved to be able to improve data access performance. In this paper, we consider caching schemes for broadcasting and multicasting to improve the performance of data access. First, we propose a caching algorithm for broadcasting, which selects the community central nodes as relays from both network structure perspective and social network perspective. Then, we accommodate the caching algorithm for multicasting by considering the data query pattern. Extensive trace-driven simulations are conducted to investigate the essential difference between the caching algorithms for broadcasting and multicasting and evaluate the performance of these algorithms. Copyright © 2016 John Wiley & Sons, Ltd.

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

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