Showing papers on "Multipath routing published in 2017"
22 May 2017
TL;DR: This paper presents the first taxonomy of routing attacks and their impact on Bitcoin, considering both small-scale attacks, targeting individual nodes, and large-scale attack, targeting the network as a whole, and demonstrates the feasibility of each attack against the deployed Bitcoin software.
Abstract: As the most successful cryptocurrency to date, Bitcoin constitutes a target of choice for attackers. While many attack vectors have already been uncovered, one important vector has been left out though: attacking the currency via the Internet routing infrastructure itself. Indeed, by manipulating routing advertisements (BGP hijacks) or by naturally intercepting traffic, Autonomous Systems (ASes) can intercept and manipulate a large fraction of Bitcoin traffic.This paper presents the first taxonomy of routing attacks and their impact on Bitcoin, considering both small-scale attacks, targeting individual nodes, and large-scale attacks, targeting the network as a whole. While challenging, we show that two key properties make routing attacks practical: (i) the efficiency of routing manipulation; and (ii) the significant centralization of Bitcoin in terms of mining and routing. Specifically, we find that any network attacker can hijack few (<100) BGP prefixes to isolate ∼50% of the mining power—even when considering that mining pools are heavily multi-homed. We also show that on-path network attackers can considerably slow down block propagation by interfering with few key Bitcoin messages.We demonstrate the feasibility of each attack against the deployed Bitcoin software. We also quantify their effectiveness on the current Bitcoin topology using data collected from a Bitcoin supernode combined with BGP routing data. The potential damage to Bitcoin is worrying. By isolating parts of the network or delaying block propagation, attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of exploits such as double spending. To prevent such effects in practice, we provide both short and long-term countermeasures, some of which can be deployed immediately.
362 citations
TL;DR: Results of a preliminary investigation into design issues affecting the development of strategic multipath routing protocols that support multimedia data in WMSNs are presented and discussed from the network application perspective.
Abstract: The vision of wireless multimedia sensor networks (WMSNs) is to provide real-time multimedia applications using wireless sensors deployed for long-term usage. Quality of service assurances for both best effort data and real-time multimedia applications introduced new challenges in prioritizing multipath routing protocols in WMSNs. Multipath routing approaches with multiple constraints have received considerable research interest. In this paper, a comprehensive survey of both best effort data and real-time multipath routing protocols for WMSNs is presented. Results of a preliminary investigation into design issues affecting the development of strategic multipath routing protocols that support multimedia data in WMSNs are also presented and discussed from the network application perspective.
195 citations
TL;DR: This work proposes a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols and demonstrates the superiority of this approach compared with both clustering and non-clustering based routing protocols.
Abstract: Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes (vehicles) in VANETs. To exploit the unique characteristics of VANET nodes, we design a moving-zone based architecture in which vehicles collaborate with one another to form dynamic moving zones so as to facilitate information dissemination. We propose a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols. The results of extensive simulation studies carried out on real road maps demonstrate the superiority of our approach compared with both clustering and non-clustering based routing protocols.
193 citations
TL;DR: This paper explicitly considers path selection in the road network as an integrated decision in the time-dependent vehicle routing problem, denoted as path flexibility (PF), and employs a Route-Path approximation method generating near-optimal solutions for the TDVRP–PF under stochastic traffic conditions.
Abstract: Conventionally, vehicle routing problems are defined on a network in which the customer locations and arcs are given. Typically, these arcs somehow represent the distances or expected travel time derived from the underlying road network. When executed, the quality of the solutions obtained from the vehicle routing problem depends largely on the quality of the road network representation. This paper explicitly considers path selection in the road network as an integrated decision in the time-dependent vehicle routing problem, denoted as path flexibility (PF). This means that any arc between two customer nodes has multiple corresponding paths in the road network (geographical graph). Hence, the decisions to make are involving not only the routing decision but also the path selection decision depending upon the departure time at the customers and the congestion levels in the relevant road network. The corresponding routing problem is a time-dependent vehicle routing problem with path flexibility (TDVRP–PF). We formulate the TDVRP–PF models under deterministic and stochastic traffic conditions. We derive important insights, relationships, and solution structures. Based on a representative testbed of instances (inspired on the road network of Beijing), significant savings are obtained in terms of cost and fuel consumption, by explicitly considering path flexibility. Having both path flexibility and time-dependent travel time seems to be a good representation of a wide range of stochasticity and dynamics in the travel time, and path flexibility serves as a natural recourse under stochastic conditions. Exploiting this observation, we employ a Route-Path approximation method generating near-optimal solutions for the TDVRP–PF under stochastic traffic conditions.
166 citations
TL;DR: Simulation results show that new ant algorithm can effectively save the energy of nodes and prolong the network lifetime.
Abstract: How to make efficient data routing in energy constrained wireless sensor networks (WSNs) is one of the key points. In order to find the optimal path of data transmission in the WSNs, a new routing algorithm based on ant colony algorithm is proposed. Using the improved heuristic function and considering the node communication transmission distance, transmission direction, and residual energy, an optimal path from the source node to the destination node can be found. Thus, the network energy consumption is reduced and the network lifetime is prolonged. Simulation results show that new ant algorithm can effectively save the energy of nodes and prolong the network lifetime.
163 citations
TL;DR: This paper mathematically formulate the routing selection issue as a constrained optimization problem and proposes an ant colony optimization (ACO)-based algorithm to solve this problem, and a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion.
Abstract: Developing highly efficient routing protocols for vehicular ad hoc networks (VANETs) is a challenging task, mainly due to the special characters of such networks: large-scale sizes, frequent link disconnections, and rapid topology changes. In this paper, we propose an adaptive quality-of-service (QoS)-based routing for VANETs called AQRV. This new routing protocol adaptively chooses the intersections through which data packets pass to reach the destination, and the selected route should satisfy the QoS constraints and fulfil the best QoS in terms of three metrics, namely connectivity probability, packet delivery ratio (PDR), and delay. To achieve the given objectives, we mathematically formulate the routing selection issue as a constrained optimization problem and propose an ant colony optimization (ACO)-based algorithm to solve this problem. In addition, a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion. Moreover, to decrease network overhead, we propose local QoS models (LQMs) to estimate real time and complete QoS of urban road segments. Simulation results validate our derived LQM models and show the effectiveness of AQRV.
151 citations
TL;DR: The results clearly demonstrate that the proposed FF-AOMDV outperformed AomDV and AOMR-LM under majority of the network performance metrics and parameters.
Abstract: Mobile ad hoc network (MANET) is a collection of wireless mobile nodes that dynamically form a temporary network without the reliance of any infrastructure or central administration Energy consumption is considered as one of the major limitations in MANET, as the mobile nodes do not possess permanent power supply and have to rely on batteries, thus reducing network lifetime as batteries get exhausted very quickly as nodes move and change their positions rapidly across MANET This paper highlights the energy consumption in MANET by applying the fitness function technique to optimize the energy consumption in ad hoc on demand multipath distance vector (AOMDV) routing protocol The proposed protocol is called AOMDV with the fitness function (FF-AOMDV) The fitness function is used to find the optimal path from source node to destination node to reduce the energy consumption in multipath routing The performance of the proposed FF-AOMDV protocol has been evaluated by using network simulator version 2, where the performance was compared with AOMDV and ad hoc on demand multipath routing with life maximization (AOMR-LM) protocols, the two most popular protocols proposed in this area The comparison was evaluated based on energy consumption, throughput, packet delivery ratio, end-to-end delay, network lifetime and routing overhead ratio performance metrics, varying the node speed, packet size, and simulation time The results clearly demonstrate that the proposed FF-AOMDV outperformed AOMDV and AOMR-LM under majority of the network performance metrics and parameters
150 citations
Posted Content•
TL;DR: A collaborative multi-agent reinforcement learning (MARL) approach is employed to jointly train the router and function blocks of a routing network, a kind of self-organizing neural network consisting of a router and a set of one or more function blocks.
Abstract: Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network - for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when a fixed recursion depth is reached. In this way the routing network dynamically composes different function blocks for each input. We employ a collaborative multi-agent reinforcement learning (MARL) approach to jointly train the router and function blocks. We evaluate our model against cross-stitch networks and shared-layer baselines on multi-task settings of the MNIST, mini-imagenet, and CIFAR-100 datasets. Our experiments demonstrate a significant improvement in accuracy, with sharper convergence. In addition, routing networks have nearly constant per-task training cost while cross-stitch networks scale linearly with the number of tasks. On CIFAR-100 (20 tasks) we obtain cross-stitch performance levels with an 85% reduction in training time.
146 citations
TL;DR: This paper studies how UAVs operating in ad hoc mode can cooperate with VANET on the ground so as to assist in the routing process and improve the reliability of the data delivery by bridging the communication gap whenever it is possible.
145 citations
Posted Content•
TL;DR: A Deep-Reinforcement Learning agent that optimizes routing that adapts automatically to current traffic conditions and proposes tailored configurations that attempt to minimize the network delay is designed and evaluated.
Abstract: In this paper we design and evaluate a Deep-Reinforcement Learning agent that optimizes routing. Our agent adapts automatically to current traffic conditions and proposes tailored configurations that attempt to minimize the network delay. Experiments show very promising performance. Moreover, this approach provides important operational advantages with respect to traditional optimization algorithms.
132 citations
TL;DR: This paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs and presents a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications.
Abstract: Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.
TL;DR: The state of the art of void-handling techniques proposed by underwater geographic greedy routing protocols, along with the recent advances, are reviewed and a qualitative comparison of these techniques is presented.
Abstract: From the view of routing protocols in underwater sensor networks (UWSNs), the presence of communication void, where the packet cannot be forwarded further using the greedy mode, is perhaps the most challenging issue. In this paper, we review the state of the art of void-handling techniques proposed by underwater geographic greedy routing protocols. To this, we first review the void problem and its negative impact on the category of the geographic greedy routing protocols, which does not entail any void recovery technique. It is followed by a discussion about the constraints, challenges, and features associated with the design of void-handling techniques in UWSNs. Afterward, currently available void-handling techniques in UWSNs are classified and investigated. They can be classified into two main categories: 1) location-based and 2) depth-based techniques. The advantages and disadvantages of each technique along with the recent advances are then presented. Finally, we present a qualitative comparison of these techniques and also discuss some possible future directions.
TL;DR: This work investigates the problem of developing optimal joint routing and caching policies in a network supporting in-network caching with the goal of minimizing expected content-access delay and identifies the structural property of the user-cache graph that makes the problem NP-complete.
Abstract: In-network content caching has been deployed in both the Internet and cellular networks to reduce content-access delay. We investigate the problem of developing optimal joint routing and caching policies in a network supporting in-network caching with the goal of minimizing expected content-access delay. Here, needed content can either be accessed directly from a back-end server (where content resides permanently) or be obtained from one of multiple in-network caches. To access content, users must thus decide whether to route their requests to a cache or to the back-end server. In addition, caches must decide which content to cache. We investigate two variants of the problem, where the paths to the back-end server can be considered as either congestion-sensitive or congestion-insensitive, reflecting whether or not the delay experienced by a request sent to the back-end server depends on the request load, respectively. We show that the problem of optimal joint caching and routing is NP-complete in both cases. We prove that under the congestion-insensitive delay model, the problem can be solved optimally in polynomial time if each piece of content is requested by only one user, or when there are at most two caches in the network. We also identify the structural property of the user-cache graph that makes the problem NP-complete. For the congestion-sensitive delay model, we prove that the problem remains NP-complete even if there is only one cache in the network and each content is requested by only one user. We show that approximate solutions can be found for both cases within a $(1-1/e)$ factor from the optimal, and demonstrate a greedy solution that is numerically shown to be within 1% of optimal for small problem sizes. Through trace-driven simulations, we evaluate the performance of our greedy solutions to joint caching and routing, which show up to 50% reduction in average delay over the solution of optimized routing to least recently used caches.
TL;DR: A survey of the existing single-layer and cross-layer routing techniques in VANETs is presented, emphasizing on cross- layer routing protocols that utilize information at the physical, medium access control and network layers as routing parameters.
Abstract: Vehicular ad-hoc networks (VANETs) play an important role in intelligent transportation systems for improving security and efficiency. However, due to dynamic characteristics of the vehicular environment, routing remains a significant challenge in the VANETs. While single-layer routing protocols based on the traditional layered open systems interconnection (OSI) model are readily available, they often do not make use of important parameters at the lower three layers of the OSI model when making routing decision. Hence, for making optimal routing decision to gain superior network performance, there is a need to design cross-layer routing that allows information exchange between layers. In this article, a survey of the existing single-layer and cross-layer routing techniques in VANETs is presented, emphasizing on cross-layer routing protocols that utilize information at the physical, medium access control and network layers as routing parameters. An overview and challenges of routing are given, followed by a brief discussion of single-layer routing with more focus on geographic routing. Cross-layer routing protocols are then discussed in detail. The article then elaborates on some advantages and disadvantages of the existing routing approaches, cross-layer routing parameter selection and cross-layer design issues. Finally, some open research challenges in developing efficient routing protocols in the VANETs are highlighted.
TL;DR: The paper solves the problem of the premature end of network lifetime in applications where the base station (BS) is far from the Region Of Interest (ROI) and proposes two distributed, energy-efficient, and connectivity-aware routing protocols for solving the routing hole problem.
TL;DR: The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET is proposed.
Abstract: A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.
TL;DR: A geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP), which alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.
Abstract: This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.
TL;DR: The results indicate the superiority of the multi-swarm and fully PMSO with constriction coefficient, which record an average improvement over CPSO equal to 88.45% in terms of sensors’ count, and 89.15% and 86.51% under the ring and mesh topologies.
Abstract: Internet of Things (IoTs) refers to the rapidly growing network of connected objects and people that are able to collect and exchange data using embedded sensors. To guarantee the connectivity among these objects and people, fault tolerance routing has to be significantly considered. In this paper, we propose a bio-inspired particle multi-swarm optimization (PMSO) routing algorithm to construct, recover, and select $k$ -disjoint paths that tolerates the failure while satisfying the quality of service parameters. Multi-swarm strategy enables determining the optimal directions in selecting the multipath routing while exchanging messages from all positions in the network. The validity of the proposed algorithm is assessed and results demonstrate high-quality solutions compared with the canonical particle swarm optimization (CPSO). Our results indicate the superiority of the multi-swarm and fully PMSO with constriction coefficient, which record an average improvement over CPSO equal to 88.45% in terms of sensors’ count, and 89.15% and 86.51% under the ring and mesh topologies, respectively.
21 May 2017
TL;DR: This paper presents a new proposal to implement an intelligent routing protocol in a SDN topology based on the reinforcement learning process that allows choosing the best data transmission paths according to the best criteria andbased on the network status.
Abstract: Software defined network (SDN) is one of the most interesting research topic that is currently being investigated. The inclusion of artificial intelligence (AI) can improve the performance of routing protocols. Nowadays the application of AI over routing protocols is only applied to real devices, especially in wireless sensor nodes. In this paper, we present a new proposal to implement an intelligent routing protocol in a SDN topology. The intelligent routing protocol is based on the reinforcement learning process that allows choosing the best data transmission paths according to the best criteria and based on the network status.
01 Nov 2017
TL;DR: An efficient particle-encoding scheme is developed and a multi-objective fitness function for each of the proposed routing and clustering algorithms for WSNs is derived, which builds a trade-off between energy efficiency and energy balancing.
Abstract: Many schemes have been proposed for energy-efficient routing in wireless sensor networks (WSNs). However, most of these algorithms focus only on energy efficiency in which each node finds a shortest path to the base station (BS), but remain silent about energy balancing which is equally important to prolong the network lifetime. In this paper, we propose particle swarm optimization-based routing and clustering algorithms for WSNs. The routing algorithm builds a trade-off between energy efficiency and energy balancing, whereas the clustering algorithm takes care of the energy consumption of gateways as well as sensor nodes. We develop an efficient particle-encoding scheme and derive a multi-objective fitness function for each of the proposed routing and clustering algorithms. The algorithms are also capable of tolerating the failure of cluster heads. We perform extensive simulations on the proposed schemes and the results are compared with the existing algorithms to demonstrate their superiority in terms of various performance metrics.
TL;DR: An overview of most recent reliable, energy efficient, scalable, fault tolerant, and QoS based hybrid routing mechanisms and point to directions for future research and development are provided.
TL;DR: SCOTRES is proposed—a trust-based system for secure routing in ad-hoc networks which advances the intelligence of network entities by applying five novel metrics and provides the highest level of protection while retaining efficiency for real application deployments.
Abstract: Wireless ad-hoc networks are becoming popular due to the emergence of the Internet of Things and cyber-physical systems (CPSs). Due to the open wireless medium, secure routing functionality becomes important. However, the current solutions focus on a constrain set of network vulnerabilities and do not provide protection against newer attacks. In this paper, we propose SCOTRES—a trust-based system for secure routing in ad-hoc networks which advances the intelligence of network entities by applying five novel metrics. The energy metric considers the resource consumption of each node, imposing similar amount of collaboration, and increasing the lifetime of the network. The topology metric is aware of the nodes’ positions and enhances load-balancing. The channel-health metric provides tolerance in periodic malfunctioning due to bad channel conditions and protects the network against jamming attacks. The reputation metric evaluates the cooperation of each participant for a specific network operation, detecting specialized attacks, while the trust metric estimates the overall compliance, safeguarding against combinatorial attacks. Theoretic analysis validates the security properties of the system. Performance and effectiveness are evaluated in the network simulator 2, integrating SCOTRES with the DSR routing protocol. Similar schemes are implemented using the same platform in order to provide a fair comparison. Moreover, SCOTRES is deployed on two typical embedded system platforms and applied on real CPSs for monitoring environmental parameters of a rural application on olive groves. As is evident from the above evaluations, the system provides the highest level of protection while retaining efficiency for real application deployments.
TL;DR: A novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time.
Abstract: The energy constraint is one of the inherent defects of the Wireless Sensor Networks (WSNs). How to prolong the lifespan of the network has attracted more and more attention. Numerous achievements have emerged successively recently. Among these mechanisms designing routing protocols is one of the most promising ones owing to the large amount of energy consumed for data transmission. The background and related works are described firstly in detail in this paper. Then a game model for selecting the Cluster Head is presented. Subsequently, a novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed. GEEC, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time. Finally, extensive simulation experiments are conducted. The experimental results indicate that a significant improvement in energy balance as well as in energy conservation compared with other two kinds of well-known clustering routing protocols is achieved.
TL;DR: Experimental results show that in comparison against the original RPL, the E2HRC routing protocol more effectively balances wireless sensor network energy consumption, thus decreasing both node energy consumption and the number of control messages.
Abstract: A heterogeneous ring domain communication topology with equal area in each ring is presented in this paper in an effort to solve the energy balance problem in original IPv6 routing protocol for low power and lossy networks (RPL). A new clustering algorithm and event-driven cluster head rotation mechanism are also proposed based on this topology. The clustering information announcement message and clustering acknowledgment message were designed according to RFC and original RPL message structure. An energy-efficient heterogeneous ring clustering (E2HRC) routing protocol for wireless sensor networks is then proposed and the corresponding routing algorithms and maintenance methods are established. Related messages are analyzed in detail. Experimental results show that in comparison against the original RPL, the E2HRC routing protocol more effectively balances wireless sensor network energy consumption, thus decreasing both node energy consumption and the number of control messages.
TL;DR: Simulation results show that the approach proposed in this paper significantly improves the packet received ratio, energy consumption, and average end-to-end delay of the sensor node.
Abstract: Modern multimedia sensor networks impose strict constraints on both the delay and energy consumption when time-critical data must be reported to the sink within a limited bandwidth without any loss. Failure to transmit an event to the sink occurs for many reasons, including inherence limitations of sensors, power consumption, and reliability. We propose a mathematical model for a novel quality-of-service (QoS) routing-determination method. The proposed scheme enables determining the optimal path to provide appropriate shared radio satisfying the QoS for a wide range of real-time intensive media. The mathematical model is based on the Lagrangian relaxation method, to control adaptive switching of hop-by-hop QoS routing protocols. The embedded criteria for each objective function are used to decide which path from source to sink will be selected. Simulation results show that, compared with existing routing protocols, the approach proposed in this paper significantly improves the packet received ratio, energy consumption, and average end-to-end delay of the sensor node.
TL;DR: The core ideas of this research paper will guide the researchers to further research in the field of UWSN routing protocols based on node mobility by comparing the proposed routing protocols through architectural parameters and performance characteristics parameters.
TL;DR: A novel protocol that uses Q-learning-based geographic routing (QGeo) to improve the network performance of unmanned robotic networks and finds that QGeo has a higher packet delivery ratio and a lower network overhead than existing methods.
Abstract: This letter proposes a novel protocol that uses Q-learning-based geographic routing (QGeo) to improve the network performance of unmanned robotic networks. A rapid and reliable network is essential for the remote control and monitoring of mobile robotic devices. However, controlling the network overhead required for route selection and repair is still a notable challenge, owing to high mobility of the devices. To alleviate this problem, we propose a machine-learning-based geographic routing scheme to reduce network overhead in high-mobility scenarios. We evaluate the performance of QGeo in comparison with other methods using the NS-3 simulator. We find that QGeo has a higher packet delivery ratio and a lower network overhead than existing methods.
13 Jun 2017
TL;DR: Heuristics are presented to find suboptimal feasible solutions that require much less computation time in a Persistent Intelligence, Surveillance and Reconnaissance routing problem, and their performance is compared with respect to the optimal cost and computation time.
Abstract: We consider a Persistent Intelligence, Surveillance and Reconnaissance (PISR) routing problem, which includes collecting data from a set of specified task locations and delivering that data to a control station. Each task is assigned a refresh rate based on its priority, where higher priority tasks require higher refresh rates. The UAV team's objective is to minimize the maximum of the delivery times of all the tasks' data to the control station, while simultaneously, satisfying each task's revisit period constraint. The centralized path planning problem for this PISR routing problem is formulated using mixed integer linear programming and solved using a branch-and-cut algorithm. Heuristics are presented to find suboptimal feasible solutions that require much less computation time. The algorithms are tested on several instances and their performance is compared with respect to the optimal cost and computation time.
TL;DR: This paper proposes an energy-efficient routing protocol for heterogeneous WSNs to support the delay sensitive, bandwidth hungry, time-critical, and QoS-aware applications and outperforms other state-of-the-art schemes in terms of the delay performances.
Abstract: Wireless sensor networks (WSNs) have gained much attention in today’s research domain for supporting a wide variety of applications including the multimedia applications. Multimedia applications that are regarded as the quality-of-service (QoS)-aware, delay sensitive, and bandwidth hungry applications require enough energy and communication resources. WSNs being the energy-scarce network have now been designed in such a way that they can support these delay-sensitive and time-critical applications. In this paper, we propose an energy-efficient routing protocol for heterogeneous WSNs to support the delay sensitive, bandwidth hungry, time-critical, and QoS-aware applications. The proposed QoS-aware and heterogeneously clustered routing (QHCR) protocol not only conserves the energy in the network, but also provides the dedicated paths for the real-time and delay sensitive applications. The inclusion of different energy-levels for the heterogeneous WSNs also provides the stability in the networks while minimizing the delay for the delay-sensitive applications. Extensive simulations have been performed to validate the effectiveness of our proposed scheme. Our proposed routing scheme outperforms other state-of-the-art schemes in terms of the delay performances.
TL;DR: ORR, an opportunistic routing protocol that addresses the two issues of sender wait time and redundant packet forwarding, is proposed and is proven to avoid loops and shown to achieve longer network lifetime compared to other protocols regardless of duty cycle and network topology.
Abstract: In duty-cycled wireless sensor networks running asynchronous MAC protocols, the time when a sender waits for its receiver to wake up and receive the packet is the major source of energy consumption. Opportunistic routing can reduce the sender wait time by allowing multiple candidate receivers, but by doing that it suffers from redundant packet forwarding due to multiple receivers waking up at the same time. Thus, the number of forwarders should be controlled in a way that overall forwarding cost is minimized considering both sender wait time and cost of redundant packet forwarding. Also, in order to prolong network lifetime, candidate forwarders should be selected so that load is balanced among nodes. We propose ORR, an opportunistic routing protocol that addresses the two issues. First, the optimal number of forwarders is calculated based on forwarding cost estimation, which is derived from duty cycle and network topology. Second, the metric used for selecting forwarders considers residual energy so that more traffic is guided through nodes with larger remaining energy. The resulting routing protocol is proven to avoid loops and shown to achieve longer network lifetime compared to other protocols regardless of duty cycle and network topology.