Ascending-bid auction for unequal-erasure-protected network coding

Author

Limmanee, Apirath ; Henkel, Werner

Author_Institution

EECS, Jacobs Univ., Bremen, Germany

fYear

2009

fDate

11-16 Oct. 2009

Firstpage

31

Lastpage

35

Abstract

According to our previous paper, global encoding kernels (GEKs) describing linear network codes have different levels of built-in unequal-erasure-protecting (UEP) capability. This creates conflicts among sink nodes in a multicast session since a particular assignment of GEKs favors one sink node over another. This paper proposes a resolution to the conflict by means of a simple ascending-bid auction scheme which has three obvious benefits. First, it frees all the nodes from the complicated optimization algorithms that might otherwise be used. Second, it provides the source node with some revenue. Lastly, it allows the richer sink nodes to receive the data with better quality.

Keywords

linear codes; network coding; ascending-bid auction scheme; global encoding kernels; linear network codes; unequal-erasure-protected network coding; Conferences; Data communication; Encoding; Error correction codes; Helium; Information theory; Jacobian matrices; Kernel; Multicast algorithms; Network coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 2009. ITW 2009. IEEE

Conference_Location

Taormina

Print_ISBN

978-1-4244-4982-8

Electronic_ISBN

978-1-4244-4983-5

Type

conf

DOI

10.1109/ITW.2009.5351216

Filename

5351216