Provable per-link delay-optimal CSMA for general wireless network topology

Lee, Dong-Myung; Yun, Donggyu; Shin, Jinwoo; Ye, Yi; Yun, Se-Young

doi:10.1109/infocom.2014.6848200

Cited by 14 publications

(20 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using Lemma 1 and (11), the BFE for any (b f , b v ) that satisfies the feasibility constraints in (13), (15) is given by…”

Section: Bethe Approximation For Csmamentioning

confidence: 99%

“…Remark: Since we are only interested in the Bethe optimization problem (13), throughout this paper, we implicitly assume that the factor and variable marginals (b f , b v ) satisfy the feasibility conditions in (13), (15), and use the BFE (19).…”

Section: Bethe Approximation For Csmamentioning

confidence: 99%

“…and the equivalent unconstrained optimization problem is to minimize F B {z i } i∈N , {y i } i∈N over the new variables. Technically, there should be additional inequality constraints on these new variables to impose positivity constraints described in(13). However, it can be shown that any stationary point of the BFE given in(19) implicitly satisfies those positivity constraints[28, Remark 4.1 in Page 85].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization

Swamy

Ganti

Jagannathan

2017

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

We consider a Carrier Sense Multiple Access (CSMA) based scheduling algorithm for a single-hop wireless network under a realistic Signal-to-interference-plus-noise ratio (SINR) model for the interference. We propose two local optimization based approximation algorithms to efficiently estimate certain attempt rate parameters of CSMA called fugacities. It is known that adaptive CSMA can achieve throughput optimality by sampling feasible schedules from a Gibbs distribution, with appropriate fugacities. Unfortunately, obtaining these optimal fugacities is an NP-hard problem. Further, the existing adaptive CSMA algorithms use a stochastic gradient descent based method, which usually entails an impractically slow (exponential in the size of the network) convergence to the optimal fugacities. To address this issue, we first propose an algorithm to estimate the fugacities, that can support a given set of desired service rates. The convergence rate and the complexity of this algorithm are independent of the network size, and depend only on the neighborhood size of a link. Further, we show that the proposed algorithm corresponds exactly to performing the well-known Bethe approximation to the underlying Gibbs distribution. Then, we propose another local algorithm to estimate the optimal fugacities under a utility maximization framework, and characterize its accuracy. Numerical results indicate that the proposed methods have a good degree of accuracy, and achieve extremely fast convergence to near-optimal fugacities, and often outperform the convergence rate of the stochastic gradient descent by a few orders of magnitude.

show abstract

“…Using Lemma 1 and (11), the BFE for any (b f , b v ) that satisfies the feasibility constraints in (13), (15) is given by…”

Section: Bethe Approximation For Csmamentioning

confidence: 99%

Section: Bethe Approximation For Csmamentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization

Swamy

Ganti

Jagannathan

2017

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…The authors of [8][9][10] proposed decentralized random access protocols that achieve full throughput when each user knows the maximum queue length in the system or all other users' transmission results. When channel sensing is allowed, carrier sense multiple access (CSMA) protocols, proposed in [11][12][13][14][15][16], achieve full throughput when the channel sensing portion of time is not taken into account in the throughput calculation. A survey of CSMA protocols is presented in [17].…”

Section: Related Workmentioning

confidence: 99%

“…A survey of CSMA protocols is presented in [17]. In terms of delay performance, the CSMA protocols proposed in [15,16] achieve delay that is linear in the number of users.…”

Section: Related Workmentioning

confidence: 99%

A common information-based multiple access protocol achieving full throughput

Ouyang

Teneketzis

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

We consider a multiple access communication system where multiple users share a common collision channel.Each user observes its local traffic and the feedback from the channel. At each time instant the feedback from the channel is one of three messages: no transmission, successful transmission, collision. The objective is to design a transmission protocol that coordinates the users' transmissions and achieves high throughput and low delay.We present a decentralized Common Information-Based Multiple Access (CIMA) protocol that has the following features: (i) it achieves the full throughput region of the collision channel; (ii) it results in a delay that is linear in the number of users, and is significantly lower than that of CSMA protocols; (iii) it avoids collisions without channel sensing. Index TermsMultiple access, decentralized control, common information I. INTRODUCTIONMultiple access communication has played a crucial role in the operation of many networked systems, including satellite networks, radio networks, wired/wireless Local Area Networks (LANs), and data centers. One important feature of multiple access communication is its decentralized information structure. In general, when multiple users share the communication system, coordination among them is essential to resolve collision issues. In the absence of a centralized controller, it is challenging to design efficient user coordination mechanisms.We consider a typical slotted multiple access communication system where multiple users share a common collision channel. Each user is equipped with an infinite size buffer and observes Bernoulli arrivals to its own queue. In addition to the local information, all users receive a common broadcast feedback from the channel. The feedback indicates whether the previous transmission was successful (exactly one user transmitted), or it was a This paper was presented in part at the 2015 IEEE International Symposium on Information Theory [1].

show abstract

Distributed Medium Access for Camera Sensor Networks: Theory and Practice

Lee

Yun

2015

KAIST Research Series

Self Cite

View full text Add to dashboard Cite

Offline Reinforcement Learning (Offline RL) presents challenges of learning effective decision-making policies from static datasets without any online interactions. Data augmentation techniques, such as noise injection and data synthesizing, aim to improve Q-function approximation by smoothing the learned state-action region. However, these methods often fall short of directly improving the quality of offline datasets, leading to suboptimal results. In response, we introduce GTA, Generative Trajectory Augmentation, a novel generative data augmentation approach designed to enrich offline data by augmenting trajectories to be both high-rewarding and dynamically plausible. GTA applies a diffusion model within the data augmentation framework. GTA partially noises original trajectories and then denoises them with classifier-free guidance via conditioning on amplified return value. Our results show that GTA, as a general data augmentation strategy, enhances the performance of widely used offline RL algorithms in both dense and sparse reward settings. Furthermore, we conduct a quality analysis of data augmented by GTA and demonstrate that GTA improves the quality of the data. Our code is available at https://github.com/Jaewoopudding/GTA * Equal contribution authors.Preprint. Under review.

show abstract

Provable per-link delay-optimal CSMA for general wireless network topology

Cited by 14 publications

References 23 publications

Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization

Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization

A common information-based multiple access protocol achieving full throughput

Distributed Medium Access for Camera Sensor Networks: Theory and Practice

Contact Info

Product

Resources

About