Reducing Congestion Effects by Multipath Routing in Wireless Networks

We propose a solution to improve fairness and increasethroughput in wireless networks with location information.Our approach consists of a multipath routing protocol, BiasedGeographical Routing (BGR), and two congestion controlalgorithms, In-Network Packet Scatter (IPS) and End-to-EndPacket Scatter (EPS), which leverage BGR to avoid the congestedareas of the network. BGR achieves good performancewhile incurring a communication overhead of just 1 byte perdata packet, and has a computational complexity similar togreedy geographic routing. IPS alleviates transient congestion bysplitting traffic immediately before the congested areas. In contrast,EPS alleviates long term congestion by splitting the flow atthe source, and performing rate control. EPS selects the pathsdynamically, and uses a less aggressive congestion controlmechanism on non-greedy paths to improve energy efficiency.Simulation and experimental results show that our solutionachieves its objectives. Extensive ns-2 simulations show that oursolution improves both fairness and throughput as compared tosingle path greedy routing. Our solution reduces the variance ofthroughput across all flows by 35%, reduction which is mainlyachieved by increasing throughput of long-range flows witharound 70%. Furthermore, overall network throughput increasesby approximately 10%. Experimental results on a 50-node testbed are consistent with our simulation results, suggestingthat BGR is effective in practice

Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks

Simulation and Performance Analysis of MP-OLSR for Mobile Ad hoc Networks

Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data without reliance on a fixed base station or a wired backbone network, which makes routing a crucial issue for the design of a ad hoc networks. In this paper we discussed a hybrid multipath routing protocol named MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the redundancy coding is used to improve the delivery ratio. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks

Energy-aware peering routing protocol for indoor hospital body area network communication

The recent research in Body Area Networks (BAN) is focused on making its communication more reliable, energy efficient, secure, and to better utilize system resources. In this paper we propose a novel BAN network architecture for indoor hospital environments, and a new mechanism of peer discovery with routing table construction that helps to reduce network traffic load, energy consumption, and improves BAN reliability. We have performed extensive simulations in the Castalia simulation environment to show that our proposed protocol has better performance in terms of reduced BAN traffic load, increased number of successful packets received by nodes, reduced number of packets forwarded by intermediate nodes, and overall lower energy consumption compared to other protocols

Distributed reactive routing for selective forwarding attack resilience in wireless sensor networks

Wireless Sensor Networks (WSNs) are an emerging technology that may one day supply real-time information to many services and Internet-based applications. The utility of WSNs relies on the ability to provide valid information, even in the presence of failures or attackers. Current research in the field has identified a large variety of attacks and countermeasures, however, few works address how WSN routing protocols can autonomously react to detected attacks. The works that do provide attack-reactive schemes generally require nodes to coordinate or exchange trust/detection reports. This work aims to maximize data delivery in the presence of selective forwarding attacks with nodes performing detection and reaction operations independently. Via modifications to the Collection Tree Protocol\u27s forwarding path and route update procedure, nodes autonomously evaluate their parent\u27s forwarding reliability and duplicate data to alternative parent nodes when deemed necessary. As shown though a number of simulations, this distributed scheme yields significant data recovery with only modest overheads for attackers dropping data at medium to high rates

Robust Path Construction for Reliable Data Transmissions in Node Disjoint Multipath Routing

Wireless Sensor Networks (WSNs) are prone to node breakdowns due to energy constraints, which contribute to frequent topology changes. Moreover, since sensor nodes have restricted transmission range, multiple hops are needed by the node in order to forward the packets from one node to the other and this raises very challenging issues when designing routing protocols. Most of the proposed single path routing schemes use a periodic low-rate flooding of data in order to recover from path failures, which causes higher consumption in sensor node resources. So multipath routing is an optimal approach to enhance the network lifetime. In this paper, a robust path construction for a reliable data transmission in node-disjoint multipath routing (RNDMR) is proposed for WSNs. The proposed RNDMR has the ability to provide a low overhead path construction as well as provide data transmission reliability by using XOR-based coding algorithm, which entails low utilization of resources, such as low storage space and lesser computing power. In the proposed RNDMR, the procedure involves the splitting up of all transmitted messages into many different segments of equal size, before adding the XOR-based error correction codes and distributing it among multiple paths simultaneously in order to boost reliable data transmission and to be assured that the essential fragment of the packet arrives at the sink node without any additional consumption of energy and undue delay. By using simulations, the performance of RNDMR was assessed and compares it with ReInForm routing. The results illustrate that RNDMR attains low energy consumption, records low average delay and routing overhead, as well as increased packet delivery ratio when compared with ReInForm Routing

Performance and energy efficiency in wireless self-organized networks

fi=vertaisarvioitu|en=peerReviewed