• Title/Summary/Keyword: Dense Femtocell

Search Result 5, Processing Time 0.021 seconds

Adaptive Power Control Schemes for Interference Mitigation in LTE Femtocell Networks (LTE 기반 펨토셀 네트워크에서 간섭 완화를 위한 적응적 전력 제어 기법)

  • Lee, Sang-Joon;Kim, Seung-Yeon;Lee, Hyong-Woo;Ryu, Seung-Wan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8A
    • /
    • pp.648-660
    • /
    • 2012
  • The low-power, low-cost femtocell network has been proposed not only to alleviate traffic load to the macro base station (eNB) but also to cover the indoor coverage hole problem. However, in the dense femtocell environment where many femtocells are deployed to cover the whole large office building, performance of such femtocell environment can be deteriorated due to severe co-channel interference problem between the eNB and femtocells and among neighboring femtocells. In particular, a macro UE(mUE) located within femtocell coverage may experience severe co-channel interference from surrounding femtocells. Therefore, In this paper, we propose a novel power control schemes to mitigate interference to a mUE under such dense LTE femtocell environment. With proposed femtocell power control schemes, performance of the mUE can be greatly improved in terms of the outage probability and the SINR while maintaining satisfying femtocell performance. Simulation based performance study shows that the proposed power control scheme is able to enhance mUE performance more than 30% than the conventional dense femtocell in terms of the two performance metrics.

Multi-Cluster based Dynamic Channel Assignment for Dense Femtocell Networks

  • Kim, Se-Jin;Cho, IlKwon;Lee, ByungBog;Bae, Sang-Hyun;Cho, Choong-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1535-1554
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

Discrete bacterial foraging optimization for resource allocation in macrocell-femtocell networks

  • Lalin, Heng;Mustika, I Wayan;Setiawan, Noor Akhmad
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.726-735
    • /
    • 2018
  • Femtocells are good examples of the ultimate networking technology, offering enhanced indoor coverage and higher data rate. However, the dense deployment of femto base stations (FBSs) and the exploitation of subcarrier reuse between macrocell base stations and FBSs result in significant co-tier and cross-tier interference, thus degrading system performance. Therefore, appropriate resource allocations are required to mitigate the interference. This paper proposes a discrete bacterial foraging optimization (DBFO) algorithm to find the optimal resource allocation in two-tier networks. The simulation results showed that DBFO outperforms the random-resource allocation and discrete particle swarm optimization (DPSO) considering the small number of steps taken by particles and bacteria.

Analysis of Energy-Efficiency in Ultra-Dense Networks: Determining FAP-to-UE Ratio via Stochastic Geometry

  • Zhang, HongTao;Yang, ZiHua;Ye, Yunfan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5400-5418
    • /
    • 2016
  • Femtocells are envisioned as a key solution to embrace the ever-increasing high data rate and thus are extensively deployed. However, the dense and random deployments of femtocell access points (FAPs) induce severe intercell inference that in turn may degrade the performance of spectral efficiency. Hence, unrestrained proliferation of FAPs may not acquire a net throughput gain. Besides, given that numerous FAPs deployed in ultra-dense networks (UDNs) lead to significant energy consumption, the amount of FAPs deployed is worthy of more considerations. Nevertheless, little existing works present an analytical result regarding the optimal FAP density for a given User Equipment (UE) density. This paper explores the realistic scenario of randomly distributed FAPs in UDN and derives the coverage probability via Stochastic Geometry. From the analytical results, coverage probability is strictly increasing as the FAP-to-UE ratio increases, yet the growing rate of coverage probability decreases as the ratio grows. Therefore, we can consider a specific FAP-to-UE ratio as the point where further increasing the ratio is not cost-effective with regards to the requirements of communication systems. To reach the optimal FAP density, we can deploy FAPs in line with peak traffic and randomly switch off FAPs to keep the optimal ratio during off-peak hours. Furthermore, considering the unbalanced nature of traffic demands in the temporal and spatial domain, dynamically and carefully choosing the locations of active FAPs would provide advantages over randomization. Besides, with a huge FAP density in UDN, we have more potential choices for the locations of active FAPs and this adds to the demand for a strategic sleeping policy.

A Physical-layer Security Scheme Based on Cross-layer Cooperation in Dense Heterogeneous Networks

  • Zhang, Bo;Huang, Kai-zhi;Chen, Ya-jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2595-2618
    • /
    • 2018
  • In this paper, we investigate secure communication with the presence of multiple eavesdroppers (Eves) in a two-tier downlink dense heterogeneous network, wherein there is a macrocell base station (MBS) and multiple femtocell base stations (FBSs). Each base station (BS) has multiple users. And Eves attempt to wiretap a macrocell user (MU). To keep Eves ignorant of the confidential message, we propose a physical-layer security scheme based on cross-layer cooperation to exploit interference in the considered network. Under the constraints on the quality of service (QoS) of other legitimate users and transmit power, the secrecy rate of system can be maximized through jointly optimizing the beamforming vectors of MBS and cooperative FBSs. We explore the problem of maximizing secrecy rate in both non-colluding and colluding Eves scenarios, respectively. Firstly, in non-colluding Eves scenario, we approximate the original non-convex problem into a few semi-definite programs (SDPs) by employing the semi-definite relaxation (SDR) technique and conservative convex approximation under perfect channel state information (CSI) case. Furthermore, we extend the frame to imperfect CSI case and use the Lagrangian dual theory to cope with uncertain constraints on CSI. Secondly, in colluding Eves scenario, we transform the original problem into a two-tier optimization problem equivalently. Among them, the outer layer problem is a single variable optimization problem and can be solved by one-dimensional linear search. While the inner-layer optimization problem is transformed into a convex SDP problem with SDR technique and Charnes-Cooper transformation. In the perfect CSI case of both non-colluding and colluding Eves scenarios, we prove that the relaxation of SDR is tight and analyze the complexity of proposed algorithms. Finally, simulation results validate the effectiveness and robustness of proposed scheme.