Design and analysis of network adaptive coding protocol based on dynamic feedback. (7th November 2021)

• Record Type: Journal Article
• Authors: Zhang, Wei; Bai, Yangyang; Li, Xiarui; Zhou, Renjie
• Is Part Of: International journal of sensor networks. Volume 37:Number 3(2021)
• Page Start: 171
• Page End: 187
• Publication Date: 2021-11-07
• Subjects: network coding -- dynamic feedback -- degree distribution -- Coupon Collector's Problem -- multi-layer network -- Markov chain of stochastic process theory -- growth codes -- degree time conversion sequence -- single-point-to-multipoint networks -- network erasure rates -- redundant packets -- real-time collection; Sensor networks -- Periodicals; 681.2
• Languages: English
• ISSNs: 1748-1279

Abstract

Traditional wireless network coding methods often fail to achieve ideal collection efficiency under single-point-to-multipoint multi-layer networks, and the Coupon Collector's Problem aggravates the collection delay. This paper divides the network hierarchy into the source node, relay node and sink node, and proves the collection delay effect in multi-layer network through Markov chain analysis. Then we propose to use a small amount of feedback information to reduce the collection delay and the number of invalid codewords, and derive a new degree distribution formula. We propose a dynamic feedback adaptive coding (DFAC) model and propose an adaptive coding protocol (DFACP) based on DFAC. It shows that the DFAC model is superior to the traditional LT Codes and Growth codes protocol in terms of collection efficiency and other indicators, and the scheme has strong adaptive robustness in dynamic node changes.