Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Data networks (2nd ed.)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Utility-optimal random access without message passing
IEEE Transactions on Wireless Communications
Utility-Optimal Random-Access Control
IEEE Transactions on Wireless Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Congestion-aware channel assignment for multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Queue back-pressure random access in multihop wireless networks: optimality and stability
IEEE Transactions on Information Theory
Implementing utility-optimal CSMA
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Dynamic conjectures in random access networks using bio-inspired learning
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Wireless Communications
Optimal SINR-based random access
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cell association and interference coordination in heterogeneous LTE-A cellular networks
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Hi-index | 0.07 |
In this paper, we propose two distributed contention-based medium access control (MAC) algorithms for solving a network utility maximization (NUM) problem in wireless ad hoc networks. Most of the previous NUM-based random access algorithms have one or more of the following performance bottlenecks: (1) extensive signaling among the nodes to achieve semi-distributed implementations, (2) synchronous updates of contention probabilities, (3) small update stepsizes to ensure convergence but with typically slow speed, and (4) supporting a limited range of utility functions under which the NUM is shown to be convex. Our proposed algorithms overcome the bottlenecks in all four aspects. First, only limited amount of message passing among nodes is required. Second, fully asynchronous updates of contention probabilities are allowed. Furthermore, our algorithms are robust to arbitrary large message passing delay and message loss. Third, we do not utilize any stepsize during updates, thus our algorithms can achieve faster convergence. Finally, our proposed algorithms have provable convergence, optimality, and robustness properties under a wider range of utility functions, even if the NUM problem is non-convex. Simulation results show the optimality and fast convergence of our algorithms, performance improvements compared with the subgradient-based MAC, and better efficiency-fairness tradeoff compared with the IEEE 802.11 distributed coordination function.