TY - GEN
T1 - Control-theoretic optimization of utility over mission lifetimes in multi-hop wireless networks
AU - Eswaran, Sharanya
AU - Misra, Archan
AU - La Porta, Thomas
PY - 2009/11/20
Y1 - 2009/11/20
N2 - Both bandwidth and energy become important resource constraints when multi-hop wireless networks are used to transport relatively high data rate sensor flows. A particularly challenging problem involves the selection of flow data rates that maximize application (or mission) utilities over a time horizon, especially when different missions are active over different time intervals. Prior works on utility driven adaptation of flow data rates typically focus only on instantaneous utility maximization and are unable to address this temporal variation in mission durations. In this work, we derive an optimal control-based Network Utility Maximization (NUM) framework that is able to maximize the system utility over a lifetime that is known either deterministically or statistically. We first consider a static setup in which all the missions are continuously active for a deterministic duration, and show how the rates can be optimally adapted, via a distributed protocol, to maximize the total utility. Next, we develop adaptive protocols for the dynamic cases when we have (i) complete knowledge about the mission utilities and their arrivals and departures, and (ii) a varying amount of statistical information about the missions. Our simulation results indicate that our protocols are robust, efficient and close to the optimal.
AB - Both bandwidth and energy become important resource constraints when multi-hop wireless networks are used to transport relatively high data rate sensor flows. A particularly challenging problem involves the selection of flow data rates that maximize application (or mission) utilities over a time horizon, especially when different missions are active over different time intervals. Prior works on utility driven adaptation of flow data rates typically focus only on instantaneous utility maximization and are unable to address this temporal variation in mission durations. In this work, we derive an optimal control-based Network Utility Maximization (NUM) framework that is able to maximize the system utility over a lifetime that is known either deterministically or statistically. We first consider a static setup in which all the missions are continuously active for a deterministic duration, and show how the rates can be optimally adapted, via a distributed protocol, to maximize the total utility. Next, we develop adaptive protocols for the dynamic cases when we have (i) complete knowledge about the mission utilities and their arrivals and departures, and (ii) a varying amount of statistical information about the missions. Our simulation results indicate that our protocols are robust, efficient and close to the optimal.
UR - http://www.scopus.com/inward/record.url?scp=70449577125&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449577125&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2009.5168919
DO - 10.1109/SAHCN.2009.5168919
M3 - Conference contribution
AN - SCOPUS:70449577125
SN - 9781424429080
T3 - 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009
BT - 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009
T2 - 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009
Y2 - 22 June 2009 through 26 June 2009
ER -