Balanced Multipath Routing Research Articles

Energy and congestion-aware load balanced multi-path routing for wireless sensor networks in ambient environments

In wireless sensor networks (WSNs), a large number of sensor nodes (SNs) equipped with batteries are randomly distributed around an area in order to detect and capture sensor data. In WSNs, congestion is created in the node due to inefficient load balancing and routing. We proposed the congestion-aware load balancing approach considering the highly dynamic traffic scenario. We proposed the traffic rate aware cluster formation for efficient load balancing using a harmony search algorithm. In addition, modified Giraffe kicking optimization has been used for clustering and routing. The load has been aggressively balancing, and the slot has been utilized the slot when no data packets are available with the owner node. The proposed work has been simulated and validated with state-of-the-art congestion-aware algorithms. In our simulation, we validate our proposal on several standard parameters such as network lifetime, throughput, re-transmission frequency, standard deviation of energy consumption etc.

BMRHTA: Balanced Multipath Routing and Hybrid Transmission Approach for Lifecycle Maximization in WSNs

In this article, a balanced multipath routing and hybrid transmission approach (BMRHTA) is proposed to effectively alleviate the imbalance of the forwarding load in a sink connection area (SCA) and prolong the network lifecycle for wireless sensor networks (WSNs). To achieve the energy efficient and balanced WSNs, three design issues, including the multipath, multihop, and single-hop transmissions, are jointly optimized to maximize the overall network lifecycle. First, the path load aggregation phenomenon in the SCA, which makes the forwarding packet load unevenly distributed among hotspots, is examined. In order to achieve the load balance in SCA, multiple shortest balanced paths are generated in the BMRHTA model. In the first stage, two uncorrelated shortest paths are discovered from each node to the sink and the optimal path selection cycle can be determined to achieve the SCA load balance. Afterward, a network equilibrium policy is offered to resolve the optimal transmission period of energy balance via hybrid transmission. As a result, the balanced shortest paths, the path selection cycle and the transmission period can be determined in the network formation phase to avoid the excessive load concentration in the subsequent maintenance phase. Simulation results show that the joint two uncorrelated balanced routing and the proposed network equilibrium policy can nearly quadruple the network lifecycle extension, as compared to a conventional node power policy. Also, the proposed BMRHTA achieves better performance than the current state-of-the-art competitive approaches in terms of energy efficiency and lifecycle.

Efficient Load Balancing with MANET Propagation of Least Common Multiple Routing and Fuzzy Logic

Mobile Ad Hoc Network (MANET) is a group of node that would interrelate among each other through one multi-hop wireless link, wherein the nodes were able to move in response to sudden modifications. The objective of MANET routing protocol is to quantify the route and compute the best path, but there exists a major decrease in energy efficiency, difficulty in hop selection, cost estimation, and efficient load-balancing. In this paper, a novel least common multipath-based routing has been proposed. Multipath routing is used to find a multipath route from source and destination. Load balancing is of primary importance in the mobile ad-hoc networks, due to limited bandwidth among the nodes and the initiator of the load routing discovery phase in the multipath routing protocol. Fuzzy logic for load balancing multipath routing in MANETs is proposed, which ensures the data packets are sent through a path with the variance of binary sets to predict the original transformation of the data to be received in the system. The main objective of the proposed system is to reduce the routing time of data packets and avoid the traffic based on multipath source and destination. The experimental results have to verify 96.7% efficiency in balancing the load.

Routing Protocol for Clustered Bee-Ad Hoc MANETS with Proper node Utilization

Making MANETs energy efficient has been a biggest challenge from many years. In this regard in the previous works routing protocols have been introduced for stabilized clustering scheme with swarm intelligence where the MANETs are made energy efficient with well balanced multipath routing protocols. But in all the proposed protocols the cluster structures are non overlapping where there is a probability that some of the nodes may be left without any consideration in the clusters of MANET as nodes are highly dynamic in nature. These nodes usually do not belong to any of the clusters thus cannot take part in the routing process unless cluster splitting takes place. In that case certain time error may occur if any such kind of node carries any special information. For that the clusters may be made overlapping but in that case number of clusters may increase leading to complicated structure where efficiency may decrease suddenly in case of node movement or failure. For this a novel clustering and routing procedure has been introduced in the paper where not only all the nodes take part in data transmission but also number of clusters are minimized to improve efficiency. The work has been carried by using NS-2 simulator.

Minimum cost load balanced multipath routing protocol for low power and lossy networks

Conventional shortest path routing mechanisms in low power and lossy networks (LLNs) impose excessive traffic load on some nodes and cause their early battery depletion. Load balancing via multipath routing is a promising solution to increase lifetime. This idea is practised by some algorithms, mostly through limited number of disjoint paths, to reduce inter-path interference. In this paper a proactive multipath routing algorithm called MRPL is proposed, based on the recent standard routing protocol for LLNs. The algorithm tries to distribute the traffic load through a set of braided paths, with the objective of maximizing the network lifetime and minimizing total transmission cost. The traffic distribution mechanism is formulated by a linear program and a heuristic method is proposed to implement it in a distributed manner. Simulation results provide enough evidence for energy and cost efficiency of the proposed routing mechanism.

Reliable and Load Balanced Multi-path Routing for Multiple Sinks in Wireless Sensor Networks

Wireless Sensor Networks, the existing techniques for sink deployment consider load balancing and multipath routing. But the fault detection and recovery of sinks are rarely considered. In this paper, we propose to develop a Fault detection and recovery mechanism for multiple sinks. The nodes are grouped into clusters based on the data generation rate and multiple sinks are deployed in the clusters in which the data generation rate is more. An energy efficient multi path tree is constructed towards the sink and the aggregated data from the sensors are transmitted to their nearest sinks through this multi path tree. The rate adjustment value and the inter arrival delay of each path is calculated and sent back as a feedback to the source to by the respective sinks. Then the path with the minimum feedback value is chosen as the best path for transmission. When a failure occurs in a sink, then it can be detected based on delay and remaining energy. Once the fault sink is detected, then the data is transferred to another sink or the sinks are deployed again. From our simulation results, we show that an efficient load balanced multi path routing for multiple sinks is obtained and the fault detection and recovery can be made effectively.

Delay Aware and Load Balanced Multi-Path Routing in Wireless Sensor Networks

In wireless sensor networks, a multi-path routing based data gathering algorithm should consider the number of paths and the way to select these paths. The data transfer through these multiple paths should be performed in a load balanced way. There should be some detection technique for routing failures. In this paper, we propose to design a load balanced delay aware multi-path routing. It contains three phases: the multi-path construction phase, Data aggregation phase and the Data transmission phase. The sink calculates the inter-arrival delay and new data sending rate for all the paths and this information is sent as a feedback to the source such that the paths with minimum delay are chosen and the packets are distributed through these paths according to their new data sending rates. By our simulation results we show that our objectives are achieved through this method and so the multi-path routing has been enhanced.

Energy Balancing Multipath Routing Protocol in Wireless Multimedia Sensor Networks

A large amount of image and video streaming need to be transmitted in wireless multimedia sensor networks (WMSNs), and a single path can not meet the requirement of image and video streaming transmission. Multipath routing protocol can increase transmission capability and be appropriate for WMSNs. TPGF is the first multipath routing protocol which is suitable for WMSNs. After TPGF is analyzed deeply, we propose an Energy Balancing Multipath Routing protocol (EBMR) which considers nodes' residual energy and the distance between the node and the sink. Compared to TPGF, EBMPR can more evenly consume nodes' energy and prolong the network lifetime. Simulation results show the advantage of EBMR.

Fluid models of integrated traffic and multipath routing

In this paper we consider a stochastic model describing the varying number of flows in a network. This model features flows of two types, namely file transfers (with fixed volume) and streaming traffic (with fixed duration), and extends the model of Key, Massoulie, Bain and Kelly [27] by allowing more general bandwidth allocation criteria. We analyse the dynamics of the system under a fluid scaling, and show Lyapunov stability of the fluid limits under a natural stability condition. We provide natural interpretations of the fixed points of these fluid limits. We then compare the fluid dynamics of file transfers under (i) balanced multipath routing and (ii) parallel, uncoordinated routing. We show that for identical traffic demands, parallel uncoordinated routing can be unstable while balanced multipath routing is stable. Finally, we identify multi-dimensional Ornstein-Uhlenbeck processes as second-order approximations to the first-order fluid limit dynamics.