Utility Maximization for Multihop Wireless Networks Employing BATS Codes
- 26 November 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Information Theory
- Vol. 2 (4) , 1120-1134
Abstract
BATS (BATched Sparse) codes are a class of efficient random linear network coding variation that has been studied for multihop wireless networks mostly in scenarios of a single communication flow. Towards sophisticated multi-flow network communications, we formulate a network utility maximization (NUM) problem that jointly optimizes the BATS code parameters of all the flows and network scheduling. The NUM problem adopts a batch-wise packet loss model that can be obtained from the network local statistics without any constraints on packet loss patterns. Moreover, the NUM problem allows a different number of recoded packets to be transmitted for different batches in a flow, which is called adaptive recoding. Due to both the probably nonconcave objective and the BATS code-related variables, the algorithms developed for the existing flow optimization problems cannot be applied directly to solve our NUM problem. We introduce a two-step algorithm to solve our NUM problem, where the first step solves the problem with nonadaptive recoding schemes, and the second step optimizes adaptive recoding hop-by-hop from upstream to downstream in each flow. We perform various numerical evaluations and simulations to verify the effectiveness and efficiency of the algorithm.Keywords
All Related Versions
Funding Information
- Shenzhen Science and Technology Innovation Committee (JCYJ20180508162604311, ZDSYS20170725140921348)
This publication has 54 references indexed in Scilit:
- Multichannel mesh networks: challenges and protocolsIEEE Wireless Communications, 2006
- Transmission Capacity of Wireless Ad Hoc Networks With Outage ConstraintsIEEE Transactions on Information Theory, 2005
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Network information flowIEEE Transactions on Information Theory, 2000
- On the performance of adaptive modulation in cellular systemsIEEE Transactions on Communications, 1999
- Optimization flow control. I. Basic algorithm and convergenceIEEE/ACM Transactions on Networking, 1999
- Adaptive coded modulation for fading channelsIEEE Transactions on Communications, 1998
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications, 1990