Opportunistic Fountain Coding with Coordinative Routing_Final.pdf (251.39 kB)
Download fileOpportunistic fountain coding with coordinative routing
journal contribution
posted on 2022-02-22, 14:52 authored by Tong Peng, Sangarapillai LambotharanSangarapillai Lambotharan, Gan Zheng, Mohammad Shikh-BahaeiFountain 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.
Funding
The Internet of Silicon Retinas (IoSiRe): Machine to machine communications for neuromorphic vision sensing data
Engineering and Physical Sciences Research Council
Find out more...Communications Signal Processing Based Solutions for Massive Machine-to-Machine Networks (M3NETs)
Engineering and Physical Sciences Research Council
Find out more...Basic Scientific Research Fund of Provincial Universities under Grant No. 2021J016
History
School
- Mechanical, Electrical and Manufacturing Engineering
Published in
IEEE Wireless Communications LettersVolume
11Issue
4Pages
851-855Publisher
Institute of Electrical and Electronics EngineersVersion
- AM (Accepted Manuscript)
Rights holder
© IEEEPublisher statement
© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Acceptance date
2022-01-26Publication date
2022-01-31Copyright date
2022ISSN
2162-2337eISSN
2162-2345Publisher version
Language
- en