Abstract
In this article, we propose a constrained queueingmodel to investigate the performance of multihop wireless sensor networks. Specifically, the cross-layer interactions of rate admission control, traffic engineering, dynamic routing, and adaptive link scheduling are studied jointly with the proposed queueing model. In addition, the stochastic network utility maximization problem in wireless sensor networks is addressed within this framework. We propose an adaptive network resource allocation scheme, called the ANRA algorithm, which provides a joint solution to the multiple-layer components of the stochastic network utility maximization problem.We show that the proposed ANRA algorithm achieves a near-optimal solution, that is, (1 - ε) of the global optimum network utility where ε can be arbitrarily small, with a trade-off with the average delay experienced in the network. The proposed ANRA algorithm enjoys the merit of self-adaptability through its online nature and thus is of particular interest for time-varying scenarios such as multihop wireless sensor networks. © 2010 ACM.
| Original language | English |
|---|---|
| Article number | 4 |
| Journal | ACM Transactions on Modeling and Computer Simulation |
| Volume | 21 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Dec 2010 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Cross-layer design
- Online algorithms
- Stochastic network optimization
- Stochastic utility maximization