Load Balancing In Wireless Networks Research Articles

Retraction Note: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table

Retraction Note: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table

New Algorithm to Handle Routing with Load Balancing in Wireless Networks Using EERNN

In this paper, static wireless network load balance algorithm is proposed, that use only optimal paths from point-to-point to achieve good load balance. This algorithm based on Enhanced version of Elman Recurrent Neural Network (EERNN) to make load balance decision depended on two metrics (traffic load on node and probability of link failure). This algorithm make good work in terms of both metrics simultaneously. Also, this algorithm use only local information. The execution of the proposed algorithm is compared with ERNN based on (traffic load on node and probability of link failure). © 201x JASET, International Scholars and Researchers Association

New Algorithm to Handle Routing with Load Balancing in Wireless Networks Using EERNN

In this paper, static wireless network load balance algorithm is proposed, that use only optimal paths from point-to-point to achieve good load balance. This algorithm based on Enhanced version of Elman Recurrent Neural Network (EERNN) to make load balance decision depended on two metrics (traffic load on node and probability of link failure). This algorithm make good work in terms of both metrics simultaneously. Also, this algorithm use only local information. The execution of the proposed algorithm is compared with ERNN based on traffic load on node and probability of link failure.
 
 © 2018 JASET, International Scholars and Researchers Association
 Author Biographies
 Lubna Najah Rasoul
 Mazaya University Collage
 Wijdan Rasheed Abd Al-Hussain
 University of Thi-Qar

RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table

In Peer to Peer systems (P2P); an only companion is connected to another associate in a different stockpiling framework. A different gathering of resolutions depicts disseminated hash tables outlines resources onto hubs in P2P system. It offers a "find --- obtain" development where getting the advantages in the framework is available, and like this it can get back. DHT offers a liberal position of hubs and administrations yet don't protect adjacent to vindictive hub moving lookups (the movement used to arrange the benefits in the system). Malicious hubs on a look-up pathway can precisely undermine question. Frameworks like Halo (in light of the harmony) reduction such ambushes by utilizing pointless lookup inquiries. To supply better affirmation; Reputation for Directory administrations is an establishment for training so as to boost lookups in abundance DHT how well new hubs administration lookup wishes. ReDS technique can be executed too for all intents and purposes any abundance DHT containing corona. Additionally, it perceives shared acknowledgment and dispenses with of difficult lookup paths. This acknowledgment does not wager on the partitioning of notoriety numbers and isolating is helpless to assaults that make larger part use of ReDS unfit. Corona is a plan that deeds the deterministic arranging of access to hubs in the harmony to introduce a "high-affirmation situate" through pointless investigates. Radiance was proposed to contain dynamic lookups and can browse different ways. Partitioned notoriety technique for Halo, has deterministic finger gathering. In deciding notoriety organize; the holes of attackers are diminished by utilizing unique Reciprocal Channel Variation based Identification (RCVI) technique. Load imbalance issue emerges through this lookup activity. Each Peer handles the heap by contrasting its ability. ReDS creates accomplishment lookup rates for Halo, yet next to think assailant was trying to brandish their notoriety achieves and in the presence of hub twirl.

Self-Organizing Spectrum Breathing and User Association for Load Balancing in Wireless Networks

In this paper, we develop a self-organizing mechanism for spectrum breathing and user association in cellular networks employing frequency reuse patterns. Specifically, our focus is on flow-level cell load balancing under spatially inhomogeneous traffic distributions. Our work adaptively changes the spectrum bandwidth of each base station (BS) so that spectrums of BSs breathe in and out in order to balance the loads of BSs. Spectrum breathing is further combined with delay-optimal user association for better load balancing. Our problem is challenging because the problem is not a convex optimization. To tackle the difficulty, we decouple spectrum breathing and user association and propose an iterative algorithm that always converges to a fixed point, which is possibly an optimal solution. We show that spectrum breathing dominates a family of $\alpha$ -optimal user association in cell load balancing. Surprisingly, the flow-level delay performance under spectrum breathing gets even better as spatial traffic distribution becomes unbalanced, which is not the case of $\alpha$ -optimal user association. Our extensive simulations confirm that spectrum breathing significantly improves the system performances: decreasing the delay more than 10 times or increasing the admittable traffic load by more than 125%. Furthermore, spectrum breathing outperforms full frequency reuse when spatial traffic distribution is inhomogeneous.

An Energy-Efficient Balancing Scheme in Wireless Sensor Networks

A typical wireless sensor network is conceived as bring a very large collection of low-powered, homogeneous nodes that remain stativ post-deployment and forward sensed data to a single sink via multi-hop communication. During the recent years, many energy-efficient load balancing protocols have been proposed for wireless sensor networks. Because a wireless networks consists of a large number of nodes with limited resources, the load balancing protocol is one of the key issues which can be solve the tradeoff between the service capacity and energy efficience. Load balancing protocols typically employ only a network capacity oriented approach in the next hop node is selected on adjacent or network information. This approach draw into a large overhead when the accurate adjacent information is needed for efficient and reliable routing. When an application service is caused large interaction between the adjacent nodes, the previous load balancing protocols without considering this issue were re-allocated the adjacent nodes and the other adjacent is re-allocated another region. This is not efficient for network performance because the previous protocols are generated the large overhead by increased routing and overhead. So, we propose a user-oriented load balancing scheme for an energy-efficient load balancing in wireless networks which is based on allocate load on wireless sensor nodes proportionally to each of the agent's capacity and user-oriented approach. This proposed scheme is combined dynamic provisioning algorithm based on greedy graph and user oriented load balancing scheme for maintain of the performance and stability of distributed system in wireless sensor networks. We address the key functions for our proposed scheme and simulate the efficiency of our proposed scheme using mathematical analyze.

Multicast Routing and Spectrum Allocation Algorithm Based on QOS Constraints Load Balancing in Wireless Network

Multicast Routing and Spectrum Allocation Algorithm Based on QOS Constraints Load Balancing in Wireless Network

End-to-end Reliable Message Transmission Considering Load Balancing in Wireless Networks

This paper proposes a load balanced reliable routing protocol called LBR (Load Balanced Reliable routing) in wireless networks. The LBR protocol transmits messages through a reliable path considering the balancing of the traffic load. Recently, the authors have proposed a multipath-based reliable routing protocol called MRFR, which is an appealing protocol for fault tolerant reliable data transmission. However, However, MRFR has no concern with the problem of load balancing, which results in increasing congestion and consuming high energy at some network nodes. As a result, the problem affects negatively the performance of the network. Taking account of load balancing as a route selection criteria can avoid routing through the congested nodes and allows to find better routes. In this paper, we extend MRFR by considering load balancing in the route discovery process of reliable communication. The simulation results showed that the proposed protocol outperforms AODV in terms of end-to-end delay, packet delivery radio, and average jitter. Compared to MRFR, the LBR protocol has the same packet delivery ratio, and obtains a better efficiency of load balancing.

Contention-based node selection with applications to relay communications and load balancing

This article proposes and analyzes a distributed probabilistic selection protocol in which several nodes perform a random access competition on a shared slotted channel. Nodes that are better suited according to some metric are preferred in the random access and are thus selected with high likelihood. Analytical performance studies are made in terms of reliability, message complexity, and delay. The protocol is applied in two case studies: relay communications and load balancing in wireless networks. In relay communications, a node is selected based on its channel state to serve as relay. In load balancing, a node is selected based on its battery charge state to perform a task. Results indicate that selecting nodes based on the observed metric contributes to better performance and longer network lifetime.

Distributed $\alpha$-Optimal User Association and Cell Load Balancing in Wireless Networks

In this paper, we develop a framework for user association in infrastructure-based wireless networks, specifically focused on flow-level cell load balancing under spatially inhomogeneous traffic distributions. Our work encompasses several different user association policies: rate-optimal, throughput-optimal, delay-optimal, and load-equalizing, which we collectively denote α-optimal user association. We prove that the optimal load vector ρ* that minimizes a generalized system performance function is the fixed point of a certain mapping. Based on this mapping, we propose and analyze an iterative distributed user association policy that adapts to spatial traffic loads and converges to a globally optimal allocation. We then address admission control policies for the case where the system is overloaded. For an appropriate system-level cost function, the optimal admission control policy blocks all flows at cells edges. However, providing a minimum level of connectivity to all spatial locations might be desirable. To this end, a location-dependent random blocking and user association policy are proposed.

Handover of relay stations for load balancing in IEEE 802.16

ABSTRACTThe load balancing in wireless networks is a very effective way for maximization of a system throughput. The paper proposes a new load balancing scheme in order to avoid a congestion of base stations (BSs) in IEEE 802.16 standards. While in many technical studies the load balancing is achieved by a handover (HO) of mobile stations (MSs), the novelty of our approach lies in the utilization of the HO of relay stations (RSs). Hence, the algorithm enabling load balancing via RSs is developed and optimized. Furthermore, the paper contemplates the implementation of the proposed mechanism to networks based on IEEE 802.16 standards. The performance of the mechanism is evaluated in terms of achieved system throughput and signaling overhead both at the air interface and over the wired backbone. The obtained results indicate that the load balancing mechanism through the HO of RSs outperforms existing load balancing mechanisms exploiting conventional HO of MSs. Copyright © 2011 John Wiley & Sons, Ltd.

An Analytical Approach for Mobility Load Balancing in Wireless Networks

Management of mobility especially balancing the load of handoff for wireless networks is an essential parameter for wireless network design and traffic study. In this paper, we present analytical mobility management in high speed wireless mobile networks focusing on factors such as the number of channel slots and offered load. We demonstrate the performance of handoffs with mobility consideration using several metrics including the alteration of states prior to reaching a cell boundary, the speed of mobile terminal, and the distance between a mobile terminal and a cell boundary. We mainly focus on the performance evaluation for the factor of mobility with taking into account the high speed status of a user.

Fuzzy logic based neural network models for load balancing in wireless networks

In this paper, adaptive channel borrowing approach fuzzy neural networks for load balancing (ACB-FNN) is presented to maximized the number of served calls and the depending on asymmetries traffic load problem. In a wireless network, the call's arrival rate, the call duration and the communication overhead between the base station and the mobile switch center are vague and uncertain. A new load balancing algorithm with cell involved negotiation is also presented in this paper. The ACB-FNN exhibits better learning abilities, optimization abilities, robustness, and fault-tolerant capability thus yielding better performance compared with other algorithms. It aims to efficiently satisfy their diverse quality-of-service (QoS) requirements. The results show that our algorithm has lower blocking rate, lower dropping rate, less update overhead, and shorter channel acquisition delay than previous methods.