scholarly journals Optimize the Communication Cost of 5G Internet of Vehicles through Coherent Beamforming Technology

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Lan Wu ◽  
Juan Xu ◽  
Lei Shi ◽  
Yi Shi ◽  
Wenwen Zhou
Keyword(s):  
Network Performance ◽  
Optimal Solution ◽  
Base Station ◽  
Base Stations ◽  
Bandwidth Efficiency ◽  
Long Distance ◽  
Internet Of Vehicles ◽  
The Cost ◽  
The Mathematical Model ◽  
Approximate Optimal Solution

Edge computing, which sinks a large number of complex calculations into edge servers, can effectively meet the requirement of low latency and bandwidth efficiency and can be conducive to the development of the Internet of Vehicles (IoV). However, a large number of edge servers mean a big cost, especially for the 5G scenario in IoV, because of the small coverage of 5G base stations. Fortunately, coherent beamforming (CB) technology enables fast and long-distance transmission, which gives us a possibility to reduce the number of 5G base stations without losing the whole network performance. In this paper, we try to adopt the CB technology on the IoV 5G scenario. We suppose we can arrange roadside nodes for helping transferring tasks of vehicles to the base station based on the CB technology. We first give the mathematical model and prove that it is a NP-hard model that cannot be solved directly. Therefore, we design a heuristic algorithm for an Iterative Coherent Beamforming Node Design (ICBND) algorithm to obtain the approximate optimal solution. Simulation results show that this algorithm can greatly reduce the cost of communication network infrastructure.

scholarly journals Proactive Uplink Interference Mitigation in HetNets Stressed by Uniformly Distributed Wideband Jammers

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1496
Author(s):  
Ziaul Haq Abbas ◽  
Ghulam Abbas ◽  
Muhammad Sajid Haroon ◽  
Fazal Muhammad ◽  
Sunghwan Kim
Keyword(s):  
Network Performance ◽  
Interference Mitigation ◽  
Denial Of Service ◽  
Base Station ◽  
Base Stations ◽  
Jamming Attacks ◽  
Transmit Power ◽  
Resource Allocation Scheme ◽  
Inter Cell Interference ◽  
The Cost

In heterogeneous cellular networks (HetNets), densification of small base stations (SBSs) in the macro base station (MBS) coverage region leads to improved network coverage and capacity. However, this improvement is at the cost of inter-cell interference (ICI) due to the high MBS transmit power. The situation deteriorates further when uniformly deployed wideband jammers (WBJs) to initiate distributed denial-of-service (DDoS) attacks are present. With sufficient knowledge about the network parameters, WBJs produce substantial jammer interference (JI) by transmitting unwanted energy in the legitimate band. Such jamming attacks can cause significant JI in the UL communications of MBS edge users (M-EUs) due to i) low uplink (UL) transmit power of user equipment (UE) and ii) longer distances of M-EUs. As a result of ICI and JI, M-EUs are severely affected and go off the coverage due to a low received signal-to-interference ratio (SIR). Hence, to mitigate both ICI and JI, we use a proactive resource allocation scheme known as reverse frequency allocation (RFA). The results indicate that although ICI and JI significantly degrade network performance, RFA employment leads to improved SIR due to effective ICI and JI mitigation.

scholarly journals Performance Analysis of Backhaul-Aware User Association in 5G Ultradense Heterogeneous Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Junpeng Yu ◽  
Hongtao Zhang ◽  
Yuqing Chen ◽  
Yaduan Ruan
Keyword(s):  
Heterogeneous Networks ◽  
Association Scheme ◽  
Coverage Probability ◽  
Network Performance ◽  
Performance Metrics ◽  
Density Ratio ◽  
Base Station ◽  
Base Stations ◽  
User Association ◽  
The Impact

In 5G ultradense heterogeneous networks, wireless backhaul, as one of the important base station (BS) resources that affect user services, has attracted more and more attention. However, a user would access to the BS which is the nearest for the user based on the conventional user association scheme, which constrains the network performance improvement due to the limited backhaul capacity. In this paper, using backhaul-aware user association scheme, semiclosed expressions of network performance metrics are derived in ultradense heterogeneous networks, including coverage probability, rate coverage, and network delay. Specifically, all possible access and backhaul links within the user connectable range of BSs and anchor base stations (A-BSs) are considered to minimize the analytical results of outage probability. The outage for the user occurs only when the access link or backhaul link which forms the link combination with the optimal performance is failure. Furthermore, the theoretical analysis and numerical results evaluate the impact of the fraction of A-BSs and the BS-to-user density ratio on network performance metric to seek for a more reasonable deployment of BSs in the practical scenario. The simulation results show that the coverage probability of backhaul-aware user association scheme is improved significantly by about 2× compared to that of the conventional user association scheme when backhaul is constrained.

Cell Planning for Base Station in Mobile Communication Using an Improved Genetic Algorithm

2013 ◽  
Vol 284-287 ◽  
pp. 2699-2703 ◽  
Author(s):  
Hung Jen Liao ◽  
Chun Hung Richard Lin ◽  
Kuang Yuan Tung ◽  
Ying Chih Lin ◽  
Cheng Fa Tsai ◽  
...  
Keyword(s):  
Communication Networks ◽  
Mobile Communication ◽  
Mobile Networks ◽  
Base Station ◽  
Base Stations ◽  
Planning Problem ◽  
Improved Genetic Algorithm ◽  
Cell Planning ◽  
Planning Methods ◽  
The Cost

Cell planning problem is one of the most important issues in mobile communication networks. To tackle the problem, one should address the location management issue because it significantly affects the cost of cell planning in mobile networks. The partition of location areas is developed to minimize the total costs of considering user location and search operation simultaneously in cellular networks, which has been shown to be NP-complete and is commonly solved by metaheuristics in previous works. In this paper, we propose novel cell planning methods for base stations using genetic algorithms with initialization, local search, and particular mechanisms of area and cell crossovers. Several simulations are conducted on various cell networks with previous, random and real configurations. The simulation results reveal that our schemes are superior to the considered algorithms.

scholarly journals MCRA: Multicost Rerouting Algorithm in SDN

2020 ◽  
Vol 24 (6) ◽  
pp. 728-737
Author(s):  
Kuangyu Qin ◽  
Bin Fu ◽  
Peng Chen ◽  
Jianhua Huang ◽  
◽  
...  
Keyword(s):  
Polynomial Time ◽  
Network Performance ◽  
Optimal Solution ◽  
Software Defined Network ◽  
Centralized Control ◽  
Time Simulation ◽  
Data Plane ◽  
Simulation Results ◽  
Approximate Optimal Solution ◽  
Main Factor

A software-defined network (SDN) partitions a network into a control plane and data plane. Utilizing centralized control, an SDN can accurately control the routing of data flow. In the network, links have various costs, such as bandwidth, delay, and hops. However, it is difficult to obtain a multicost optimization path. If online rerouting can be realized under multiple cost, then network performance can be improved. This paper proposes a multicost rerouting algorithm for elephant flow, as the latter is the main factor affecting network traffic. By performing path trimming, the algorithm can obtain the approximate optimal solution of (1+e) in polynomial time. Simulation results show that the proposed algorithm yields good performance.

scholarly journals Transmit and Receive Antenna Selection Based Resource Allocation for Self-Backhaul 5G Massive MIMO HetNets

2021 ◽  
Author(s):  
Farah Akif ◽  
Aqdas Malik ◽  
Ijaz Qureshi ◽  
Ayesha Abassi
Keyword(s):  
Network Performance ◽  
Service Providers ◽  
Antenna Selection ◽  
Multiple Input Multiple Output ◽  
Base Station ◽  
Base Stations ◽  
Small Cells ◽  
User Association ◽  
Transmit Antenna Selection ◽  
Coverage Area

With the advancement in wireless communication technology, the ease of accessibility and increasing coverage area is a major challenge for service providers. Network densification through Small cell Base Stations (SBS) integration in Heterogeneous Networks (HetNets) promises to improve network performance for cell edge users. Since providing wired backhaul for small cells is not cost effective or practical, the third-Generation Partnership Project (3GPP) has developed architecture for self-backhaul known as Integrated Access and Backhaul (IAB) for Fifth Generation (5G). This allows for Main Base Station (MBS) resources to be shared between SBS and MBS users. However, fair and efficient division of MBS resources remains a problem to be addressed. We develop a novel transmit antenna selection/partitioning technique for taking advantage of IAB 5G standard for Massive Multiple Input Multiple Output (MIMO) HetNets. Transmit antenna resources are divided among access for MBS users and for providing wireless backhaul for SBS. We develop A Genetic Algorithm (GA) based Transmit Antenna Selection (TAS) scheme and compare with random selection, eigenvalue-based selection and bandwidth portioning. Our analysis show that GA based TAS has the ability to converge to an optimum antenna subset providing better rate coverage. Furthermore, we also signify the performance of TAS based partitioning over bandwidth partitioning and also show user association can also be controlled using number of antennas reserved for access or backhaul.

scholarly journals New framework for interference and energy analysis of soft frequency reuse in 5G networks

2020 ◽  
Vol 9 (5) ◽  
pp. 1941-1949
Author(s):  
Achonu Adejo ◽  
Osbert Asaka ◽  
Habeeb Bello- Salau ◽  
Caroline Alenoghena
Keyword(s):  
Cellular Networks ◽  
Spectral Efficiency ◽  
Network Performance ◽  
Base Station ◽  
Frequency Reuse ◽  
Base Stations ◽  
System Capacity ◽  
Management Technique ◽  
5G Networks ◽  
Soft Frequency Reuse

Cellular networks are expanding massively due to high data requirements from mobile devices. This has motivated base station densification as an essential requirement for the 5G network. The implication is obvious benefits in enhanced system capacity, but also increased challenges in terms of interference. One important interference management technique which has been widely adopted in cellular networks is frequency reuse. In this article, an analysis is presented based on network interference and energy expended by base stations in downlink communication when Soft frequency reuse (SFR) is deployed. A framework is presented that captures the bandwidth overlaps in SFR across base station assignments, computes the interference probabilities arising and derives new performance equations which are verified using simulations. Results show an improvement of over previous SFR implementations that do not consider the interference probabilities. Thus, a more in-depth and accurate modelling of SFR in 5G networks is achieved. Furthermore, the downlink power allocation is investigated as against other parameters like the center ratio and edge bandwidth. The result shows that signal-to-interference-noise ratio (SINR) and spectral efficiency give different performance under energy consideration. A framework is developed on how to tune a base station to achieve desired network performance in user SINR or cell spectral efficiency depending on the operator’s preference.

Cutting Path Optimization of Pattern Pieces in Garment Automatic Cutter

2010 ◽  
Vol 129-131 ◽  
pp. 973-977
Author(s):  
Ying Lin Li ◽  
Man Liang Qiu ◽  
Lian He Yang
Keyword(s):  
Optimal Solution ◽  
Optimization Method ◽  
Path Optimization ◽  
Cutting Process ◽  
Cutting Efficiency ◽  
Automatic Optimization ◽  
2D Pattern ◽  
The Cost ◽  
Cutting Path ◽  
Approximate Optimal Solution

In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new optimization method of computer is explored. If there is no cutting path optimization implemented by garment automatic cutter before cutting, some problems will be caused, such as too much unless travel and too long processing time. At present, both at home and abroad, the studies on automatic optimization in cutting preprocessing are relatively weak. According to the “segment cutting from left to right” feature of automatic cutter in cutting process, an algorithm which can be summarized as “segment and reducing point” was proposed. This algorithm combined with the solution of shortest path problem, its purpose is to seek for the approximate optimal solution of cutting path. The algorithm implemented through Visual C++ 6.0 programming. Used in production by enterprise shows that the program is simple to operate, and has a high compute speed. Averagely, unless travel in cutting process reduced more than 10%. It proves that the algorithm is feasible and efficient. Using this algorithm achieved the purpose of reducing unless travel, improving cutting efficiency and lowering the cost.

scholarly journals Energy and Spectral Efficiency Balancing Algorithm for Energy Saving in LTE Downlinks

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 211
Author(s):  
Mamman Maharazu ◽  
Zurina Mohd Hanapi ◽  
Mohamed A. Alrashah
Keyword(s):  
Energy Consumption ◽  
Spectral Efficiency ◽  
Network Performance ◽  
Optimal Solution ◽  
Base Station ◽  
Directional Antenna ◽  
Battery Life ◽  
Spatial Reuse ◽  
Average Delay ◽  
Trade Off

In wireless network communication environments, Spectral Efficiency (SE) and Energy Efficiency (EE) are among the major indicators used for evaluating network performance. However, given the high demand for data rate services and the exponential growth of energy consumption, SE and EE continue to elicit increasing attention in academia and industries. Consequently, a study of the trade-off between these metrics is imperative. In contrast with existing works, this study proposes an efficient SE and EE trade-off algorithm for saving energy in downlink Long Term Evolution (LTE) networks to concurrently optimize SE and EE while considering battery life at the Base Station (BS). The scheme is formulated as a Multi-objective Optimization Problem (MOP) and its Pareto optimal solution is examined. In contrast with other algorithms that prolong battery life by considering the idle state of a BS, thereby increasing average delay and energy consumption, the proposed algorithm prolongs battery life by adjusting the initial and final states of a BS to minimize the average delay and the energy consumption. Similarly, the use of an omni-directional antenna to spread radio signals to the user equipment in all directions causes high interference and low spatial reuse. We propose using a directional antenna instead of an omni-directional antenna by transmitting signals in one direction which results in no or low interference and high spatial reuse. The proposed scheme has been extensively evaluated through simulation, where simulation results prove that the proposed scheme is efficiently able to decrease the average response delay, improve SE, and minimize energy consumption.

scholarly journals Optimal Base Station Network Based on Topological Data Analysis

2022 ◽  
pp. 8-14
Author(s):  
Minhao Lyu
Keyword(s):  
Data Analysis ◽  
Base Station ◽  
Base Stations ◽  
Topological Data Analysis ◽  
Original Network ◽  
Station Network ◽  
Analysis Methods ◽  
The Cost ◽  
Data Analysis Methods ◽  
Topological Data

The decision of which base stations need to be removed due to the cost is always a difficult problem, because the influence on the cover rate of the network caused by the removal should be kept to a minimum. However, the common methods to solve this problem such as K-means Clustering show a low accuracy. Barcode, which belongs to TDA, has the possibility to show the result by identifying the Persistent Homology of base station network. This essay mainly illustrates the specific problem of optimal base station network, which applies the TDA(Topological Data Analysis) methods to find which base stations need removing due to the cost K-means Clustering and Topological Data Analysis methods were mainly used. With the simulated distribution of telecommunication users, K-means Clustering algorithm was used to locate 30 best base stations. By comparing the minimum distance between the results (K=25 and K=30), K-means Clustering was used again to decide base station points to be removed. Then TDA was used to select which 5 base stations should be removed through observing barcode. By repeating above steps five times, Finally the average and variance of cover area in original network, K-means Clustering and TDA were compared. The experiment showed that the average cover rate of original network was 81.20% while the result of TDA and K-means Clustering were 92.13% and 89.87%. It was proved by simulation that it is more efficient to use TDA methods to construct the optimal base station network.

scholarly journals Effect of Backhaul Technologies on 3G Network Performance: A Case Study of Ado-Ekiti

2021 ◽  
Vol 5 (3) ◽  
pp. 23-31
Author(s):  
S. T. Ayoola ◽  
Y. O. Olasoji ◽  
K. B. Adedeji ◽  
C. G. Olebu ◽  
S. A. Busari ◽  
...  
Keyword(s):  
Packet Loss ◽  
Network Performance ◽  
Asynchronous Transfer Mode ◽  
Access Network ◽  
Base Station ◽  
Base Stations ◽  
Third Generation ◽  
Maximum Throughput ◽  
3G Network ◽  
Average Maximum

In the past years, when wireless network improvement occurs from 1G/2G to third generation (3G), the rate in the use of real-time traffic oriented applications for voice, video and data increases. Consequently, the bandwidth to be backhauled from the cell site to the mobile switching center increases rapidly. 3G network is most prevalent in Nigeria with wide area of coverage. However, in recent times, poor subscribers’ mobile broadband experience is still the major challenge faced by many GSM operators. One of the major causes of this challenge is the use of wrong backhaul for radio access network (RAN). This lead to poor traffic throughput, high packet loss or frame loss at the cell edge. To overcome this challenge, the use of appropriate backhaul technology is crucial. Third Generation Partnership Program (3GPP) recommends the use of either asynchronous transfer mode (ATM) or internet protocol (IP) as the backhaul technologies for its RAN. This paper presents the performance analysis and the comparison of the ATM RAN and IP RAN backhaul technologies using six different 3G sites (with 3G base stations) located at Ado local government area of Ekiti State, Nigeria. The performance of each base station with different backhaul technology was evaluated in term of average maximum throughput per day. The effect of frame loss (for ATM RAN network) and packet loss (for IP RAN network) on traffic throughput were also analyzed. The comparison of the overall result analysis shows that the 3G base stations with IP-based RAN backhaul has better performance than the base station with ATM-based RAN backhaul.

Sign in / Sign up

Export Citation Format

Share Document