A fast matching algorithm for asymptotically optimal distributed channel assignment

Naparstek, Oshri; Leshem, Amir

doi:10.1109/icdsp.2013.6622738

Cited by 12 publications

(13 citation statements)

References 23 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Gale-Shapley algorithm is used to solve the problem. Later in [22], a fast matching algorithm for asymptotically optimal channel assignment is proposed, which yields an asymptotically optimal matching. A similar idea is presented in [23], where a modified distributed auction algorithm is used to solve the problem, and then a faster matching algorithm is used to find the asymptotically optimal solution.…”

Section: B Matching Theory In Wireless Communicationsmentioning

confidence: 99%

Matching and Cheating in Device to Device Communications Underlying Cellular Networks

Zhang

Pan

et al. 2015

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

In device-to-device (D2D) communication, mobile users communicate directly without going through the base station. D2D commutation has the advantage of improving spectrum efficiency. But the interference introduced by resource sharing of D2D has become a significant challenge. In this paper, we try to optimize the system throughput while simultaneously meet the quality of service (QoS) requirements for both D2D users and cellular users (CUs). We implement matching theory to solve the resource allocation problem. We utilize two efficient stable matching algorithms to optimize the social welfare while ensuring the network stability. More importantly, we introduce the idea of cheating in matching to further improve D2D users' throughput. The cheating mechanism is proven to be able to benefit a subset of D2D users without hurting the performance of the rest. Through the simulation results, we demonstrate the effectiveness of both the stable matching and cheating algorithms in terms of improving both D2D users and the overall throughput in D2D communications.

show abstract

Section: B Matching Theory In Wireless Communicationsmentioning

confidence: 99%

Matching and Cheating in Device to Device Communications Underlying Cellular Networks

Zhang

Pan

et al. 2015

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

Section: A Related Workmentioning

confidence: 99%

“…In [28]- [30], a distributed channel allocation for Ad-Hoc networks was introduced, based on a carrier-sensing multiple access (CSMA) scheme and a thresholding approach for the channel gains. Although considering a different scenario, the analysis in [28]- [30] also used a random bipartite graph, albeit a very simplified one. The random bipartite graph in [28]- [30] was an Erdős-Rényi graph (i.e., existence of edges is independent), for which perfect matching existence results are well known [15].…”

Section: A Related Workmentioning

confidence: 99%

“…Although considering a different scenario, the analysis in [28]- [30] also used a random bipartite graph, albeit a very simplified one. The random bipartite graph in [28]- [30] was an Erdős-Rényi graph (i.e., existence of edges is independent), for which perfect matching existence results are well known [15]. There are no perfect matching existence results that can be employed for our graph, so a novel analysis is required.…”

Section: A Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Asymptotically Optimal Resource Block Allocation With Limited Feedback

Bistritz

Leshem

2019

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Consider a channel allocation problem over a frequency-selective channel. There are K channels (frequency bands) and N users such that K = bN for some positive integer b. We want to allocate b channels (or resource blocks) to each user. Due to the nature of the frequency-selective channel, each user considers some channels to be better than others. The optimal solution to this resource allocation problem can be computed using the Hungarian algorithm. However, this requires knowledge of the numerical value of all the channel gains, which makes this approach impractical for large networks. We suggest a suboptimal approach, that only requires knowing what the M -best channels of each user are. We find the minimal value of M such that there exists an allocation where all the b channels each user gets are among his M -best. This leads to feedback of significantly less than one bit per user per channel. For a large class of fading distributions, including Rayleigh, Rician, m-Nakagami and others, this suboptimal approach leads to both an asymptotically (in K) optimal sum-rate and an asymptotically optimal minimal rate. Our non-opportunistic approach achieves (asymptotically) full multiuser diversity as well as optimal fairness, by contrast to all other limited feedback algorithms.

show abstract

“…Recently, it has been shown that the optimal solution to the channel allocation problem can be achieved using a distributed algorithm [3], [4], [5]. This algorithm is a distributed version of the auction algorithm [6] and relies on a CSMA protocol.…”

Section: Introductionmentioning

confidence: 99%

Asymptotically optimal distributed channel allocation: A competitive game-theoretic approach

Bistritz

Leshem

2015

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper we consider the problem of distributed channel allocation in large networks under the frequency-selective interference channel. Performance is measured by the weighted sum of achievable rates. First we present a natural non-cooperative game theoretic formulation for this problem. It is shown that, when interference is sufficiently strong, this game has a pure price of anarchy approaching infinity with high probability, and there is an asymptotically increasing number of equilibria with the worst performance. Then we propose a novel non-cooperative M Frequency-Selective Interference Game (M-FSIG), where users limit their utility such that it is greater than zero only for their M best channels, and equal for them. We show that the M-FSIG exhibits, with high probability, an increasing number of optimal pure Nash equilibria and no bad equilibria. Consequently, the pure price of anarchy converges to one in probability in any interference regime. In order to exploit these results algorithmically we propose a modified Fictitious Play algorithm that can be implemented distributedly. We carry out simulations that show its fast convergence to the proven pure Nash equilibria.

show abstract

A fast matching algorithm for asymptotically optimal distributed channel assignment

Cited by 12 publications

References 23 publications

Matching and Cheating in Device to Device Communications Underlying Cellular Networks

Matching and Cheating in Device to Device Communications Underlying Cellular Networks

Asymptotically Optimal Resource Block Allocation With Limited Feedback

Asymptotically optimal distributed channel allocation: A competitive game-theoretic approach

Contact Info

Product

Resources

About