[LIBRO][B] Communication networks: An optimization, control and stochastic networks perspective

R Srikant, L Ying - 2014 - books.google.com
Provides a modern mathematical approach to the design of communication networks for
graduate students, blending control, optimization, and stochastic network theories. A broad …

Cell association and interference coordination in heterogeneous LTE-A cellular networks

R Madan, J Borran, A Sampath… - IEEE Journal on …, 2010 - ieeexplore.ieee.org
Embedding pico/femto base-stations and relay nodes in a macro-cellular network is a
promising method for achieving substantial gains in coverage and capacity compared to …

Gossip algorithms

D Shah - Foundations and Trends® in Networking, 2009 - nowpublishers.com
Unlike the Telephone network or the Internet, many of the next generation networks are not
engineered for the purpose of providing efficient communication between various networked …

Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

J Ni, B Tan, R Srikant - IEEE/ACM Transactions on Networking, 2011 - ieeexplore.ieee.org
Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access
algorithms can achieve the maximum possible throughput in ad hoc wireless networks …

Closed-form Whittle's index-enabled random access for timely status update

J Sun, Z Jiang, B Krishnamachari… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We consider a star-topology wireless network for status update where a central node
collects status data from a large number of distributed machine-type terminals that share a …

Optimal CSMA: a survey

SY Yun, Y Yi, J Shin - 2012 IEEE international conference on …, 2012 - ieeexplore.ieee.org
Carrier Sense Multiple Access (CSMA) has been widely used as a medium access control
(MAC) scheme in wireless networks mainly due to its simple and totally distributed …

Distributed random access algorithm: scheduling and congestion control

L Jiang, D Shah, J Shin… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier
sense multiple access (CSMA) algorithms where the random access (or backoff) parameter …

Randomized scheduling algorithm for queueing networks

D Shah, J Shin - 2012 - projecteuclid.org
There has recently been considerable interest in design of low-complexity, myopic,
distributed and stable scheduling algorithms for constrained queueing network models that …

Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling

L Jiang, M Leconte, J Ni, R Srikant… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
Glauber dynamics is a powerful tool to generate randomized, approximate solutions to
combinatorially difficult problems. It has been recently used to design distributed carrier …

On the design of efficient CSMA algorithms for wireless networks

J Ghaderi, R Srikant - 49th IEEE Conference on Decision and …, 2010 - ieeexplore.ieee.org
Recently, it has been shown that CSMA algorithms which use queue length-based link
weights can achieve throughput optimality in wireless networks. In particular, a key result by …