Abstract
In random network coding (RNC)-enabled networks, a sufficient number of linearly independent encoded packets, i.e., generations, is guaranteed at the cost of high latency and energy consumption at the transmitter. This letter aims to reduce the weighted sum of latency and energy while guaranteeing a targeted successful transmission probability, which is defined as the probability that the RNC-enabled network has sufficient generations when the transmitter receives a required number of acknowledgements (ACKs) feedback. An analytical framework and a deep learning-based method are developed. Results show that the latency and energy consumption are reduced by jointly optimizing the required number of ACKs and the transmit power at the transmitter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.