Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Wireless Communications
Cross-layer optimization in TCP/IP networks
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Wireless Communications
Optimal power control for Rayleigh-faded multiuser systems with outage constraints
IEEE Transactions on Wireless Communications
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Retransmission aware congestion control and distributed power allocation in MANETs
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Optimal route selection and resource allocation in multi-hop cognitive radio networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Utility-based scheduling with non-deterministic fading channels in wireless multi-hop networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Reducing signaling and respecting time-scales in cross-layer protocols design for wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Near optimum power control under fairness constraints in CoMP systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Fast power control for cross-layer optimal resource allocation in DS-CDMA wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Joint rate and power control in wireless network: a novel successive approximations method
IEEE Communications Letters
Optimal Congestion and Power Control Providing SINR Guarantee and Energy Saving for Ad Hoc Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Journal of Network and Computer Applications
Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
Biological Swarm Intelligence Based Opportunistic Resource Allocation for Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
Multi-path utility maximization and multi-path TCP design
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We seek distributed protocols that attain the global optimum allocation of link transmitter powers and source rates in a cross-layer design of a mobile ad hoc network. Although the underlying network utility maximization is nonconvex, convexity plays a major role in our development. We provide new convexity results surrounding the Shannon capacity formula, allowing us to abandon suboptimal high-SIR approximations that have almost become entrenched in the literature. More broadly, these new results can be back-substituted into many existing problems for similar benefit. Three protocols are developed. The first is based on a convexification of the underlying problem, relying heavily on our new convexity results. We provide conditions under which it produces a globally optimum resource allocation. We show how it may be distributed through message passing for both rate- and power-allocation. Our second protocol relaxes this requirement and involves a novel sequence of convex approximations, each exploiting existing TCP protocols for source rate allocation. Message passing is only used for power control. Our convexity results again provide sufficient conditions for global optimality. Our last protocol, motivated by a desire of power control devoid of message passing, is a near optimal scheme that makes use of noise measurements and enjoys a convergence rate that is orders of magnitude faster than existing methods.