Showing papers on "Link-state routing protocol published in 2016"

ActiveTrust: Secure and Trustable Routing in Wireless Sensor Networks

Abstract: Wireless sensor networks (WSNs) are increasingly being deployed in security-critical applications Because of their inherent resource-constrained characteristics, they are prone to various security attacks, and a black hole attack is a type of attack that seriously affects data collection To conquer that challenge, an active detection-based security and trust routing scheme named ActiveTrust is proposed for WSNs The most important innovation of ActiveTrust is that it avoids black holes through the active creation of a number of detection routes to quickly detect and obtain nodal trust and thus improve the data route security More importantly, the generation and the distribution of detection routes are given in the ActiveTrust scheme, which can fully use the energy in non-hotspots to create as many detection routes as needed to achieve the desired security and energy efficiency Both comprehensive theoretical analysis and experimental results indicate that the performance of the ActiveTrust scheme is better than that of the previous studies ActiveTrust can significantly improve the data route success probability and ability against black hole attacks and can optimize network lifetime

Dynamic Routing for Flying Ad Hoc Networks

Abstract: This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive, and fast to deploy. This makes them a very attractive technology for many civilian and military applications. Due to the high mobility of the nodes, maintaining a communication link between the UAVs is a challenging task. The topology of these networks is more dynamic than that of typical mobile ad hoc networks (MANETs) and of typical vehicle ad hoc networks. As a consequence, the existing routing protocols designed for MANETs partly fail in tracking network topology changes. In this paper, we compare two different routing algorithms for ad hoc networks: optimized link-state routing (OLSR) and predictive OLSR (P-OLSR). The latter is an OLSR extension that we designed for FANETs; it takes advantage of the Global Positioning System (GPS) information available on board. To the best of our knowledge, P-OLSR is currently the only FANET-specific routing technique that has an available Linux implementation. We present results obtained by both media-access-control (MAC) layer emulations and real-world experiments. In the experiments, we used a testbed composed of two autonomous fixed-wing UAVs and a node on the ground. Our experiments evaluate the link performance and the communication range, as well as the routing performance. Our emulation and experimental results show that P-OLSR significantly outperforms OLSR in routing in the presence of frequent network topology changes.

A survey on position-based routing for vehicular ad hoc networks

Abstract: Position-based routing is considered to be a very promising routing strategy for communication within vehicular ad hoc networks (VANETs), due to the fact that vehicular nodes can obtain position information from onboard global positioning system receivers and acquire global road layout information from an onboard digital map. Position-based routing protocols, which are based mostly on greedy forwarding, are well-suited to the highly dynamic and rapid-changing network topology of VANETs. In this paper, we outline the background and the latest development in VANETs and survey the state-of-the-art routing protocols previously used in VANETs. We present the pros and cons for each routing protocol, and make a detailed comparison. We also discuss open issues, challenges and future research directions. It is observed that a hybrid routing protocol is the best choice for VANETs in both urban and highway environments.

Routing in Delay Tolerant Network

Abstract: At present, the internet has grown exponentially due to its wide connectivity with different sets of devices. The only issue is the tolerances towards delay which leads to disconnection in case the delay is above tolerance level. Delay Tolerant Network (DTN) is the latest development to sustain longer delays by allowing disconnected operations. Among the various problems like buffering, resources allocation and energy consumption, routing is a major issue. The present study reviews many proposals regarding routing problem and its solution and the state of the art analysis is presented. General Terms Networks, delay, flooding, forwarding.

Spatial Reusability-Aware Routing in Multi-Hop Wireless Networks

Abstract: In the problem of routing in multi-hop wireless networks, to achieve high end-to-end throughput, it is crucial to find the “best” path from the source node to the destination node. Although a large number of routing protocols have been proposed to find the path with minimum total transmission count/time for delivering a single packet, such transmission count/time minimizing protocols cannot be guaranteed to achieve maximum end-to-end throughput. In this paper, we argue that by carefully considering spatial reusability of the wireless communication media, we can tremendously improve the end-to-end throughput in multi-hop wireless networks. To support our argument, we propose spatial reusability-aware single-path routing (SASR) and anypath routing (SAAR) protocols, and compare them with existing single-path routing and anypath routing protocols, respectively. Our evaluation results show that our protocols significantly improve the end-to-end throughput compared with existing protocols. Specifically, for single-path routing, the median throughput gain is up to 60 percent, and for each source-destination pair, the throughput gain is as high as $5.3\times$ ; for anypath routing, the maximum per-flow throughput gain is 71.6 percent, while the median gain is up to 13.2 percent.

A Survey on Underwater Acoustic Sensor Network Routing Protocols

Abstract: Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research.

Collaborative Multi-hop Routing in Cognitive Wireless Networks

Abstract: The collaboration of nodes in cognitive wireless networks is a large challenge This paper studies the collaborative multi-hop routing in cognitive networks We propose a new algorithm to construct the collaborative routing in multi-hop cognitive networks Our algorithm takes into account the interference among nodes including primary and secondary users The clustering and collaboration are exploited to improve the performance of collaborative routing in multi-hop cognitive wireless networks with multiple primary and secondary users By analyzing the maximum transmission distance, collaborations, transmission angle control and power control, and channel allocation, we propose a new clustering-based collaborative multi-hop cognitive routing algorithm to attain better network performance Simulation results show that our approach is feasible and effective

Priority-Based Data Gathering Framework in UAV-Assisted Wireless Sensor Networks

Abstract: This paper proposes a novel data acquisition framework in sensor networks using an unmanned aerial vehicle (UAV) with the goal of increasing the efficiency of the data gathering efforts. To maximize the system throughput, we introduce a priority-based frame selection scheme to suppress the number of redundant data transmissions between sensor nodes and the UAV. Toward this goal, we classify the nodes inside the UAV's coverage area into different frames according to their locations. Taking advantage of the mobility of the UAV, we assign different transmission priorities to nodes in different frames. To do that, we introduce an adjustment to the contention window value used in IEEE 802.11 MAC, thereby defining a lower contention window range to the frame with higher priority (urgent area) and a higher contention window range to the frame with lower priority (less important area). The proposed framework leads to a reduction in packet collisions and, at the same time, minimizes the packet loss originated from nodes in the rear-side of the UAV when the UAV moves in the forward direction. To optimize the networks' energy consumption, we present a novel routing protocol based on the aforementioned framework. By leveraging the proposed framework and routing algorithm, we aim to reduce the transmission distances between senders and receivers. A shorter distance leads to better channel quality and energy savings, as is verified by our simulation studies and results.

Recent Advances in Energy-Efficient Routing Protocols for Wireless Sensor Networks: A Review

Abstract: Due to a battery constraint in wireless sensor networks (WSNs), prolonging their lifetime is important. Energy-efficient routing techniques for WSNs play a great role in doing so. In this paper, we articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous WSNs. They are further classified into static and mobile ones. We give an overview of these protocols in each category by summarizing their characteristics, limitations, and applications. Finally, some open issues in energy-efficient routing protocol design for WSNs are indicated.

Swarm intelligence based fuzzy routing protocol for clustered wireless sensor networks

Abstract: A fuzzy-based protocol is presented for clustered wireless sensor networks.The main objective is to form balanced clusters over the network.A hybrid swarm intelligence algorithm is utilized to optimize fuzzy rule table.Proposed routing protocol is successfully tested on 10 heterogeneous networks.Results show that our methodology outperforms the compared routing protocols. Wireless sensor networks are rapidly evolving technological platforms with tremendous applications in several domains. Since sensor nodes are battery powered and may be used in dangerous or inaccessible environments, it is difficult to replace or recharge their power supplies. Clustering is an effective approach to achieve energy efficiency in wireless sensor networks. In clustering-based routing protocols, cluster heads are selected among all sensor nodes within the network, and then clusters are formed by simply assigning each node to the nearest cluster head. The main drawback is that there is no control on the distribution of cluster heads over the network. In addition to the problem of generating unbalanced clusters, almost all routing protocols are designed for a certain application scope, and could not cover all applications. In this paper, we propose a swarm intelligence based fuzzy routing protocol (named SIF), in order to overcome the mentioned drawbacks. In SIF, fuzzy c-means clustering algorithm is utilized to cluster all sensor nodes into balanced clusters, and then appropriate cluster heads are selected via Mamdani fuzzy inference system. This strategy not only guarantees to generate balanced clusters over the network, but also has the ability to determine the precise number of clusters. In fuzzy-based routing protocols in literature, the fuzzy rule base table is defined manually, which is not optimal for all applications. Since tuning the fuzzy rules very affects on the performance of the fuzzy system, we utilize a hybrid swarm intelligence algorithm based on firefly algorithm and simulated annealing to optimize the fuzzy rule base table of SIF. The fitness function can be defined according to the application specifications. Unlike other routing protocols which have been designed for a certain application scope, the main objective of our methodology is to prolong the network lifetime based on the application specifications. In other words, SIF not only prolongs the network lifetime, but also is applicable to any kind of application. Obtained simulation results over 10 heterogeneous networks show that SIF outperforms the existing clustering-based protocols in terms of generating balanced clusters and prolonging the network lifetime.

Joint Clustering and Routing Design for Reliable and Efficient Data Collection in Large-Scale Wireless Sensor Networks

Abstract: For data collection in large-scale wireless sensor networks (WSNs), dynamic clustering provides a scalable and energy-efficient solution, which uses cluster head (CH) rotation and cluster range assignment algorithms to balance the energy consumption. Nevertheless, most existing works consider the clustering and routing as two isolated issues, which is harmful to the connectivity and energy efficiency of the network. In this paper, we provide a detailed analysis on the relations between clustering and routing, and then propose a joint clustering and routing (JCR) protocol for reliable and efficient data collection in large-scale WSN. JCR adopts the backoff timer and gradient routing to generate connected and efficient intercluster topology with the constraint of maximum transmission range. The relations between clustering and routing in JCR are further exploited by theoretical and numerical analyses. The results show that the multihop routing in JCR may lead to the unbalanced CH selection. Then, the solution is provided to optimize the network lifetime by considering the gradient of one-hop neighbor nodes in the setting of backoff timer. Theoretical analysis and simulation results prove the connectivity and efficiency of the network topology generated by JCR.

RPL: The Routing Standard for the Internet of Things... Or Is It?

Abstract: RPL, the IPv6 Routing Protocol for low-power and lossy networks, is considered the de facto routing protocol for the Internet of Things (IoT). Since its standardization, RPL has contributed to the advancement of communications in the world of tiny, embedded networking devices by providing, along with other standards, a baseline architecture for IoT. Several years later, we analyze the extent to which RPL has lived up to the expectations defined by the IETF requirements, and tie our analysis to current trends, identifying the challenges RPL must face to remain on the forefront of IoT technology.

Ant colony optimization for the real-time train routing selection problem

Abstract: This paper deals with the real-time problem of scheduling and routing trains in a railway network. In the related literature, this problem is usually solved starting from a subset of routing alternatives and computing the near-optimal solution of the simplified routing problem. We study how to select the best subset of routing alternatives for each train among all possible alternatives. The real-time train routing selection problem is formulated as an integer linear programming formulation and solved via an algorithm inspired by the ant colonies’ behavior. The real-time railway traffic management problem takes as input the best subset of routing alternatives and is solved as a mixed-integer linear program. The proposed methodology is tested on two practical case studies of the French railway infrastructure: the Lille terminal station area and the Rouen line. The computational experiments are based on several practical disturbed scenarios. Our methodology allows the improvement of the state of the art in terms of the minimization of train consecutive delays. The improvement is around 22% for the Rouen instances and around 56% for the Lille instances.

An improved harmony search based energy-efficient routing algorithm for wireless sensor networks

Abstract: Graphical abstractDisplay Omitted HighlightsA new encoding of harmony memory for routing in WSNs has been proposed.A new generation method of a new harmony for routing in WSNs has been proposed.The dynamic adaptation is introduced for the parameter HMCR to improve the performance of the proposed routing algorithm.An effective local search strategy is proposed to improve the convergence speed and the accuracy of the proposed routing algorithm.An energy efficient objective function model is proposed. Wireless sensor networks (WSNs) is one of the most important technologies in this century. As sensor nodes have limited energy resources, designing energy-efficient routing algorithms for WSNs has become the research focus. And because WSNs routing for maximizing the network lifetime is a NP-hard problem, many researchers try to optimize it with meta-heuristics. However, due to the uncertain variable number and strong constraints of WSNs routing problem, most meta-heuristics are inappropriate in designing routing algorithms for WSNs. This paper proposes an Improved Harmony Search Based Energy Efficient Routing Algorithm (IHSBEER) for WSNs, which is based on harmony search (HS) algorithm (a meta-heuristic). To address the WSNs routing problem with HS algorithm, several key improvements have been put forward: First of all, the encoding of harmony memory has been improved based on the characteristics of routing in WSNs. Secondly, the improvisation of a new harmony has also been improved. We have introduced dynamic adaptation for the parameter HMCR to avoid the prematurity in early generations and strengthen its local search ability in late generations. Meanwhile, the adjustment process of HS algorithm has been discarded to make the proposed routing algorithm containing less parameters. Thirdly, an effective local search strategy is proposed to enhance the local search ability, so as to improve the convergence speed and the accuracy of routing algorithm. In addition, an objective function model that considers both the energy consumption and the length of path is developed. The detailed descriptions and performance test results of the proposed approach are included. The experimental results clearly show the advantages of the proposed routing algorithm for WSNs.

Energy Efficient Direction-Based PDORP Routing Protocol for WSN

Abstract: Energy consumption is one of the constraints in wireless sensor networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues, viz., energy consumption, network lifetime, network scalability, and packet overhead. The key issue in WSN is that these networks suffer from the packet overhead, which is the root cause of more energy consumption and degrade the QoS in sensor networks. In WSN, there are several routing protocols, which are used to enhance the performance of the network. Out of those protocols, dynamic source routing (DSR) protocol is more suitable in terms of small energy density, but sometimes when the mode of a node changes from active to sleep, the efficiency decreases as the data packets need to wait at the initial point, where the packet has been sent and this increases the waiting time and end-to-end delay of the packets, which leads to increase in energy consumption. Our problem is to identify the dead nodes and to choose another suitable path so that the data transmission becomes smoother and less energy gets conserved. In order to resolve these issues, we propose directional transmission-based energy aware routing protocol named PDORP. The proposed protocol PDORP has the characteristics of both power efficient gathering sensor information system and DSR routing protocols. In addition, hybridization of genetic algorithm and bacterial foraging optimization is applied to proposed routing protocol to identify energy efficient optimal paths. The performance analysis, comparison through a hybridization approach of the proposed routing protocol, gives better result comprising less bit error rate, less delay, less energy consumption, and better throughput, which leads to better QoS and prolong the lifetime of the network. Moreover, the computation model is adopted to evaluate and compare the performance of the both routing protocols using soft computing techniques.

Secure and Robust Multi-Constrained QoS Aware Routing Algorithm for VANETs

Abstract: Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In vehicular ad hoc networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the ant colony optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented evolving graph (VoEG) model to perform plausibility checks on the routing control messages exchanged among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service.

A Secure Routing Protocol Based on RPL for Internet of Things

Abstract: Data transportation and routing in Internet of Things (IoT) is a challenging issue where massive data collection and gathering are predictable. The Routing Protocol for Low- power and Lossy Networks (RPL) is one of the best candidates to ensure routing in 6LoWPAN networks. However, RPL is vulnerable to a number of attacks related to exchanged control messages. In this paper, we propose a new secure routing protocol based on RPL referred to as Secure-RPL (SRPL). The main aim of SRPL is to prevent misbehaving nodes from maliciously changing control message values such as the rank of a node that may disturb a network by creating a fake topology. We introduce the concept of rank threshold along with hash chain authentication technique to deal with internal attacks like sinkhole, black hole, selective forwarding attacks etc. Simulation results show that SRPL is robust and resistant to this kind of attacks based on malicious manipulation of RPL metrics.

SCRP: Stable CDS-Based Routing Protocol for Urban Vehicular Ad Hoc Networks

Abstract: This paper addresses the issue of selecting routing paths with minimum end-to-end delay (E2ED) for nonsafety applications in urban vehicular ad hoc networks (VANETs). Most existing schemes aim at reducing E2ED via greedy-based techniques (i.e., shortest path, connectivity, or number of hops), which make them prone to the local maximum problem and to data congestion, leading to higher E2ED. As a solution, we propose SCRP, which is a distributed routing protocol that computes E2ED for the entire routing path before sending data messages. To do so, SCRP builds stable backbones on road segments and connects them at intersections via bridge nodes. These nodes assign weights to road segments based on the collected information of delay and connectivity. Routes with the lowest aggregated weights are selected to forward data packets. Simulation results show that SCRP outperforms some of the well-known protocols in literature.

The multi-trip vehicle routing problem with time windows and release dates

Abstract: The multi-trip vehicle routing problem with time windows and release dates is a variant of the multi-trip vehicle routing problem where a time window and a release date are associated with each customer. The release date represents the date when the merchandise requested by a customer becomes available at the depot. The interest for this problem comes from the field of city logistics and the study of delivery systems involving City Distribution Centers (CDC). In these systems, goods are first delivered to a CDC before being transferred to eco-friendly vehicles for final delivery. We propose to address the problem through a population-based algorithm, with a giant tour representation for individuals. An efficient labeling procedure allows turning giant tours into solutions. Experiments demonstrate the effectiveness of the method.

An Energy-Efficient Region-Based RPL Routing Protocol for Low-Power and Lossy Networks

Abstract: Routing plays an important role in the overall architecture of the Internet of Things. IETF has standardized the RPL routing protocol to provide the interoperability for low-power and lossy networks (LLNs). LLNs cover a wide scope of applications, such as building automation, industrial control, healthcare, and so on. LLNs applications require reliable and energy-efficient routing support. Point-to-point (P2P) communication is a fundamental requirement of many LLNs applications. However, traditional routing protocols usually propagate throughout the whole network to discover a reliable P2P route, which requires large amount energy consumption. Again, it is challenging to achieve both reliability and energy-efficiency simultaneously, especially for LLNs. In this paper, we propose a novel energy-efficient region-based routing protocol (ER-RPL), which achieves energy-efficient data delivery without compromising reliability. In contrast of traditional routing protocols where all nodes are required for route discovery, the proposed scheme only requires a subset of nodes to do the job, which is the key of energy saving. Our theoretical analysis and extensive simulation studies demonstrate that ER-RPL has a great performance superiority over two conventional benchmark protocols, i.e., RPL and P2P-RPL.

Routing protocols for wireless sensor networks: What the literature says?

Abstract: Routing in Wireless Sensor Networks (WSNs) plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS) and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.

Design guidelines for opportunistic routing in underwater networks

Abstract: The unique characteristics of the underwater acoustic channel impose many challenges that limit the utilization of underwater sensor networks. In this context, opportunistic routing, which has been extensively investigated in terrestrial wireless ad hoc network scenarios, has greater potential for mitigating drawbacks from underwater acoustic communication and improving network performance. In this work, we discuss the two main building blocks for the design of opportunistic routing protocols for underwater sensor networks: candidate set selection and candidate coordination procedures. We propose classifying candidate set selection procedures into sender-side, receiver-side, and hybrid approaches, and candidate coordination procedures into timer-based and control-packet-based approaches. Based on this classification, we discuss particular characteristics of each approach and how they relate to underwater acoustic communication. Furthermore, we argue that those characteristics should be considered during the design of opportunistic routing protocols for different scenarios in underwater sensor networks.

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Abstract: Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.

Delay-constrained energy-efficient cluster-based multi-hop routing in wireless sensor networks

Abstract: Energy efficiency is the main objective in the design of a wireless sensor network (WSN). In many applications, sensing data must be transmitted from sources to a sink in a timely manner. This paper describes an investigation of the trade-off between two objectives in WSN design: minimizing energy consumption and minimizing end-to-end delay. We first propose a new distributed clustering approach to determining the best clusterhead for each cluster by considering both energy consumption and end-to-end delay requirements. Next, we propose a new energy-cost function and a new end-to-end delay function for use in an inter-cluster routing algorithm. We present a multi-hop routing algorithm for use in disseminating sensing data from clusterheads to a sink at the minimum energy cost subject to an end-to-end delay constraint. The results of a simulation are consistent with our theoretical analysis results and show that our proposed performs much better than similar protocols in terms of energy consumption and end-to-end delay.

Toward Improved RPL: A Congestion Avoidance Multipath Routing Protocol with Time Factor for Wireless Sensor Networks

Abstract: Designing routing protocols in Low power and Lossy Networks (LLNs) imposes great challenges. In emergency scenarios, the large and rapid data traffic caused by emergencies will lead to network congestion and bring about significant packet loss and delay. Routing protocol for LLNs (RPL) is the IETF standard for IPv6 routing in LLNs. The basic version of RPL uses Expected Transmission Count (ETX) as the default routing metric; it cannot solve the problem of sudden large data traffic. In this paper, we propose a congestion avoidance multipath routing protocol which uses composite routing metrics based on RPL, named CA-RPL. A routing metric for RPL that minimized the average delay towards the DAG root is proposed, and the weight of each path is computed by four metrics. The mechanism is explained and its performance is evaluated through simulation experiments based on Contiki. Simulation results show that the proposed CA-RPL reduces the average time delay by about 30% compared to original RPL when the interpacket interval is short and has almost 20% reduction in packet loss ratio. The CA-RPL can effectively alleviate the network congestion in the network with poor link quality and large data traffic and significantly improve the performance of LLNs.

Secure Routing in Multihop Wireless Ad-Hoc Networks With Decode-and-Forward Relaying

Abstract: In this paper, we study the problem of secure routing in a multihop wireless ad-hoc network in the presence of randomly distributed eavesdroppers. Specifically, the locations of the eavesdroppers are modeled as a homogeneous Poisson point process (PPP) and the source-destination pair is assisted by intermediate relays using the decode-and-forward (DF) strategy. We analytically characterize the physical layer security performance of any chosen multihop path using the end-to-end secure connection probability (SCP) for both colluding and noncolluding eavesdroppers. To facilitate finding an efficient solution to secure routing, we derive accurate approximations of the SCP. Based on the SCP approximations, we study the secure routing problem, which is defined as finding the multihop path having the highest SCP. A revised Bellman–Ford algorithm is adopted to find the optimal path in a distributed manner. Simulation results demonstrate that the proposed secure routing scheme achieves nearly the same performance as exhaustive search.