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

Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks

publisher: Elsevier articletitle: Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks journaltitle: Ad Hoc Networks articlelink: http://dx.doi.org/10.1016/j.adhoc.2016.08.005 content_type: article copyright: © 2016 Elsevier B.V. All rights reserved

The support of multipath routing in IPv6-based internet of things

The development of IPv6-based network architectures for Internet of Things (IoT) systems is a feasible approach to widen the horizon for more effective applications, but remains a challenge. Network routing needs to be effectively addressed in such environments of scarce computational and energy resources. The Internet Engineering Task Force (IETF) specified the IPv6 Routing Protocol for Low Power and Lossy Network (RPL) to provide a basic IPv6-based routing framework for IoT networks. However, the RPL design has the potential of extending its functionality to a further limit and incorporating the support of advanced routing mechanisms. These include multipath routing which has opened the doors for great improvements towards efficient energy balancing, load distribution, and even more. This paper fulfilled a need for an effective review of recent advancements in Internet of Things (IoT) networking. In particular, it presented an effective review and provided a taxonomy of the different multipath routing solutions enhancing the RPL protocol. The aim was to discover its current state and outline the importance of integrating such a mechanism into RPL to revive its potentiality to a wider range of IoT applications. This paper also discussed the latest research findings and provided some insights into plausible follow-up researches

Multipath Routing over Wireless Mesh Networks

Master'sMASTER OF SCIENC

Mobility in wireless sensor networks : advantages, limitations and effects

The primary aim of this thesis is to study the benefits and limitations of using a mobile base station for data gathering in wireless sensor networks. The case of a single mobile base station and mobile relays are considered. A cluster-based algorithm to determine the trajectory of a mobile base station for data gathering within a specified delay time is presented. The proposed algorithm aims for an equal number of sensors in each cluster in order to achieve load balance among the cluster heads. It is shown that there is a tradeoff between data-gathering delay and balancing energy consumption among sensor nodes. An analytical solution to the problem is provided in terms of the speed of the mobile base station. Simulation is performed to evaluate the performance of the proposed algorithm against the static case and to evaluate the distribution of energy consumption among the cluster heads. It is demonstrated that the use of clustering with a mobile base station can improve the network lifetime and that the proposed algorithm balances energy consumption among cluster heads. The effect of the base station velocity on the number of packet losses is studied and highlights the limitation of using a mobile base station for a large-scale network. We consider a scenario where a number of mobile relays roam through the sensing field and have limited energy resources that cannot reach each other directly. A routing scheme based on the multipath protocol is proposed, and explores how the number of paths and spread of neighbour nodes used by the mobile relays to communicate affects the network overhead. We introduce the idea of allowing the source mobile relay to cache multiple routes to the destination through its neighbour nodes in order to provide redundant paths to destination. An analytical model of network overhead is developed and verified by simulation. It is shown that the desirable number of routes is dependent on the velocity of the mobile relays. In most cases the network overhead is minimized when the source mobile relay caches six paths via appropriately distributed neighbours at the destination. A new technique for estimating routing-path hop count is also proposed. An analytical model is provided to estimate the hop count between source-destination pairs in a wireless network with an arbitrary node degree when the network nodes are uniformly distributed in the sensing field. The proposed model is a significant improvement over existing models, which do not correctly address the low-node density situation

Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis

Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.https://doi.org/10.3390/s15092220

QoS-Based and Secure Multipath Routing in Wireless Sensor Networks

With the growing demand for quality of service (QoS) aware routing protocols in wireless networks, QoS-based routing has emerged as an interesting research topic. A QoS guarantee in wireless sensor networks (WSNs) is difficult and more challenging due to the fact that the available resources of sensors and the various applications running over these networks have different constraints in their nature and requirements. Furthermore, due to the increased use of sensor nodes in a variety of application fields, WSNs need to handle heterogeneous traffic with diverse priorities to achieve the required QoS. In this thesis, we investigate the problem of providing multi-QoS in routing protocols for WSNs. In particular, we investigate several aspects related to the application requirements and the network states and resources. We present multi-objective QoS aware routing protocol for WSNs that uses the geographic routing mechanism combined with the QoS requirements to meet diverse application requirements by considering the changing conditions of the network. The protocol formulates the application requirements with the links available resources and conditions to design heuristic neighbor discovery algorithms. Also, with the unlimited resource at the sink node, the process of selecting the routing path/paths is assigned to the sink. Paths selection algorithms are designed with various goals in order to extend network lifetime, enhance the reliability of data transmission, decrease end-to-end delay, achieve load balancing and provide fault tolerance. We also develop a cross-layer routing protocol that combines routing at network layer and the time scheduling at the MAC layer with respect to delay and reliability in an energy efficient way. A node-disjoint multipath routing is used and a QoS-aware priority scheduling considering MAC layer is proposed to ensure that real time and non-real time traffic achieve their desired QoS while alleviating congestion in the network. Additionally, we propose new mechanism for secure and reliable data transmission in multipath routing for WSNs. Different levels of security requirements are defined and depending on these requirements, a selective encryption scheme is introduced to encrypt selected number of coded fragments in order to enhance security and thereby reduce the time required for encryption. Node-disjoint multipath routing combined with source coding is used in order to enhance both security and reliability of data transmission. Also, we develop an allocation strategy that allocates fragments on paths to enhance both the security and probability of successful data delivery. Analysis and extensive simulation are conducted to study the performance of all the above proposed protocols