Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
Network optimization and control
Foundations and Trends® in Networking
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
Dynamic data compression in multi-hop wireless networks
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this article, we propose a constrained queueing model 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-&epsis;) of the global optimum network utility where &epsis; 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.