• 제목/요약/키워드: Ultra-dense network

검색결과 25건 처리시간 0.028초

Load Balancing Algorithm of Ultra-Dense Networks: a Stochastic Differential Game based Scheme

  • Xu, Haitao;He, Zhen;Zhou, Xianwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권7호
    • /
    • pp.2454-2467
    • /
    • 2015
  • Increasing traffic and bandwidth requirements bring challenges to the next generation wireless networks (5G). As one of the main technology in 5G networks, Ultra-Dense Network (UDN) can be used to improve network coverage. In this paper, a radio over fiber based model is proposed to solve the load balancing problem in ultra-dense network. Stochastic differential game is introduced for the load balancing algorithm, and optimal load allocated to each access point (RAP) are formulated as Nash Equilibrium. It is proved that the optimal load can be achieved and the stochastic differential game based scheme is applicable and acceptable. Numerical results are given to prove the effectiveness of the optimal algorithm.

Data-Driven-Based Beam Selection for Hybrid Beamforming in Ultra-Dense Networks

  • Ju, Sang-Lim;Kim, Kyung-Seok
    • International journal of advanced smart convergence
    • /
    • 제9권2호
    • /
    • pp.58-67
    • /
    • 2020
  • In this paper, we propose a data-driven-based beam selection scheme for massive multiple-input and multiple-output (MIMO) systems in ultra-dense networks (UDN), which is capable of addressing the problem of high computational cost of conventional coordinated beamforming approaches. We consider highly dense small-cell scenarios with more small cells than mobile stations, in the millimetre-wave band. The analog beam selection for hybrid beamforming is a key issue in realizing millimetre-wave UDN MIMO systems. To reduce the computation complexity for the analog beam selection, in this paper, two deep neural network models are used. The channel samples, channel gains, and radio frequency beamforming vectors between the access points and mobile stations are collected at the central/cloud unit that is connected to all the small-cell access points, and are used to train the networks. The proposed machine-learning-based scheme provides an approach for the effective implementation of massive MIMO system in UDN environment.

DANCE : 초고밀도 통신망에서의 소형기지국 온-오프 알고리즘 (DANCE : Small AP On/Off Algorithms in Ultra Dense Wireless Network)

  • 이길수;김홍석;김영태;김병훈
    • 한국통신학회논문지
    • /
    • 제38A권12호
    • /
    • pp.1135-1144
    • /
    • 2013
  • 급증하는 데이터 트래픽을 셀룰러 망에서 처리하기 위한 대안으로 스몰셀이 관심을 받고 있다. 나아가, 스몰셀의 배치밀도는 점차 높아지고 있어 Ultra Dense Network (UDN) 환경이 도래할 것으로 예상된다. 따라서 본 논문에서는 UDN환경에서 소형기지국의 온/오프를 제어하기 위한 방법을 연구한다. 본 논문에서는 소형 Access Point(AP), user equipment (UE), Small Cell Controller (SCC)로 구성된 프레임워크를 제안하고 이를 기반으로 켜져 있는 기지국 수는 최소화 하며, 네트워크 쓰루풋을 유지시키기 위한 소형기지국 온/오프 방법으로 UE와 같은 사용자 디바이스가 SCC로 피드백하는 채널정보를 활용하는 DANCE 알고리즘을 제안한다. DANCE 알고리즘은 피드백이 1-bit인 경우와 N-bit인 경우, 그리고 활성화시키는 소형AP를 선택하는 기준에 따른 AP-first, UE-first, Proximity ON 등으로 세분화할 수 있다. 본 연구에서는 시뮬레이션을 통해 UE의 수와 네트워크의 쓰루풋, 에너지 효율의 관계를 분석한 후, DANCE 알고리즘을 통해 에너지 효율을 높일 수 있음을 보인다.

Fast Channel Allocation for Ultra-dense D2D-enabled Cellular Network with Interference Constraint in Underlaying Mode

  • Dun, Hui;Ye, Fang;Jiao, Shuhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2240-2254
    • /
    • 2021
  • We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

A Novel Service Migration Method Based on Content Caching and Network Condition Awareness in Ultra-Dense Networks

  • Zhou, Chenjun;Zhu, Xiaorong;Zhu, Hongbo;Zhao, Su
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권6호
    • /
    • pp.2680-2696
    • /
    • 2018
  • The collaborative content caching system is an effective solution developed in recent years to reduce transmission delay and network traffic. In order to decrease the service end-to-end transmission delay for future 5G ultra-dense networks (UDN), this paper proposes a novel service migration method that can guarantee the continuity of service and simultaneously reduce the traffic flow in the network. In this paper, we propose a service migration optimization model that minimizes the cumulative transmission delay within the constraints of quality of service (QoS) guarantee and network condition. Subsequently, we propose an improved firefly algorithm to solve this optimization problem. Simulation results show that compared to traditional collaborative content caching schemes, the proposed algorithm can significantly decrease transmission delay and network traffic flow.

SDN-Based Hierarchical Agglomerative Clustering Algorithm for Interference Mitigation in Ultra-Dense Small Cell Networks

  • Yang, Guang;Cao, Yewen;Esmailpour, Amir;Wang, Deqiang
    • ETRI Journal
    • /
    • 제40권2호
    • /
    • pp.227-236
    • /
    • 2018
  • Ultra-dense small cell networks (UD-SCNs) have been identified as a promising scheme for next-generation wireless networks capable of meeting the ever-increasing demand for higher transmission rates and better quality of service. However, UD-SCNs will inevitably suffer from severe interference among the small cell base stations, which will lower their spectral efficiency. In this paper, we propose a software-defined networking (SDN)-based hierarchical agglomerative clustering (SDN-HAC) framework, which leverages SDN to centrally control all sub-channels in the network, and decides on cluster merging using a similarity criterion based on a suitability function. We evaluate the proposed algorithm through simulation. The obtained results show that the proposed algorithm performs well and improves system payoff by 18.19% and 436.34% when compared with the traditional network architecture algorithms and non-cooperative scenarios, respectively.

Ultra-Dense WDM PON with 12.5-GHz Spaced 256 Channels

  • Yim, Jae-Nam;Hwang, Gyo-Sun;Lee, Jae-Seung;Seo, Kyung-Hee;Lee, Hyun-Jae;Ko, Je-Soo
    • Journal of the Optical Society of Korea
    • /
    • 제12권4호
    • /
    • pp.351-354
    • /
    • 2008
  • We demonstrate an ultra-dense wavelength-division- multiplexed (UD-WDM) passive optical network (PON) where 12.5-GHz spaced 1 GbE ${\times}$ 256 optical channels are distributed using 12.5- and 200-GHz arrayed waveguide gratings in series. For the generation of upstream signals, we use reflective semiconductor optical amplifiers. We use two optical fiber amplifiers at the optical line terminal to amplify downstream and upstream channels.

Energy Efficient Cell Management by Flow Scheduling in Ultra Dense Networks

  • Sun, Guolin;Addo, Prince Clement;Wang, Guohui;Liu, Guisong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4108-4122
    • /
    • 2016
  • To address challenges of an unprecedented growth in mobile data traffic, the ultra-dense network deployment is a cost efficient solution to off-load the traffic over other small cells. However, the real traffic is often much lower than the peak-hour traffic and certain small cells are superfluous, which will not only introduce extra energy consumption, but also impose extra interference onto the radio environment. In this paper, an elastic energy efficient cell management scheme is proposed based on flow scheduling among multi-layer ultra-dense cells by a SDN controller. A significant power saving was achieved by a cell-level energy manager. The scheme is elastic for energy saving, adaptive to the dynamic traffic distribution in the office or campus environment. In the end, the performance is evaluated and demonstrated. The results show substantial improvements over the conventional method in terms of the number of active BSs, the handover times, and the switches of BSs.

초고밀도 네트워크에서 상향링크 성능향상을 위한 유동적 채널할당 연구 (A Study on Dynamic Channel Assignment to Increase Uplink Performance in Ultra Dense Networks)

  • 김세진
    • 인터넷정보학회논문지
    • /
    • 제23권5호
    • /
    • pp.25-31
    • /
    • 2022
  • 초고밀도 네트워크(Ultra dense network, UDN)는 5G 이동통신 시스템에서 많은 수의 스몰셀 기지국(Small-cell access point, SAP)이 매크로셀의 서비스 영역에 배치되기 때문에 매크로 단말(Macro user equipment, MUE)이 수신하는 간섭량이 증가하여 시스템 용량이 크게 감소한다. 따라서, 본 논문은 UDN에서 SAP의 수가 증가하여도 MUE의 성능을 보장하기 위한 상향링크 유동적 채널할당 방법을 제안한다. 제안하는 유동적 채널할당 방법은 간섭량이 높은 MUE와 동일한 부채널을 사용하지 않도록 SAP들이 사용하는 부채널을 제어하여 MUE의 신호 대 간섭 잡음비(Signal to interference and noise ratio)를 주어진 임계값 이상으로 보장하는 것을 목표한다. 시뮬레이션을 통해 제안하는 유동적 채널할당 방법이 다른 방법들과 비교해 스몰셀 사용자 단말의 성능은 크게 감소되지 않으면서 MUE의 평균 전송 용량이 향상됨을 보인다.

Indoor 3D Dynamic Reconstruction Fingerprint Matching Algorithm in 5G Ultra-Dense Network

  • Zhang, Yuexia;Jin, Jiacheng;Liu, Chong;Jia, Pengfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권1호
    • /
    • pp.343-364
    • /
    • 2021
  • In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.