Distributed Beam Scheduling in Multi-Cell Networks via Auction over Competitive Markets

Yang, Kai; Calin, Doru; Chae, Chan-Byoung; Yiu, S.

doi:10.1109/icc.2011.5962730

Cited by 9 publications

(9 citation statements)

References 11 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, some UEs have no throughput, which means the minimum throughput as well as the delay-sensitivity of the UEs is not satisfied. Second, we rigorously prove that our proposed policy achieves good performance with low (polynomial-time) complexity , while [30] [31] do not. Third, the schemes in [30] [31] are proposed for a specific network performance criterion and may not be flexible enough for other network performance criteria (such as the sum throughput).…”

Section: Other Interference Management Policiesmentioning

confidence: 89%

See 1 more Smart Citation

Efficient Interference Management Policies for Femtocell Networks

Ahuja

Xiao

Schaar

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Managing interference in a network of macrocells underlaid with femtocells presents an important, yet challenging problem. A majority of spatial frequency/time reuse based approaches partition the users by coloring the interference graph, which is shown to be suboptimal. Some spatial time reuse based approaches schedule the maximal independent sets (MISs) of users in a cyclic, (weighted) round-robin fashion, which is inefficient for delay-sensitive applications. Our proposed policies schedule the MISs in a non-cyclic fashion, which aim to optimize any given network performance criterion for delaysensitive applications while fulfilling minimum throughput requirements of the users. Importantly, we do not take the interference graph as given as in existing works; we propose an optimal construction of interference graph. We prove that under certain conditions, the proposed policy achieves the optimal network performance. For large networks, we propose a low-complexity algorithm for computing the proposed policy, and prove that under certain conditions, the policy has a competitive ratio (with respect to the optimal network performance) that is independent of the network size. The proposed policy can be implemented in a decentralized manner by the users. Compared to the existing policies, our proposed policies can achieve improvement of up to 130 % in large-scale deployments.

show abstract

Section: Other Interference Management Policiesmentioning

confidence: 89%

“…In [30] and [31], the authors schedule a subset of beams to maximize the total reward associated with the scheduled subset, where the reward per beam reflects the channel quality and traffic. ii) Interference Graph UEs.…”

Section: Other Interference Management Policiesmentioning

confidence: 99%

Efficient Interference Management Policies for Femtocell Networks

Ahuja

Xiao

Schaar

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…• For max = 3, the SSLF and SGN results are similar because of no room for the GN optimization. 3 • For max = [4,5] the GN solutions demonstrate much higher performance gain for the given complexity that brings back the normal situation with better performance for higher complexity contradictory to the SLF / SSLF case.…”

Section: B Stationary Scenariomentioning

confidence: 92%

“…Decentralized beamforming scheduling is a well known topic in multi-cell networks, e.g., [5] - [7]. A typical assumption for such schemes is that distributed beam scheduling requires local message passing at least between neighboring BSs.…”

Section: Introductionmentioning

confidence: 99%

Good neighbor distributed beam scheduling in coexisting multi-RAT networks

Kuzminskiy

Xiao

Tafazolli

2018

2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)

View full text Add to dashboard Cite

Spectrum sharing and employing highly directional antennas in the mm-wave bands are considered among the key enablers for 5G networks. Conventional interference avoidance techniques like listen-before-talk (LBT) may not be efficient for such coexisting networks. In this paper, we address a coexistence mechanism by means of distributed beam scheduling with minimum cooperation between spectrum sharing subsystems without any direct data exchange between them. We extend a "Good Neighbor" (GN) principle initially developed for decentralized spectrum allocation to the distributed beam scheduling problem. To do that, we introduce relative performance targets, develop a GN beam scheduling algorithm, and demonstrate its efficiency in terms of performance/complexity trade off compared to that of the conventional selfish (SLF) and recently proposed distributed learning scheduling (DLS) solutions by means of simulations in highly directional antenna mm-wave scenarios.

show abstract

“…2(a), an aligned beam sequence. This algorithm is well studied in [15]; since this problem is known as NP-hard, the authors discuss centralized and distributed algorithms (mainly for a two-beam per BS case).…”

Section: Beam Switching Mechanismmentioning

confidence: 99%

Is conflict always bad? From an interference management perspective

Chae¹,

Yang²,

Yiu³

et al. 2010

2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers

Self Cite

View full text Add to dashboard Cite

In this paper, we first introduce a simple two-cell multiple-input multiple-output (MIMO) solution where each base station has only its own data message. The algorithm is based on limited feedback from the mobile station (MS). We assume there is no base station (BS) cooperation through backbone; therefore cooperation among BSs is not a requirement. This renders the concept of the proposed solution easier for product implementation. To extend the algorithm to a multi-cell scenario, we next propose a novel physical beam-switching method based on the proposed two-cell MIMO solution. Conventionally, all BSs align the beam directions to avoid inter-cell interference. In this paper, however, we propose using a different beam-switching method based on beam conflict. Instead of aligning all the beams, we intentionally create a strong interference term. In doing so, all but the strongest interference is significantly reduced; the strongest interference term is further removed/minimized by the proposed two-cell MIMO solution. This results in increasing the received signal-to-noise-plus-interference ratio (SINR). Unlike prior work, our solution creates and utilizes the conflict, that is, the conflict is useful. That the conflict significantly helps multi-cell systems improve throughput is confirmed through numerical results.

show abstract

Distributed Beam Scheduling in Multi-Cell Networks via Auction over Competitive Markets

Cited by 9 publications

References 11 publications

Efficient Interference Management Policies for Femtocell Networks

Efficient Interference Management Policies for Femtocell Networks

Good neighbor distributed beam scheduling in coexisting multi-RAT networks

Is conflict always bad? From an interference management perspective

Contact Info

Product

Resources

About