Showing papers on "Multipath routing published in 2015"

Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks

Abstract: Energy savings optimization becomes one of the major concerns in the wireless sensor network (WSN) routing protocol design, due to the fact that most sensor nodes are equipped with the limited nonrechargeable battery power. In this paper, we focus on minimizing energy consumption and maximizing network lifetime for data relay in one-dimensional (1-D) queue network. Following the principle of opportunistic routing theory, multihop relay decision to optimize the network energy efficiency is made based on the differences among sensor nodes, in terms of both their distance to sink and the residual energy of each other. Specifically, an Energy Saving via Opportunistic Routing (ENS_OR) algorithm is designed to ensure minimum power cost during data relay and protect the nodes with relatively low residual energy. Extensive simulations and real testbed results show that the proposed solution ENS_OR can significantly improve the network performance on energy saving and wireless connectivity in comparison with other existing WSN routing schemes.

A Survey on Opportunistic Routing in Wireless Communication Networks

Abstract: The great advances made in the wireless technology have enabled the deployment of wireless communication networks in some of the harshest environments such as volcanoes, hurricane-affected regions, and underground mines. In such challenging environments suffering from the lack of infrastructure, traditional routing is not efficient and sometimes not even feasible. Moreover, the exponential growth of the number of wireless connected devices has created the need for a new routing paradigm that could benefit from the potentials offered by these heterogeneous wireless devices. Hence, in order to overcome the traditional routing limitations, and to increase the capacity of current dynamic heterogeneous wireless networks, the opportunistic routing paradigm has been proposed and developed in recent research works. Motivated by the great interest that has been attributed to this new paradigm within the last decade, we provide a comprehensive survey of the existing literature related to opportunistic routing. We first study the main design building blocks of opportunistic routing. Then, we provide a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design. Hence, five opportunistic routing classes are defined and studied in this paper, namely, geographic opportunistic routing, link-state-aware opportunistic routing, probabilistic opportunistic routing, optimization-based opportunistic routing, and cross-layer opportunistic routing. We also review the main protocols proposed in the literature for each class. Finally, we identify and discuss the main future research directions related to the opportunistic routing design, optimization, and deployment.

Ring Routing: An Energy-Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink

Abstract: In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.

Atypical Hierarchical Routing Protocols for Wireless Sensor Networks: A Review

Abstract: Hierarchical routing in wireless sensor networks (WSNs) is a very important topic that has been attracting the research community in the last decade. Typical hierarchical routing is called clustering routing, in which the network is divided into multiple clusters. Recently, some types of atypical hierarchical routing arise, including chain-based, tree-based, grid-based routing, and area-based routing. There are several survey papers that present and compare the hierarchical routing protocols from various perspectives, but a survey on atypical hierarchical routing is still missing. This paper makes a first attempt to provide a comprehensive review on atypical hierarchical routing. We offer a classification of atypical hierarchical routing of WSNs, and give detailed analysis of different logical topologies. The most representative atypical hierarchical routing protocols are described, discussed, and qualitatively compared. In particular, the advantages and disadvantages of different atypical hierarchical routing protocols are analyzed with respect to their significant performances and application scenarios. Finally, we put forward some open issues concerning the design of hierarchical WSNs. This survey aims to provide useful guidance for system designers on how to evaluate and select appropriate logical topologies and hierarchical routing protocols for specific applications.

Using multiparent routing in RPL to increase the stability and the lifetime of the network

Abstract: Energy is a very scarce resource in Wireless Sensor Networks. While most of the current proposals focus on minimizing the global energy consumption, we aim here at designing an energy-balancing routing protocol that maximizes the lifetime of the most constraint nodes. To improve the network lifetime, each node should consume the same (minimal) quantity of energy. We propose the Expected Lifetime metric, denoting the residual time of a node (time until the node will run out of energy). We design mechanisms to detect energy-bottleneck nodes and to spread the traffic load uniformly among them. Moreover, we apply this metric to RPL, the de facto routing standard in low-power and lossy networks. In order to avoid instabilities in the network and problems of convergence, we propose here a multipath approach. We exploit the Directed Acyclic Graph (DAG) structure of the routing topology to probabilistically forward the traffic to several parents. Simulations highlight that we improve both the routing reliability and the network lifetime, while reducing the number of DAG reconfigurations.

Routing protocols for underwater wireless sensor networks

Abstract: Recently, underwater wireless sensor networks (UWSNs) have emerged as a promising networking technique for various underwater applications. An energy efficient routing protocol plays a vital role in data transmission and practical applications. However, due to the specific characteristics of UWSNs, such as dynamic structure, narrow bandwidth, rapid energy consumption, and high latency, it is difficult to build routing protocols for UWSNs. In this article we focus on surveying existing routing protocols in UWSNs. First, we classify existing routing protocols into two categories based on a route decision maker. Then the performance of existing routing protocols is compared in detail. Furthermore, future research issues of routing protocols in UWSNs are carefully analyzed.

Optimized network traffic engineering using segment routing

Abstract: Segment Routing is a proposed IETF protocol to improve traffic engineering and online route selection in IP networks. The key idea in segment routing is to break up the routing path into segments in order to enable better network utilization. Segment routing also enables finer control of the routing paths and can be used to route traffic through middle boxes. This paper considers the problem of determining the optimal parameters for segment routing in the offline and online cases. We develop a traffic matrix oblivious algorithm for robust segment routing in the offline case and a competitive algorithm for online segment routing. We also show that both these algorithms work well in practice.

Cross-layer optimized routing in wireless sensor networks with duty cycle and energy harvesting

Abstract: In this paper, we propose a cross-layer optimized geographic node-disjoint multipath routing algorithm, that is, two-phase geographic greedy forwarding plus. To optimize the system as a whole, our algorithm is designed on the basis of multiple layers' interactions, taking into account the following. First is the physical layer, where sensor nodes are developed to scavenge the energy from environment, that is, node rechargeable operation a kind of idle charging process to nodes. Each node can adjust its transmission power depending on its current energy level the main object for nodes with energy harvesting is to avoid the routing hole when implementing the routing algorithm. Second is the sleep scheduling layer, where an energy-balanced sleep scheduling scheme, that is, duty cycle a kind of node sleep schedule that aims at putting the idle listening nodes in the network into sleep state such that the nodes will be awake only when they are needed, and energy-consumption-based connected k-neighborhood is applied to allow sensor nodes to have enough time to recharge energy, which takes nodes' current energy level as the parameter to dynamically schedule nodes to be active or asleep. Third is the routing layer, in which a forwarding node chooses the next-hop node based on 2-hop neighbor information rather than 1-hop. Performance of two-phase geographic greedy forwarding plus algorithm is evaluated under three different forwarding policies, to meet different application requirements. Our extensive simulations show that by cross-layer optimization, more shorter paths are found, resulting in shorter average path length, yet without causing much energy consumption. On top of these, a considerable increase of the network sleep rate is achieved. Copyright © 2014 John Wiley & Sons, Ltd.

A Survey on Internet Multipath Routing and Provisioning

Abstract: Utilizing the dormant path diversity through multipath routing in the Internet to reach end users—thereby fulfilling their QoS requirements—is rather logical. While offering better resource utilization, better reliability, and often even much better quality of experience (QoE), multipath routing and provisioning was shown to help network and data center operators achieve traffic engineering in the form of load balancing. In this survey, we first highlight the benefits and basic Internet multipath routing components. We take a top-down approach and review various multipath protocols, from application to link and physical layers, operating at different parts of the Internet. We also describe the mathematical foundations of the multipath operation, as well as highlight the issues and challenges pertaining to reliable data delivery, buffering, and security in deploying multipath provisioning in the Internet. We compare the benefits and drawbacks of these protocols operating at different Internet layers and discuss open issues and challenges.

A Survey on Centralised and Distributed Clustering Routing Algorithms for WSNs

Abstract: Wireless sensor networks have a wide range of applications because they can be adapted for various environments. They can operate independently in harsh places where a human presence is risky or even impossible. Since their life time is dependent on their batteries and replacing or recharging their batteries is impossible in rough places, it is necessary to find energy efficient routing protocols for them. In this paper, a number of well-know energy efficient routing algorithms for WSNs have been classified and presented based on their attributes.

SDN-Based Routing for Efficient Message Propagation in VANET

Abstract: Vehicular Ad hoc Network (VANET) is an intermittently connected mobile network in which message propagation is quite challenging. Conventional routing protocols proposed for VANET are usually in greedy or optimum fashion. Geographical forwarding only uses local information to make the routing decision which may lead to long packet delay, while link-based forwarding has better performance but requires much more overheads. To disseminate message efficiently in VANET, a routing protocol which has both short delivery delay time and low routing overhead is required. In this paper, we proposed a SDN-based routing framework for efficiently message propagation in VANET. Software-Defined Networking (SDN) is an emerging technology that decouples the control plane from the data forwarding plane in switches and collects all the control planes into a central controller. In SDN-based routing framework, the central controller gathers network information from switches and computes optimal routing paths for switches based on the global network information. Since switches don’t need to exchange routing information with each other, the routing overhead is much lower. This paper is the first to propose a SDN-based routing framework for efficiently message propagation in VANET. A new algorithm is developed to find the global optimal route from the source to the destination in VANET with dynamic network density. We demonstrate, through the simulation results, that our proposed framework significantly outperforms the related protocols in terms of both delivery delay time and routing overhead.

Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath

Abstract: 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.

A Multi-Agent Framework for Packet Routing in Wireless Sensor Networks

Abstract: Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage.

TERP: a trust and energy aware routing protocol for wireless sensor network

Abstract: In most of the applications of wireless sensor networks (WSNs), nodes operate in unattended environments and are, therefore, vulnerable to variety of attacks. Due to dynamic and unpredictable changing behavior of nodes, the reliable data delivery is a challenging task. For WSNs, the traditional cryptographic and authentication-based solutions cannot be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust-based solutions have proved to be more effective to address nodes' misbehavior attacks. However, the existing solutions give rise to high energy consumption and control overheads in pursuit of trust estimation and network-wide dissemination, which not only adds to network congestion but also undermines network lifetime. In this paper, we present a trust and energy aware routing protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving and faulty nodes. Moreover, TERP incorporates a composite routing function that encompasses trust, residual-energy, and hopcounts of neighbor nodes in making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes, while routing data using shorter paths. The simulation results demonstrate reduced energy consumption, improved throughout and network lifetime of TERP when compared with the existing work.

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

Abstract: Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

Application of reinforcement learning to routing in distributed wireless networks: a review

Abstract: The dynamicity of distributed wireless networks caused by node mobility, dynamic network topology, and others has been a major challenge to routing in such networks. In the traditional routing schemes, routing decisions of a wireless node may solely depend on a predefined set of routing policies, which may only be suitable for a certain network circumstances. Reinforcement Learning (RL) has been shown to address this routing challenge by enabling wireless nodes to observe and gather information from their dynamic local operating environment, learn, and make efficient routing decisions on the fly. In this article, we focus on the application of the traditional, as well as the enhanced, RL models, to routing in wireless networks. The routing challenges associated with different types of distributed wireless networks, and the advantages brought about by the application of RL to routing are identified. In general, three types of RL models have been applied to routing schemes in order to improve network performance, namely Q-routing, multi-agent reinforcement learning, and partially observable Markov decision process. We provide an extensive review on new features in RL-based routing, and how various routing challenges and problems have been approached using RL. We also present a real hardware implementation of a RL-based routing scheme. Subsequently, we present performance enhancements achieved by the RL-based routing schemes. Finally, we discuss various open issues related to RL-based routing schemes in distributed wireless networks, which help to explore new research directions in this area. Discussions in this article are presented in a tutorial manner in order to establish a foundation for further research in this field.

Investigating Interdomain Routing Policies in the Wild

Abstract: Models of Internet routing are critical for studies of Internet security, reliability and evolution, which often rely on simulations of the Internet's routing system. Accurate models are difficult to build and suffer from a dearth of ground truth data, as ISPs often treat their connectivity and routing policies as trade secrets. In this environment, researchers rely on a number of simplifying assumptions and models proposed over a decade ago, which are widely criticized for their inability to capture routing policies employed in practice.In this study we put Internet topologies and models under the microscope to understand where they fail to capture real routing behavior. We measure data plane paths from thousands of vantage points, located in eyeball networks around the globe, and find that between 14-35% of routing decisions are not explained by existing models. We then investigate these cases, and identify root causes such as selective prefix announcement, misclassification of undersea cables, and geographic constraints. Our work highlights the need for models that address such cases, and motivates the need for further investigation of evolving Internet connectivity.

Corrections to "Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering"

Abstract: Presents corrections to the paper, “Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering,” (Xu, D., et al)IEEE/ACM Trans. Netw., vol. 19, no. 6, pp. 1717–1730, Dec. 2011).

Dynamic information routing in complex networks

Abstract: Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

Cluster Based Multipath Routing Protocol for Wireless Sensor Networks

Abstract: Wireless Sensor Network (WSN) consists of low power sensor nodes. Energy is the main constraint associated with the sensor nodes. In this paper, we propose a cluster based multipath routing protocol, which uses the clustering and multipath techniques to reduce energy consumption and increase the reliability. The basic idea is to reduce the load of the sensor node by giving more responsibility to the base station (sink). We have implemented and compared the protocol with existing protocols and found that it is more energy-efficient and reliable.

Secure and Reliable Routing Protocols for Heterogeneous Multihop Wireless Networks

Abstract: In this paper, we propose E-STAR for establishing stable and reliable routes in heterogeneous multihop wireless networks. E-STAR combines payment and trust systems with a trust-based and energy-aware routing protocol. The payment system rewards the nodes that relay others’ packets and charges those that send packets. The trust system evaluates the nodes’ competence and reliability in relaying packets in terms of multi-dimensional trust values. The trust values are attached to the nodes’ public-key certificates to be used in making routing decisions. We develop two routing protocols to direct traffic through those highly-trusted nodes having sufficient energy to minimize the probability of breaking the route. By this way, E-STAR can stimulate the nodes not only to relay packets, but also to maintain route stability and report correct battery energy capability. This is because any loss of trust will result in loss of future earnings. Moreover, for the efficient implementation of the trust system, the trust values are computed by processing the payment receipts. Analytical results demonstrate that E-STAR can secure the payment and trust calculation without false accusations. Simulation results demonstrate that our routing protocols can improve the packet delivery ratio and route stability.

A distributed algorithm for energy efficient and fault tolerant routing in wireless sensor networks

Abstract: Energy conservation and fault tolerance are the most two important challenging issues for the development of large scale wireless sensor networks (WSNs). Failure of cluster heads in a cluster based WSN is more catastrophic as they are responsible not only for data aggregation and transmission of the aggregated data to the base station but also relaying data for multi-hop communication. Therefore, a routing algorithm in WSNs should be energy aware as well as fault tolerant. In this paper, we present a distributed energy efficient and fault tolerant routing algorithm for WSNs. The algorithm selects next-hop cluster head in energy efficient manner in the data routing phase and carefully restores the connectivity of the neighbours of a cluster head in case of its failure. The algorithm is tested extensively by considering several scenarios of WSN. The experimental results are compared with the existing algorithms in terms of several metrics to show the effectiveness of the proposed algorithm.

On design and deployment of fuzzy-based metric for routing in low-power and lossy networks

Abstract: Minimizing the energy consumption and hence extending the network lifetime is a key requirement when designing an efficient sensor network protocol. QoS-aware routing in Wireless Sensor Network (WSN), aims to take into account other networks performance aspects as minimizing end-to-end delay (as well as jitter), reducing packet loss rate and minimizing the energy consumption of the network during data transmission. These objectives are sometimes conflicting therefore tradeoffs must be made between energy conservation and QoS considerations. The general problem can be reformulated as a Multi-Constrained Optimal Path problem (MCOP) which is known as NP-complete. The latter raises a real challenge as sensor nodes are very limited in resources capabilities. We propose to use fuzzy inference mechanism to seek a good tradeoff between all given metrics and constraints. This paper discusses the implementation of combining several routing metric using fuzzy logic to design a RPL objective function, the routing standard for the Internet of Things. The proposal is integrated on Contiki operating system, the deployment was performed on a real world indoor WSN. Obtained results show improvements compared to the common implementation of the RPL protocol and demonstrate relevance of our contribution.