Base station assignment and power control algorithms for data users in a wireless multiaccess framework

Ganti, Anand; Klein, Thierry; Haner, M.

doi:10.1109/twc.2006.1687773

Cited by 17 publications

(15 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Simulation parameters are summarized in Table 2. The downlink pole capacity C air provided in Table 2 was obtained by rounding expression (5) to the nearest multiple of the bit rate under consideration and assuming an average ratio of other-to-own interference f DL =0.65 and average orthogonality factor ρ = 0.5 [6]. This pole capacity is used in our analysis to set up the transport capacity of BSs according to (6).…”

Section: Simulation Resultsmentioning

confidence: 99%

“…In this context, methods for allocating users in cellular networks has attracted considerable attention (e.g. see [4], [5]), but generally this problem has been formulated in terms of air interface resource optimization without considering backhaul constraints of the BSs. It is worth noting that when addressing BS assignment strategies that consider criteria other than radio, the main challenge is to keep under control the amount of degradation of the radio interface due to not always connecting users to their "best" radio serving BS (e.g.…”

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

A Cost-Based Approach for Base Station Assignment in Mobile Networks with Limited Backhaul Capacity

Galeana

Novillo

Ferrús

2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

1 Existing base station (BS) assignment methods in cellular networks are mainly driven by radio conditions since it is assumed that the limiting factor is the air interface. This assumption has been proven to be very reasonable when circuit voice was the dominant service and backhaul capacity provisioning in BS accounting for the peak rate of the radio link was an economically feasible option. However, as traffic continues increasing and enhanced air interfaces are been deployed, a growing concern is that also the mobile backhauling can become a bottleneck in certain deployment scenarios. In this paper we present a BS assignment algorithm designed to optimize radio resource usage while simultaneously considering potential capacity limitations in mobile backhauls. The BS assignment problem is formulated using a cost-based framework and mapped into a Multiple-Choice Multidimensional Knapsack Problem (MMKP) that is solved by means of a heuristic algorithm with polynomial time. The proposed algorithm is evaluated and compared to two schemes based exclusively on radio conditions. Simulation results show that the proposed algorithm can assign more users than existing algorithms without violating radio and transport constraints in partially backhaul limited scenarios.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

A Cost-Based Approach for Base Station Assignment in Mobile Networks with Limited Backhaul Capacity

Galeana

Novillo

Ferrús

2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…In terms of complexity, solving the UE-SN association problem using classical optimization techniques is an NP-hard problem [20], which depends on the number of SNs and UEs in the network. In this work, we propose a heuristic procedure which is based on two-way preferences for both UEs and SNs.…”

Section: Social Welfarementioning

confidence: 99%

Exploring social networks for optimized user association in wireless small cell networks with device-to-device communications

Ashraf

Bennis

Saad

et al. 2014

2014 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)

View full text Add to dashboard Cite

Abstract-In this paper, we propose a novel social network aware approach for user association in wireless small cell networks. The proposed approach exploits social relationships between user equipments (UEs) and their physical proximity to optimize the network throughput. We formulate the problem as a matching game between UEs and their serving nodes (SNs). In our proposed game, the serving node can be a small cell base station (SCBS) or an important node with device-todevice capabilities. In this game, the SCBSs and UEs maximize their respective utility functions capturing both the spatial and social structures of the network. We show that the proposed game belongs to the class of matching games with externalities. Subsequently, we propose a distributed algorithm using which the SCBSs and UEs interact and reach a stable matching. We show the convergence of the proposed algorithm and study the properties of the resulting matching. Simulation results show that the proposed socially-aware user association approach can efficiently offload traffic while yielding a significant gain reaching up to 63% in terms of data rates as compared to the classical (social-unaware) approach.

show abstract

“…Let us denote by G c,j the path gain between cell c and user j, reflecting the long-time behavior of the channel gain. Fast-fading can be considered via smoothing out by appropriate averaging [22]. We focus on one time-slot assuming that the path gain, background noise, and inter-cell interference for each mobile do not change during this time-slot [23,24].…”

Section: System Modelmentioning

confidence: 99%

“…Initially, we argue on the selected update step for the proposed subgradient method (22), which is a diminishing step size rule a(t) with the following properties: a(t) > 0, lim t→1 a t ð Þ ¼ 0 and P t=0 ∞ a(t) = ∞. In accordance to [36], since ℂ is compact and not empty, and CM is a convex optimization problem, then via a diminishing step size rule, for example a t ð Þ ¼ t βþt where β > 1 is a fixed constant, the subgradient algorithm converges, i.e., p var t ð Þ→ p Ã var as t → ∞ and thus lim sup…”

Section: Initializationmentioning

confidence: 99%

Optimal power control and coverage management in two-tier femtocell networks

Aristomenopoulos

Kastrinogiannis

Stamatina

et al. 2012

J Wireless Com Network

View full text Add to dashboard Cite

In this article, we jointly consider the problem of efficient power control and coverage (PCC) management over an integrated two-tier macrocell/femtocell network towards maximizing the expected throughput of the system subject to appropriate power constraints, under the existence of both co-tier and cross-tier interferences. Optimal network design amounts to joint optimization of users' allocated power levels and cell's maximum aggregated downlink transmitted power, i.e., coverage area management. This problem is inherently difficult because it is in fact a non-convex optimization problem. A novel approach to address the latter is performed that entails a suitable transformation, which allows the use of convex optimization and also forms the basis for the design of a distributed PCC algorithm via performing two-level primal-dual decomposition. PCC algorithm's convergence to optimality is established. We demonstrate that for realistic macrocell/femtocell deployment scenarios, overall system throughput increase up to approximately 50% can be achieved while guaranteeing 70% of power savings.

show abstract

Base station assignment and power control algorithms for data users in a wireless multiaccess framework

Cited by 17 publications

References 16 publications

A Cost-Based Approach for Base Station Assignment in Mobile Networks with Limited Backhaul Capacity

A Cost-Based Approach for Base Station Assignment in Mobile Networks with Limited Backhaul Capacity

Exploring social networks for optimized user association in wireless small cell networks with device-to-device communications

Optimal power control and coverage management in two-tier femtocell networks

Contact Info

Product

Resources

About