Rateless Coded Chain Cooperation in Linear Multi-Hop Wireless Networks

Wang, Xiaohong; Chen, W.; Cao, Zhichao

doi:10.1109/icc.2010.5502345

Cited by 8 publications

(17 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NSR [8] is similar to FA-FA. The first downstream node to decode the message is chosen as the forwarder.…”

Section: B Multi-hop Forwarding With No Spatial Reuse (Nsr)mentioning

confidence: 56%

“…Only the limited set of the nodes falling in shortest path route participate in an NSR [8] type of forwarding approach. This successfully eliminates the odds of choosing a node having a very bad path to destination as the forwarder, but also loses the nodes which could assist in better forwarding.…”

Section: First Ack With Shortest Path Forwarding (Fa-spf)mentioning

confidence: 99%

“…As in [5][6][7][8] and similar works, we assume a static network for convenience of description; however, our algorithms can still be used when the network state changes slowly enough.…”

Section: Introductionmentioning

confidence: 99%

“…However, the algorithms are centralized. The impact of spatial reuse on the performance of multi-hop rateless networks has been studied in [8].…”

Section: Introductionmentioning

confidence: 99%

“…For networks using rateless codes, works in [5][6][7][8] consider routing with mutual information accumulation (MIA). In [5], an optimal set of nodes and the order in which they should transmit are found by solving linear programs (LP).…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Message Forwarding in Sparsely Connected Wireless Networks Using Rateless Codes

Mishra

Indela

Bose

et al. 2015

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

Rateless Codes can reduce retransmission costs over erasure channels. Existing routing algorithms using rateless codes assume densely connected networks and pre-decide 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.

show abstract

“…NSR [8] is similar to FA-FA. The first downstream node to decode the message is chosen as the forwarder.…”

Section: B Multi-hop Forwarding With No Spatial Reuse (Nsr)mentioning

confidence: 56%

Section: First Ack With Shortest Path Forwarding (Fa-spf)mentioning

confidence: 99%

“…As in [5][6][7][8] and similar works, we assume a static network for convenience of description; however, our algorithms can still be used when the network state changes slowly enough.…”

Section: Introductionmentioning

confidence: 99%

“…However, the algorithms are centralized. The impact of spatial reuse on the performance of multi-hop rateless networks has been studied in [8].…”

Section: Introductionmentioning

confidence: 99%