Balanced Routing Research Articles

Retraction Note: Soft computing and trust-based self-organized hierarchical energy balance routing protocol (TSHEB) in wireless sensor networks

Retraction Note: Soft computing and trust-based self-organized hierarchical energy balance routing protocol (TSHEB) in wireless sensor networks

Mathematical Modeling and Designing of a Novel Improvised Cooperative Balancing Routing (CBR) Protocol to Enhance the Lifetime of WSNS using Load Balancing Concepts

In this paper, the design & development of a novel cooperative balancing routing (CBR) protocol to enhance the lifetime of WSNs using load balancing concepts by decreasing the energy consumption during the data exchanges is presented in the respective section. The main objective of the research work presented in this paper is to present an improvised version of the CBR that computes the routing path by using cooperative mechanisms using the concept of load balancing. This paper also demonstrates the various results obtained for all the test cases along with the necessary observations and explanations in the form of discussions and diagrammatic representations. The paper finally concludes with the overall conclusions of the CBR work.

Application of EEUC-based inter aircraft ultraviolet communication network algorithm in energy consumption optimization of drone swarm

With the widespread application of drone technology, energy management of drone swarms has become a key challenge in ensuring sustained and efficient operations. To optimize the energy consumption of drone swarms, researchers have proposed the energy balance plane routing algorithm. This algorithm uses ultraviolet light for low visibility communication and has shown promising results in managing the energy of drone swarms. To address the issues of uneven cluster head distribution and reduced energy consumption in other algorithms, an improved non-uniform clustering energy balancing routing algorithm is proposed. Compared to existing algorithms, the improved non-uniform clustering energy balancing routing algorithm achieved the lowest average communication consumption among 5 nodes and prolonged node failure time. The performance of the research method has been verified through simulation experiments, which is of great significance in maintaining energy consumption balance and can improve the energy efficiency and sustainability of the network. This study can provide more effective solutions for the development and application of drone technology, promoting its widespread application and promotion in various fields.

Multiobjective-energy centric honey badger optimization based routing for wireless body area network

Wireless Body Area Network (WBAN) is an interconnection of tiny biosensors that are organized in/on several parts of the body. The developed WBAN is used to sense and transmit health-related data over the wireless medium. Energy efficiency is the primary challenges for increasing the life expectancy of the network. To address the issue of energy efficiency, one of the essential approaches i.e., the selection of an appropriate relay node is modelled as an optimization problem. In this paper, energy efficient routing optimization using Multiobjective-Energy Centric Honey Badger Optimization (M-ECHBA) is proposed to improve life expectancy. The proposed M-ECHBA is optimized by using the energy, distance, delay and node degree. Moreover, the Time Division Multiple Access (TDMA) is used to perform the node scheduling at transmission. Therefore, the M-ECHBA method is used to discover the optimal routing path for enhancing energy efficiency while minimizing the transmission delay of WBAN. The performances of the M-ECHBA are analyzed using life expectancy, dead nodes, residual energy, delay, packets received by the Base Station (BS), Packet Loss Ratio (PLR) and routing overhead. The M-ECHBA is evaluated with some classical approaches namely SIMPLE, ATTEMPT and RE-ATTEMPT. Further, this M-ECHBA is compared with the existing routing approach Novel Energy Efficient hybrid Meta-heuristic Approach (NEEMA), hybrid Particle Swarm Optimization-Simulated Annealing (hPSO-SA), Energy Balanced Routing (EBR), Threshold-based Energy-Efficient Routing Protocol for physiological Critical Data Transmission (T-EERPDCT), Clustering and Cooperative Routing Protocol (CCRP), Intelligent-Routing Algorithm for WBANs namely I-RAW, distributed energy-efficient two-hop-based clustering and routing namely DECR and Modified Power Line System (M-POLC). The dead nodes of M-ECHBA for scenario 3 at 8000 rounds are 4 which is less when compared to the dead nodes of EBR.

Software-architectural configuration of the multifunctional audio digital signal processor module for signal mediatesting of audio devices

Objectives. The aim of this study is to develop and analyze parameters for a multifunctional audio module based on the ADAU1701 audio digital signal processor in the SigmaStudio environment. This will be used for testing audio devices in the following modes: routing of balanced and unbalanced audio channels according to the differential scheme Di-Box/R Di-Box; spatiotemporal and dynamic audio processing; three-band monochannel cross-separation with independent equalization; and correction of the frequency response of the audio channel with tracking notch auto-suppression of electro-acoustic positive feedback in a given spectral band.Methods. Visual-graphical architectural programming of audio modules in the SigmaStudio and Flowstone, as well as algorithms for real-time signal audio measurements and analysis of experimental data in the REW and Soundcard Oscilloscope are used.Results. The characteristics of the Di-Box/R Di-Box circuit were studied, in order to estimate the effect of differential signal conversion on the signal-to-noise ratio in the audio signal path. The characteristics of the reverberation and saturation submodules were established. Furthermore, the effect of equalization modes on the frequency response correction of a studio audio monitor was determined. The paper also studied the effect of an audio compressor on the dynamic range and the level of the output signal. The experimental results of the submodule for compensating the frequency response of an audio monitor using matched filtering were established, and the spectral characteristics of the submodule for automatic suppression of electro-acoustic positive feedback were obtained.Conclusions. The software architecture of a multifunctional audio module based on the ADAU1701 audio digital signal processor for testing and debugging media devices in a given spectral-dynamic and spectral-temporal ranges was designed. Balanced routing allows the effect of noise induced into the audio channel to be reduced 20-fold, thus enabling calibration of pickup audio devices. The audio signal processing submodule provides: compression response in the dynamic range from −27 to 18.6 dB with the possibility of equalization parameterization in the range of 0.04–18 kHz; reverberation response in the range from 0.5–3000 ms; audio-channel cross-division into 3 with the ability to adjust the amplitude-frequency response in the dynamic range from −30 to 30 dB. The auto-correction submodule of the amplitude-frequency response allows the dynamic nonuniformity of the amplitude-frequency response to be reduced by 40 dB. The auto-suppression submodule of electro-acoustic positive feedback provides notch formant suppression up to −100 dB with an input dynamic range from −50 to 80 dB.

A Load Balance Routing Algorithm for Medical IoT Based on Link Quality

A Load Balance Routing Algorithm for Medical IoT Based on Link Quality

Graph based routing algorithm for torus topology and its evaluation for the Angara interconnect

Several approaches and techniques exist to resolve load balancing problem in general and torus topology networks. Graph methods are natural ways to perform balancing of routing paths. A routing balancing algorithm must operate within the constraints of the underlying network architecture that limits several parameters, such as the number of logical paths in the network. In this paper, we consider a torus topology that is one of the common topologies that are used in high performance computing systems. We introduce a routing graph that corresponds to a interconnect topology, abstracts interconnect routing rules, providing one-to-one correspondence of network routes and graph paths. We propose a deadlock-free routing algorithm based on a fast single-source shortest path algorithm in a routing graph for the deterministic routing of a torus topology interconnect with a single virtual channel. The proposed algorithm is a tradeoff between two existing routing algorithms, also the algorithm is optimized for multidimensional torus topology and can be applied to any torus topology HPC system. We present a complete description of a routing graph that abstracts the Angara interconnect with 4D torus topology. We evaluated the proposed routing algorithm and benchmarked the maximum performance improvement of 71% for the Alltoall pattern for torus topology systems up to 432 nodes on the Angara interconnect simulator. The performance improvement of more than 5% was obtained for the NPB FT and IS application kernels on a 32-node supercomputer.

Energy balanced routing protocol based on improved particle swarm optimisation and ant colony algorithm for museum environmental monitoring of cultural relics

AbstractThe environmental monitoring of cultural relics based on wireless sensor networks in museums demands for the transmission and processing of massive data, which in turn leads to problems, such as heavy network traffic, high time delay, and unbalanced node energy consumption. To solve these problems, an energy balanced routing protocol which can minimise the network energy consumption is proposed. The improved swarm intelligence optimisation algorithm which combined particle swarm optimisation with ant colony optimisation is adopted to construct an environmental monitoring system for cultural relics preservation. Simulation results show that the decrease of the path length for data transmission under the proposed algorithm is 2.5% higher than that of other classical algorithms, indicating that the proposed algorithm can effectively reduce the length of network path and improve the transmission performance of network system. In view of optimisation rounds and simulation time, the energy consumption of the network system under our algorithm is 57.5% less compared with other classical algorithms, and the average residual energy variance is 57.1% less. The cultural relics environmental monitoring system based on the proposed routing protocol has better network load balancing performance.

Energy‐efficient multipath clustering with load balancing routing protocol for wireless multimedia sensor networks

AbstractWireless multimedia sensor networks (WMSNs) has the capability of collecting scalar information, as well as multi‐media events like moving object tracking and traffic fatalities. Because energy in WMSNs is a constrained resource, several researchers offered cluster routing approaches, and most protocols generally do not offer an average resource usage of the network that is balanced and minimised. To address this issue, this paper proposes an Energy‐Efficient Multipath Clustering with Load Balancing Routing Protocol for WMSNs (EEMCL) to prolong the network lifetime. The suggested protocol, which segments the network into layers of clusters, would be implemented using multi‐hop. Sensing data from the sensor is transmitted to the sink by the main cluster heads in each layer, cooperating with the cluster heads in the upper layers. The proposed protocol improves energy dissipation, network life‐times, and network stability according to simulation results when compared with SEP, SEP‐E, and SEPFL protocols. The last node dead for the proposed protocol is at round 5833, 4027 for SEPFL, 2828 for SEP‐E, and 2325 for SEP.

Balanced Off-Chain Payment Channel Network Routing Strategy Based On Weight Calculation

AbstractOff-chain payment channel network is an effective solution to deal with low throughput and high load on the blockchain. However, the quality of the routing scheme will directly affect the performance of the off-chain network system. Existing routing schemes cannot select an appropriate transaction path according to the actual needs of user nodes. And they may also lead to network congestion, channel imbalance and node centralization. This paper proposes a new balanced routing selection scheme based on weight calculation called BRBW, which builds a weight model by Analytic Hierarchy Process. BRBW comprehensively considers the channel capacity, handling fee and path length to improve transaction success rate, reduce channel congestion and maintain the long-term sustainability of the payment channel. It uses a modified maximum flow algorithm to find paths with sufficient capacity and selects the transaction path for a large payment through linear programming. Finally, we do some experiments and compare with state-of-the-art approaches in the test environment. Simulation results show that under the same network environment, the payment success rate of the BRBW is above 75%, and the channel utilization rate is about 10% higher than other schemes.

An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

Due to advancements in multi-core design technology, IC (Integrated Circuits) designers have expanded the single chip multi-core design. A privileged way of communication effectively between these multi-cores is a Network on-chip (NoC). Design of an effective routing algorithm capable of routing data to non-congested paths is the most notable research challenge in NoC, by retrieving congestion information of non-local nodes. This research proposed an improved congestion-aware load balancing routing algorithm. Non-local or distant links congestion awareness is done by propagating congestion information via data packets. By counting number of hops from the source node, in the quadrant of the destination node, an intermediate node has been defined, and after the calculation of the least congested route to the intermediate node, this route is also stored in the data packet for source routing. Furthermore, for load balancing network is partitioned into two areas called high congested area (HCA) and low congested area (LCA). For load balancing, from HCA a node in LCA is selected as output for data packets. Comparison of the proposed algorithm is done in the form of average latency, average throughput, power consumption, and scalability analysis under synthetic traffic patterns. Under simulation experiments, it is shown improvement in an average latency and throughput of the proposed algorithm is 31.28% and 5.28% respectively, than existing.

STALB: A Spatio-Temporal Domain Autonomous Load Balancing Routing Protocol

Due to vehicle mobility, the topology of Vehicle Ad-hoc Networks (VANETs) may change dynamically. High mobility, limited bandwidth, and dynamic network topology pose challenges for communication in the Internet of Vehicles (IoVs). Literature works have attempted to promote efficient (e.g., lower end-to-end latency) message forwarding. However, due to the uncertain direction of message forwarding and vehicle mobility, they suffer from unreachable destinations and unstable connections. This paper explores the efficient method of message forwarding to alleviate network congestion in IoVs. We propose a Spatio-Temporal domain Autonomous Load Balancing (STALB) routing protocol. Specifically, STALB is a trajectory-based method for controlling the direction of message forwarding. STALB can significantly reduce the end-to-end latency and overload ratio, since it considers the local status of network relay devices (i.e., buffer score, congestion status) from the spatio-temporal domain. Then, we present a path reconstruction mechanism, which ensures that messages are forwarded to destinations within limited Time-To-live (TTL). Extensive simulation results show that STALB significantly outperforms other baseline methods (BSaW, TDOR, and TBHGR) regarding overhead ratio, average delivery latency, and average buffer time. Especially, the delivery rate of STALB can reach 99.9% under the sparse network scenario (4,500 messages), at least 0.7% higher than other baseline methods. Similarly, the average delivery delay of STALB is at least 84.31% lower than that of other baseline methods under the dense network scenario (18,000 messages).

An Energy Sensitive and Congestion Balance Routing Scheme for Non-Terrestrial-Satellite-Network (NTSN)

Recently, non-terrestrial-satellite-networks (NTSN) have attracted more attention due to excellent performance. NTSN specifically refers to a mega satellite constellation network. Global coverage, low latency and high data rate make global interconnection possible. However, the lack of on-board energy degrades the efficiency of the network system. To solve those pressing problems, an energy sensitive and congestion balance (ESCB) routing scheme is proposed in this paper. To compensate for the limited energy of satellites, a tubular sliding time window (TSTW) model is proposed. The residual energy can be predicted by it and a multi-objective algorithm is applied to calculate the routing path. Energy constraints, network congestion and latency are taken into account in the specific algorithm. A traffic model consisting of two different services is introduced as a verification system. Simulations demonstrate that the specific routing scheme achieves energy balance and congestion avoidance. In addition, comparison results demonstrate that ESCB is superior to the virtual-topology-based shortest path (VT-SP) routing algorithm.

BRATRA: Balanced Routing Algorithm With Transmission Range Adjustment for Energy Efficiency and Utilization Balance in WSNs

In traditional wireless sensor networks (WSNs), packets are mainly transmitted in a multihop routing manner. The multihop transmission, however, leads to a hotspot problem in the sink connectivity area (SCA), and the overall network efficiency is reduced due to the quick battery power exhaustion of nodes in that area. This article proposes a novel balanced routing algorithm with transmission range adjustment (BRATRA) to address the network efficiency problem, including the energy efficiency and utilization issues. First, a balanced routing strategy is designed to deal with the SCA load imbalance problem. With the shortest balanced path, the amounts of forwarding packets for the nodes in the SCA and all the other intralayers become more even. From the perspective of power equilibrium in each routing path, each node then determines its accurate transmission radius according to the derived formula and performs power control to realize the even power utilization between interlayers, thereby prolonging the overall network lifetime. Performance evaluation validates that the proposed BRATRA strategy can achieve efficient power utilization in each intralayer and double the network lifetime as compared to the Dijkstra routing strategy. Additionally, it yields better power utilization fairness among nodes, and on average only 5% of battery power is unused for all network nodes, resulting in a network lifespan ten times larger than that using a conventional strategy.

Load balancing routing in RPL for the internet of things networks: a survey

Load balancing routing in RPL for the internet of things networks: a survey

Load balancing routing in RPL for the internet of things networks: a survey

Load balancing routing in RPL for the internet of things networks: a survey

Distance-Based Back-Pressure Routing for Load-Balancing LEO Satellite Networks

Featuring wide coverage and high data rate, LEO satellite networks will be an important supplement to the traditional terrestrial networks, enabling the space-air-ground integrated network service. However, effective load balancing routing strategies for LEO satellite networks need to be designed, due to the bursty characteristic of the network traffic and imbalanced regional communication load. To achieve that, we propose a Distance-based Back-Pressure Routing (DBPR) strategy for LEO satellite networks. DBPR calculates the link weights based on a novel distance-based metric, which can select uncongested short-distance paths to the destinations and distribute network traffic dynamically with low delay. To control the number of forwardings in the network, we restrict the transmission range to a rectangle region between each source-destination pair. We design DBPR in the distributed fashion without collecting the global network load information, which is suitable for LEO satellite networks with limited resources, long propagation delay, dynamic topology, etc. We analyze the network stability and prove the throughput optimality of DBPR. Simulation results demonstrate that DBPR can achieve higher throughput and lower delay, compared with the state-of-the-art strategies, especially in the environments with limited cache resource.

A Novel Gradient Boosted Energy Optimization Model (GBEOM) for MANET

Mobile Ad Hoc Network (MANET) is an infrastructure-less network that is comprised of a set of nodes that move randomly. In MANET, the overall performance is improved through multipath multicast routing to achieve the quality of service (quality of service). In this, different nodes are involved in the information data collection and transmission to the destination nodes in the network. The different nodes are combined and presented to achieve energy-efficient data transmission and classification of the nodes. The route identification and routing are established based on the data broadcast by the network nodes. In transmitting the data packet, evaluating the data delivery ratio is necessary to achieve optimal data transmission in the network. Furthermore, energy consumption and overhead are considered essential factors for the effective data transmission rate and better data delivery rate. In this paper, a Gradient-Based Energy Optimization model (GBEOM) for the route in MANET is proposed to achieve an improved data delivery rate. Initially, the Weighted Multi-objective Cluster-based Spider Monkey Load Balancing (WMC-SMLB) technique is utilized for obtaining energy efficiency and load balancing routing. The WMC algorithm is applied to perform an efficient node clustering process from the considered mobile nodes in MANET. Load balancing efficiency is improved with a higher data delivery ratio and minimum routing overhead based on the residual energy and bandwidth estimation. Next, the Gradient Boosted Multinomial ID3 Classification algorithm is applied to improve the performance of multipath multicast routing in MANET with minimal energy consumption and higher load balancing efficiency. The proposed GBEOM exhibits ∼4% improved performance in MANET routing.

An energy cooperation method of wireless sensor networks based on partially observable Markov decision processes

The performance of routing protocols in wireless sensor networks, such as energy conservation, energy and load balancing. These indicators have a very important impact on the network lifetime. Energy cooperation technology refers to the purposeful transfer of energy from nodes with sufficient energy to nodes with insufficient energy. Firstly, according to POMDP (Partially Observable Markov Decision Process) model, related theories and solving algorithms, this paper proposes an energy cooperation method based on POMDP, establishes an interference decision model based on POMDP, and solves the model. This paper proposes an energy balance routing algorithm based on multi-attribute decision making (EBR_MDM). This algorithm is used to solve the application problem of wireless sensor networks with stable data flow. Including the uneven distribution of network energy, hot spots and energy holes, packet loss caused by node overload and retransmission energy consumption. According to the relative entropy, the attribute weight is calculated, and the optimal forward data is selected to the neighboring nodes. The simulation results show that the network running time of EBR_MDM is increased by 22.1 %, 48.7 % and 101.3 % respectively compared with other comparison protocols. Finally, because the sensor nodes are randomly arranged in the predetermined monitoring area, and the distribution of each node is chaotic, this paper establishes TMA (Trilateral Measurement Algorithm) algorithm to locate the target. The simulation results show that the positioning error of TMA may be about 1.2 m due to trilateration, but it is still within an acceptable range.

Equilibrium Allocation Approaches of Quantum Key Resources With Security Levels in QKD-Enabled Optical Data Center Networks

In this article, the network performance of equilibrium allocation of quantum key resources was investigated in quantum key distribution (QKD)-enabled optical data center networks. To effectively use quantum key resources, we propose three novel efficient load balancing routing, wavelength, and time-slot assignment (LB-RWTA) approaches, including LB-RWTA with flexible security level (LB-RWTA-FSL), LB-RWTA with specific security level (LB-RWTA-SSL), and LB-RWTA without security level (LB-RWTA-NSL). Particularly, the proposed LB-RWTA-FSL approach is uniquely featured by adaptive security level classification (ASLC) and load balancing (LB), aiming to demarcate the security level (SL) and reduce the overall network congestion. We introduce an existing routing, wavelength, and time-slot assignment (E-RWTA) approach without SL, called E-RWTA, for comparison. Simulation results show the effectiveness of our proposed approaches in terms of much higher quantum key resource efficiency and thus much higher network security performance than the state-of-the-art quantum key resource allocation approaches compared with the E-RWTA approach in QKD-enabled optical data center networks.