Guaranteeing Fair Service to Persistent Dependent Tasks
SIAM Journal on Computing
An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Multipath Optimization Flow Control
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Price-based resource allocation in wireless ad hoc networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks
IEEE Transactions on Wireless Communications
IEEE Network: The Magazine of Global Internetworking
Journal of Parallel and Distributed Computing
Distributed network utility maximization in wireless networks with a bounded number of paths
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Distributed scheduling for multi-hop wireless networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Joint configuration of routing and medium access parameters in wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Wireless Networking
MCR: MAC-assisted congestion-controlled routing for wireless multihop networks
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
In this paper we present a model for the joint congestion control, routing and MAC link access for ad hoc wireless networks. We formulate the problem as a utility maximization problem with routing and link access constraints. For the solution we exploit the separable structure of the problem via dual decomposition and the sub-gradient algorithm. The resulting algorithm directly translates into a distributed cross-layer scheme for joint congestion control, routing and link scheduling of the wireless links which revolves around link layer pricing. The convex problem formulation and the use of the sub-gradient algorithm ensures that the solution converges within an interval of the optimal value. We illustrate the algorithm behavior through examples.