Utility-optimal random access without message passing
نویسندگان
چکیده
منابع مشابه
Towards utility-optimal random access without message passing
It has been recently suggested by Jiang andWalrand that adaptive carrier sense multiple access (CSMA) can achieve optimal utility without any message passing in wireless networks. In this paper, after a survey of recent work on random access, a generalization of this algorithm is considered. In the continuous-time model, a proof is presented of the convergence of these adaptive CSMA algorithms ...
متن کاملMaximizing Utility via Random Access Without Message Passing
It has been an intensively sought-after goal to achieve high throughput and fairness in wireless scheduling through simple and distributed algorithms. Many recent papers on the topic have relied on various types of message passing among the nodes. The following question remains open: can scheduling without any message passing guarantee throughput-optimality and fairness? Over the last year, it ...
متن کاملUtility-Optimal Random Access: Optimal Performance Without Frequent Explicit Message Passing
In this paper, we propose a distributed random medium access control (MAC) algorithm for wireless ad hoc networks based on the framework of network utility maximization (NUM). Compared with the related algorithms proposed in the literature, our algorithm achieves the optimal network performance without frequent explicit message passing among wireless users. This is of critical importance in pra...
متن کاملParameterless Optimal Approximate Message Passing
Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In particular, both the final reconstruction error and the convergence rate of the algorithm crucially rely on how the threshold parameter is set at each step of the ...
متن کاملMessage passing in random satisfiability problems
This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generalization of the belief propagation strategy that is able to deal with the clustering of solutions in these problems. It allows to derive analytic results on their phase diagrams, and offers a new algorithmic framework.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2009
ISSN: 1536-1276
DOI: 10.1109/twc.2009.071446