Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

On coding for cooperative data exchange

Date

Authors

El Rouayheb, Salim

Sprintson, Alex

Sadeghi, Parastoo

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in its possession

Keywords

Keywords: Broadcast channels; Data exchange; Efficient algorithm; Numerical simulation; Optimal number; Peer-to-Peer system; Performance guarantees; Upper and lower bounds; Wireless data broadcast; Wireless nodes; Algorithms; Computer simulation; Peer to peer netwo

URI

http://hdl.handle.net/1885/61667

Collections

ANU Research Publications

Source

Proceedings of IEEE Information Theory Workshop on Coding and Complexity (ITW 2010)

Type

Conference paper

DOI

10.1109/ITWKSPS.2010.5503135

Restricted until

2037-12-31

Downloads

File

Description

01_El Rouayheb_On_coding_for_cooperative_data_2010.pdf (385.42 KB)