Message Forwarding in Sparsely Connected Wireless Networks Using Rateless Codes

Author

Mishra, Sonu K. ; Indela, Soumya ; Bose, Sanjay K. ; Wen-De Zhong

Author_Institution

Dept. of Electr. & Electron. Eng. (EEE), Indian Inst. of Technol. (IIT) Guwahati, Guwahati, India

Volume

4

Issue

2

fYear

2015

fDate

Apr-15

Firstpage

137

Lastpage

140

Abstract

Rateless codes can reduce retransmission costs over erasure channels. Existing routing algorithms using rateless codes assume densely connected networks and predecide the forwarder nodes, which subsequently participate in message forwarding. Using a rateless code, which is easy to analyze and implement, we propose practically implementable opportunistic message forwarding algorithms for sparsely connected networks, in which all the nodes can potentially participate in forwarding, and study their performance through simulations.

Keywords

channel coding; network coding; radio networks; telecommunication network routing; erasure channels; opportunistic message forwarding algorithms; rateless codes; retransmission cost reduction; routing algorithms; sparsely connected wireless networks; Algorithm design and analysis; Benchmark testing; Receivers; Routing; Transmitters; Vectors; Wireless networks; Erasure Channels; Erasure channels; Rateless Codes; Routing; rateless codes; routing;

fLanguage

English

Journal_Title

Wireless Communications Letters, IEEE

Publisher

ieee

ISSN

2162-2337

Type

jour

DOI

10.1109/LWC.2014.2385855

Filename

6998009