Go to:
Logótipo
Você está em: Start » Publications » View » On Optimal Policies for Network Coded Cooperation : Theory and Implementation
Publication

On Optimal Policies for Network Coded Cooperation : Theory and Implementation

Title
On Optimal Policies for Network Coded Cooperation : Theory and Implementation
Type
Article in International Scientific Journal
Year
2014
Authors
Hana Khamfroush
(Author)
FEUP
Daniel Lucani
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Pahlevani, P.
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
ISSN: 0733-8716
Publisher: IEEE
Indexing
Publicação em ISI Web of Science ISI Web of Science
Scientific classification
FOS: Engineering and technology
Other information
Abstract (EN): Network coded cooperative communication (NCCC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NCCC scenarios rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers and half duplex erasure channels. The problem is modelled as a special case of Markov decision process (MDP), called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot and we use it to design nearoptimal heuristics for packet transmission in a network of one source and N 2 receivers. We also present numerical results that illustrate the performance of the proposed heuristics under a variety of scenarios. To complete our analysis, our heuristics are implemented in Aalborg University’s Raspberry Pi test-bed and compared with random linear network coding (RLNC) broadcast in terms of completion time, total number of required transmissions, and percentage of delivered generations. Our measurements show that enabling cooperation only amongst pairs of devices can decrease the completion time by up to 4:75 times while delivering 100% of the 10000 generations transmitted, compared to RLNC broadcast delivering only 88% of them in our tests.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Network-Coded Cooperation Over Time-Varying Channels (2014)
Article in International Scientific Journal
Hana Khamfroush; Daniel Lucani; Pahlevani, P.; João Barros

Of the same journal

Whether and Where to Code in the Wireless Relay Channel (2012)
Article in International Scientific Journal
Xiaomeng Shi; Muriel Médard; Daniel E. Lucani
Underwater Acoustic Networks: Channel Models and Network Coding based Lower Bound to Transmission Power for Multicast (2008)
Article in International Scientific Journal
Daniel E. Lucani; Muriel Médard; Milica Stojanovic
Secure Network Coding for Multi-Resolution Wireless Video Streaming (2010)
Article in International Scientific Journal
L. Lima; S. Gheorghiu; J. Barros; M. Médard; A. L. Toledo
Real-Time Network Coding for Live Streaming in Hyper-Dense WiFi Spaces (2014)
Article in International Scientific Journal
Diogo Ferreira; Rui Costa; João Barros
On the Delay Distribution of Random Linear Network Coding (2011)
Article in International Scientific Journal
Maricica Nistor; Daniel E. Lucani; Tiago Travassos Vieira Vinhoza; Costa, Rui Filipe Mendes Alves da ; João Francisco Cordeiro de Oliveira Barros

See all (9)

Recommend this page Top
Copyright 1996-2024 © Faculdade de Medicina da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-11-01 at 03:23:41
Acceptable Use Policy | Data Protection Policy | Complaint Portal | Política de Captação e Difusão da Imagem Pessoal em Suporte Digital