Cooperative Communications for Reliable Data Transport with Fountain Codes

نویسندگان

  • Shuang Qin
  • Gang Feng
  • Yide Zhang
چکیده

Providing efficient and reliable data transport is a challenging problem for a variety of emerging applications which require reliable data packet delivery in wireless networks. In this paper, we propose to incorporate fountain codes at transport layer in the notion of cooperative relay communications to provide reliability and robustness for data transmission in wireless networks. Our basic idea is to exploit the joint merits of fountain codes and cooperative relay communications. We first derive the achievable rate of cooperative communications with fountain codes based on a general 3-node relay model and find that substantial improvement can be achieved compared with direct transmission and conventional AF and DF relay approaches. Inspired by this finding, we develop two cooperative communication strategies and analyze their performance. Numerical results show that our proposed approaches can achieve significant performance improvement in terms of data transport efficiency. In addition, the proposed approaches exhibit strong robustness to packet losses on wireless links for data transfer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Fountain Codes over Wireless Mobile Relay Network

Cooperative communications, where parallel relays forward information to a destination node, can effectively improve the latency in ad hoc networks. In practice, the performance of data transmission often compromises with the variation of channel coefficient and the mobility of network nodes. The conventional fixed rate cooperative relaying cannot make the outage probability reach zero without ...

متن کامل

Cooperative Relay Networks Using Fountain Codes

We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fountain codes. Receiver for codes can accumulate mutual information, while traditional energy collection methods, such as repetition or cooperative space-time codes, only accumulate energy. As a consequence, using fount...

متن کامل

Joint Energy and Mutual Information Accumulation for Cooperative Multi-relay High-speed Railway Mobile Communication System with Fountain Codes

In this paper, we investigate how to design effective strategy to improve the transmission data rate for highspeed railway mobile communication system with fountain codes. We consider a cooperative multi-relay architecture, where each relay is equipped with one antenna and the destination is with multiple antennas deployed. To this end, a new information receiving method at the destination is p...

متن کامل

A digital fountain approach to asynchronous reliable multicast

The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency ...

متن کامل

The Turbo-Fountain and its Application to Reliable Wireless Broadcast

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalization for fountain codes operating on erasure channels and we generalize the problem formalization to arbitrary types of channels. We introduce a novel type of rateless codes based on the turbo principle: the Turbo-Fountain. The TurboFountain is able to c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCM

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010