• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.3
• /
• pp.192-199
• /
• 2015

Heterogeneous cellular networks are gaining momentum in industry and the research community, and are attracting the attention of standard bodies such as 3GPP LTE and IEEE 802.16j, whose objectives are to increase the capacity and coverage of cellular networks. In this article, we provide an overview of expansion strategies, optimal locations of base stations with different characteristics, and radio-planning models.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.661-663
• /
• 2021

Network performance is degraded when the UE is disconnected because the outage occurs at the base station in a mobile communication system. Therefore it is important to detect and recover the outage. In this paper, detecting the outage base station by using the KPI and the network scanning in the neighbor base station, and increasing the transmit power and changing the frequency band to recovery the outage scheme is proposed. The proposed scheme uses not only the KPI of the base station but also the network scanning of the neighbor base stations to detect the outage base station, so that it is possible to detect the outage base station more accurately. In addition, when the outage occurred, the neighbor base station changes the transmit power and frequency band to recover the outage with less signal interference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.485-492
• /
• 2003

This paper proposes a transmission probability control scheme for guaranteeing fair packet transmissions in CDMA slotted ALOHA system. In CDMA slotted ALOHA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are caused entirely by multiple access interference. Therefore, in order to maximize the system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability of mobile stations in the next slot according to the offered load and then broadcasts this probability to all the mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and average delay than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• Journal of electromagnetic engineering and science
• /
• v.18 no.4
• /
• pp.242-247
• /
• 2018

This paper studies a convenient electromagnetic field (EMF) compliance assessment for base station installations at a millimeter wave (mmW) frequency. We utilize ray-tracing analysis as a numerical method for examining the wave propagation characteristic. Various installation cases are considered and the important parameters with a significant effect on the maximum power density levels are produced. We finally suggest the several scenarios for the convenient assessment of mmW base stations, which allow us to conduct cost effective computational tests compared with the current assessment procedure in the guideline.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• ETRI Journal
• /
• v.19 no.3
• /
• pp.116-140
• /
• 1997

The base station transceiver subsystem (BTS) of the CDMA Mobile System is interfaced to mobile stations over the air and to the wired network through a packet switched interconnection network. The potential benefits of CDMA technology are achieved when the transmitter and the receiver are properly designed and implemented. The physical layer of the interface at the base station is implemented with the CDMA ASICs and control circuits in channel card of the BTS. We present the design perspectives and structural illustration of the BTS. Base station modem ASICs and their control to implement the CDMA receiver, Baseband and RF signal processing blocks, and BTS controller are described. Elaborate power control is essential to ensure the high capacity which is one of advantages of the CDMA technology. The closed loop reverse link power control and the forward link power control operated in the BTS are described.

• Journal of Information Technology Services
• /
• v.9 no.2
• /
• pp.163-177
• /
• 2010

In this paper, we consider a channel ordering problem that seeks to maximize the service quality in mobile radio communication systems. If a base station receives a connection request from a mobile user, one of the empty channels belonging to the base station is assigned to the mobile user. In case multiple empty channels are available, we can choose one that incurs least interference with other channels assigned to adjacent base stations. However, note that a pair of channels that are not separated enough generates interference only if both channels are assigned to mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference cost are properly generated.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.379-391
• /
• 2024

To meet increasing traffic requirements in mobile networks, small base stations (SBSs) are densely deployed, overlapping existing network architecture and increasing system capacity. However, densely deployed SBSs increase energy consumption and interference. Although these problems already exist because of densely deployed SBSs, even more SBSs are needed to meet increasing traffic demands. Hence, base station (BS) switching operations have been used to minimize energy consumption while guaranteeing quality-of-service (QoS) for users. In this study, to optimize energy efficiency, we propose the use of deep reinforcement learning (DRL) to create a BS switching operation strategy with a traffic prediction model. First, a federated long short-term memory (LSTM) model is introduced to predict user traffic demands from user trajectory information. Next, the DRL-based BS switching operation scheme determines the switching operations for the SBSs using the predicted traffic demand. Experimental results confirm that the proposed scheme outperforms existing approaches in terms of energy efficiency, signal-to-interference noise ratio, handover metrics, and prediction performance.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.854-859
• /
• 2017

Caching popular videos in the storage of base stations is an efficient method to reduce the transmission latency. This paper proposes an incentive proactive cache mechanism in the wireless network to motivate the content providers (CPs) to participate in the caching procedure. The system consists of one/many Infrastructure Provider (InP) and many CPs. The InP aims to define the price it charges the CPs to maximize its revenue while the CPs compete to determine the number of files they cache at the InP's base stations (BSs). We conceive this system within the framework of Stackelberg game where InP is considered as the leader and CPs are the followers. By using backward induction, we show closed form of the amount of cache space that each CP renting on each base station and then solve the optimization problem to calculate the price that InP leases each CP. This is different from the existing works in that we consider the non-uniform pricing scheme. The numerical results show that InP's profit in the proposed scheme is higher than in the uniform pricing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1163-1168
• /
• 1999

This paper proposes a wireless positioning method using the CDMA mobile communicaton network. The proposed method is time-based positioning method that uses mobile-station arrival time of forward link signal from base-stations. In this mehtod there are TDOA and TOA methods that use time-difference-of-arrival and time-of-arrival, respectively. Error characteristics and implementation simplicity of the two methods are compared and analyzed each other. As a results, it showed that TDOA has advantage of less sensitivity to the time error compared to TOA but has disadantage of more sensitivity to the spatial error. Also, from architecture of the CDMA system that is time synchronized to only active base-station it is analyzed that adoption of TDOA method is more advantageous than TOA because time difference of signal arrival from the neighbor base-stations against the active base-station can be measured more easily. Therefore, conclusion is made that TDOA is beat suit to the time-based positioning method for the present CDMA mobile communication networkgorithm performs block-by-block coherent decoding with the aid of pilot symbols. It is shown that the complexity of the algorithm grows linearly as a function of sequence length. The performance of the algorithm is shown to better than that of the conventional pilot symbol aided (PSI) algorithm. Simulation results are presented to assess the performance of the algorithm and the results are compared with that of the conventional PSI alforithm.