Opportunistic fountain coding with coordinative routing

Fountain codes are widely employed to improve reliability and efficiency in wireless communication systems due to their simple coding mechanisms. In this letter, we propose an opportunistic decoding and recoding mechanism with coordinative routing algorithm for fountain codes to improve the expected...

Full description

Saved in:
Bibliographic Details
Main Authors: Tong Peng, Sangarapillai Lambotharan, Gan Zheng, Mohammad Shikh-Bahaei
Format: Default Article
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/2134/19213479.v1
Tags: Add Tag
No Tags, Be the first to tag this record!
id rr-article-19213479
record_format Figshare
spelling rr-article-192134792022-01-31T00:00:00Z Opportunistic fountain coding with coordinative routing Tong Peng (709503) Sangarapillai Lambotharan (1252278) Gan Zheng (2546086) Mohammad Shikh-Bahaei (7210268) Distributed computing and systems software not elsewhere classified partial fountain decoding opportunistic routing coordinative forwarding Distributed Computing Fountain codes are widely employed to improve reliability and efficiency in wireless communication systems due to their simple coding mechanisms. In this letter, we propose an opportunistic decoding and recoding mechanism with coordinative routing algorithm for fountain codes to improve the expected transmission counts (ETX) performance and to reduce computational complexity of fountain decoding at each relay in multi-hop wireless sensor networks. The full recovery in existing cooperative fountain coded networks is replaced by a new partial decoding and recoding mechanism in which both the recovered and the unrecovered packets at the intermediate nodes are considered as recoding candidates. Numerical results show that the proposed algorithm is superior to the existing opportunistic routing-based fountain code schemes. 2022-01-31T00:00:00Z Text Journal contribution 2134/19213479.v1 https://figshare.com/articles/journal_contribution/Opportunistic_fountain_coding_with_coordinative_routing/19213479 All Rights Reserved
institution Loughborough University
collection Figshare
topic Distributed computing and systems software not elsewhere classified
partial fountain decoding
opportunistic routing
coordinative forwarding
Distributed Computing
spellingShingle Distributed computing and systems software not elsewhere classified
partial fountain decoding
opportunistic routing
coordinative forwarding
Distributed Computing
Tong Peng
Sangarapillai Lambotharan
Gan Zheng
Mohammad Shikh-Bahaei
Opportunistic fountain coding with coordinative routing
description Fountain codes are widely employed to improve reliability and efficiency in wireless communication systems due to their simple coding mechanisms. In this letter, we propose an opportunistic decoding and recoding mechanism with coordinative routing algorithm for fountain codes to improve the expected transmission counts (ETX) performance and to reduce computational complexity of fountain decoding at each relay in multi-hop wireless sensor networks. The full recovery in existing cooperative fountain coded networks is replaced by a new partial decoding and recoding mechanism in which both the recovered and the unrecovered packets at the intermediate nodes are considered as recoding candidates. Numerical results show that the proposed algorithm is superior to the existing opportunistic routing-based fountain code schemes.
format Default
Article
author Tong Peng
Sangarapillai Lambotharan
Gan Zheng
Mohammad Shikh-Bahaei
author_facet Tong Peng
Sangarapillai Lambotharan
Gan Zheng
Mohammad Shikh-Bahaei
author_sort Tong Peng (709503)
title Opportunistic fountain coding with coordinative routing
title_short Opportunistic fountain coding with coordinative routing
title_full Opportunistic fountain coding with coordinative routing
title_fullStr Opportunistic fountain coding with coordinative routing
title_full_unstemmed Opportunistic fountain coding with coordinative routing
title_sort opportunistic fountain coding with coordinative routing
publishDate 2022
url https://hdl.handle.net/2134/19213479.v1
_version_ 1797367303271088128