Network Coding For Data Dissemination: It Is Not What You Know, But What Your Neighbors Don’t Know

• Type: Article in International Conference Proceedings Book
• Date: 2009

Authors

Daniel E. Lucani (Author) FEUP; Frank H. P. Fitzek (Author) FEUP; Muriel Medard (Author) FEUP; Milica Stojanovic (Author) FEUP

Conference proceedings International

Title: WiOpt Workshop: RAWNET/WNC

Pages: 407-414

Proceedings of Fifth Workshop on Resource Allocation, Cooperation and Competition in Wireless Networks (RAWNET/WNC). Workshop on the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT'09 ).

Seoul, Korea, Jun de 2009

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences > Engineering > Communication engineering > Telecommunications engineering

Other information

Resumo (PT): We propose a linear network coding scheme to disseminate a finite number of data packets in arbitrary networks. The setup assumes a packet erasure channel, slotted time, and that nodes cannot transmit and receive information simultaneously. The dissemination process is completed when all terminals can decode the original data packets. We also assume a perfect knowledge of the information at each of the nodes, but not necessarily a perfect knowledge of the channel. A centralized controller decides which nodes should transmit, to what set of receiver nodes, and what information should be broadcasted. We show that the problem can be thought of as a scheduling problem, which is hard to solve. Thus, we consider the use of a greedy algorithm that only takes into account the current state of the system to make a decision. The proposed algorithm tries to maximize the impact on the network at each slot, i.e, maximize the number of nodes that will benefit from the coded packet sent by each active transmitter. We show that our scheme is considerably better, in terms of the number of slots to complete transmission, than schemes that choose the node with more information as the transmitter at every time slot.

Abstract (EN): We propose a linear network coding scheme to disseminate a finite number of data packets in arbitrary networks. The setup assumes a packet erasure channel, slotted time, and that nodes cannot transmit and receive information simultaneously. The dissemination process is completed when all terminals can decode the original data packets. We also assume a perfect knowledge of the information at each of the nodes, but not necessarily a perfect knowledge of the channel. A centralized controller decides which nodes should transmit, to what set of receiver nodes, and what information should be broadcasted. We show that the problem can be thought of as a scheduling problem, which is hard to solve. Thus, we consider the use of a greedy algorithm that only takes into account the current state of the system to make a decision. The proposed algorithm tries to maximize the impact on the network at each slot, i.e, maximize the number of nodes that will benefit from the coded packet sent by each active transmitter. We show that our scheme is considerably better, in terms of the number of slots to complete transmission, than schemes that choose the node with more information as the transmitter at every time slot.

Language: English

Type (Professor's evaluation): Scientific