scholarly journals Association Control Based  Load Balancing in Wireless  Cellular Networks Using  Preamble Sequences

2021 ◽  
Author(s):  
◽  
Ankit Chopra

<p>The efficient allocation and use of radio resources is crucial for achieving the maximum possible throughput and capacity in wireless networks. The conventional strongest signal-based user association in cellular networks generally considers only the strength of the signal while selecting a BS, and ignores the level of congestion or load at it. As a consequence, some BSs tend to suffer from heavy load, while their adjacent BSs may carry only light load. This load imbalance severely hampers the network from fully utilizing the network capacity and providing fair services to users. In this thesis, we investigate the applicability of the preamble code sequence, which is mainly used for cell identification, as an implicit information indicator for load balancing in cellular networks. By exploiting the high auto-correlation and low cross-correlation property among preamble sequences, we propose distributed load balancing schemes that implicitly obtain information about the load status of BSs, for intelligent association control. This enables the new users to be attached to BSs with relatively low load in the long term, alleviating the problem of non-uniform user distribution and load imbalance across the network. Extensive simulations are performed with various user densities considering throughput fair and resource fair, as the resource allocation policies in each cell. It is observed that significant improvement in minimum throughput and fair user distribution is achieved by employing our proposed schemes, and preamble sequences can be effectively used as a leverage for better cell-site selection from the viewpoint of fairness provisioning. The load of the entire system is also observed to be balanced, which consequently enhances the capacity of the network, as evidenced by the simulation results.</p>

2021 ◽  
Author(s):  
◽  
Ankit Chopra

<p>The efficient allocation and use of radio resources is crucial for achieving the maximum possible throughput and capacity in wireless networks. The conventional strongest signal-based user association in cellular networks generally considers only the strength of the signal while selecting a BS, and ignores the level of congestion or load at it. As a consequence, some BSs tend to suffer from heavy load, while their adjacent BSs may carry only light load. This load imbalance severely hampers the network from fully utilizing the network capacity and providing fair services to users. In this thesis, we investigate the applicability of the preamble code sequence, which is mainly used for cell identification, as an implicit information indicator for load balancing in cellular networks. By exploiting the high auto-correlation and low cross-correlation property among preamble sequences, we propose distributed load balancing schemes that implicitly obtain information about the load status of BSs, for intelligent association control. This enables the new users to be attached to BSs with relatively low load in the long term, alleviating the problem of non-uniform user distribution and load imbalance across the network. Extensive simulations are performed with various user densities considering throughput fair and resource fair, as the resource allocation policies in each cell. It is observed that significant improvement in minimum throughput and fair user distribution is achieved by employing our proposed schemes, and preamble sequences can be effectively used as a leverage for better cell-site selection from the viewpoint of fairness provisioning. The load of the entire system is also observed to be balanced, which consequently enhances the capacity of the network, as evidenced by the simulation results.</p>


Author(s):  
Guangshun Li ◽  
Yonghui Yao ◽  
Junhua Wu ◽  
Xiaoxiao Liu ◽  
Xiaofei Sheng ◽  
...  

AbstractThe latency of cloud computing is high for the reason that it is far from terminal users. Edge computing can transfer computing from the center to the network edge. However, the problem of load balancing among different edge nodes still needs to be solved. In this paper, we propose a load balancing strategy by task allocation in edge computing based on intermediary nodes. The intermediary node is used to monitor the global information to obtain the real-time attributes of the edge nodes and complete the classification evaluation. First, edge nodes can be classified to three categories (light-load, normal-load, and heavy-load), according to their inherent attributes and real-time attributes. Then, we propose a task assignment model and allocate new tasks to the relatively lightest load node. Experiments show that our method can balance load among edge nodes and reduce the completion time of tasks.


2018 ◽  
Vol 67 (3) ◽  
pp. 2582-2593 ◽  
Author(s):  
Tianqing Zhou ◽  
Zunxiong Liu ◽  
Junhui Zhao ◽  
Chunguo Li ◽  
Luxi Yang

2018 ◽  
Vol 7 (2.22) ◽  
pp. 39 ◽  
Author(s):  
A Sebastian ◽  
S Sivagurunathan ◽  
. .

IETF ROLL working Group standardized the IPv6 Routing protocol (RPL) for applications over low-power and lossy networks (LLNs). RPL constructs a Destination Oriented Direction Acyclic Graph (DODAG) to organize network topology. RPL shows fast network setup and good scalability. However, it may suffer from load imbalance due to diverse network traffic and heavy load on preferred or forwarding parents. To optimize the load balancing of routes in RPL, this paper proposes load balancing metric based routing protocol called lbRPL. We introduce a new routing metric for RPL called load balancing index (LBI), which exploits load balancing characteristics of RPL nodes to select more load balanced parents and routes. LBI includes ETX, Parent count (Pc) and Remaining Parent Energy (Pe) metrics to make routing decisions. Simulation results show that lbRPL improves network performance, stability and improved network life time to RPL.  


Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 430
Author(s):  
Chung-Ming Leng ◽  
Huang-Jen Chiu

This paper proposes a single stage alternating current/direct current (AC/DC) flyback converter which contains three output windings with synchronous rectification (SR) function to achieve better cross-regulation and efficiency. Because the three output windings are stacked in a series structure and use synchronous rectification instead of diode rectification, the forward conduction loss of the diode can be eliminated, and the current of each winding can flow bilaterally. Therefore, the energy of leakage inductance can be dissipated through heavy load winding without transient overvoltage in light load winding. Compared with existing methods in the literature, the proposed converter can be realized by simple analog IC with fewer winding turns. Finally, under the extreme load imbalance condition, the cross-regulation is still within ±2.26%. The maximum efficiency of the proposed converter reaches 87%, which is about 3% higher than the conventional Schottky diode solution’s efficiency. The circuit structure and operation principle are described. A practical prototype and experiment results are implemented to verify the feasibility of the proposed converter.


2020 ◽  
Vol 309 ◽  
pp. 03025
Author(s):  
Lintan Sun ◽  
Zigan Li ◽  
Jingxian Lv ◽  
Chenfei Wang ◽  
Yajuan Wang ◽  
...  

With the rapid development and wide application of the Internet of Everything, in order to cope with the increasing amount of data and computational scale of mobile terminal processing, and the imbalance of existing scheduling algorithms and low resource utilization, this paper proposes a task scheduling algorithm based on business priority. The algorithm firstly divides the service according to the priority of the service. Secondly, the standard deviation of the computing task group is used to determine the proportion of long and short services, and the dynamic selection model is established. Finally, according to the idea of secondary allocation, the task of heavy load is assigned to the scheduling strategy of light load resources to execute, and the service redistribution model is established. The simulation results show that compared with the typical algorithm, the proposed algorithm achieves the result of comprehensive consideration of Makespan and load balancing to improve system efficiency.


2017 ◽  
Vol 2017 ◽  
pp. 1-11
Author(s):  
Jin-Bae Park ◽  
Kwang Soon Kim

In order to implement an optimized solution for cell range expansion (CRE) and enhanced intercell interference coordination (eICIC) schemes in long-term evolution-advanced (LTE-A) heterogeneous cellular networks (HCNs) and to realize good load-balancing performance in existing LTE-A systems, a practical tessellation-based algorithm is proposed. In this algorithm, a globalized cell-specific bias optimization and a localized almost blank subframe (ABS) ratio update are proposed. The proposed scheme does not require major changes to existing protocols. Thus, it can be implemented in existing LTE-A systems with any legacy user equipment (UE) with only a partial update to the BSs and core networks. From simulation results, it is shown that the tessellation formed by the proposed approach is quite consistent with the optimal one for various realistic scenarios. Thus, the proposed scheme can provide a much better load-balancing capability compared with the conventional common bias scheme. Owing to the improved load-balancing capability, the user rate distribution of the proposed scheme is much better than that obtained from the conventional scheme and is even indistinguishable from that of the ideal joint user association scheme.


Sign in / Sign up

Export Citation Format

Share Document