Showing papers on "Routing protocol published in 2016"

Intelligent Device-to-Device Communication in the Internet of Things

Abstract: Analogous to the way humans use the Internet, devices will be the main users in the Internet of Things (IoT) ecosystem. Therefore, device-to-device (D2D) communication is expected to be an intrinsic part of the IoT. Devices will communicate with each other autonomously without any centralized control and collaborate to gather, share, and forward information in a multihop manner. The ability to gather relevant information in real time is key to leveraging the value of the IoT as such information will be transformed into intelligence, which will facilitate the creation of an intelligent environment. Ultimately, the quality of the information gathered depends on how smart the devices are. In addition, these communicating devices will operate with different networking standards, may experience intermittent connectivity with each other, and many of them will be resource constrained. These characteristics open up several networking challenges that traditional routing protocols cannot solve. Consequently, devices will require intelligent routing protocols in order to achieve intelligent D2D communication. We present an overview of how intelligent D2D communication can be achieved in the IoT ecosystem. In particular, we focus on how state-of-the-art routing algorithms can achieve intelligent D2D communication in the IoT.

Body area networks: A survey

Abstract: Body Area Networks are an effective solution for communication in ubiquitous health systems. BAN's can be applied into fields of military, defense, telecomm etc. Such networks are thus being researched to provide better routing techniques in and around the body. This paper discusses architecture of BAN along with the requirements and challenges. Various routing protocols available are discussed in section V. Various routing algorithms are discussed with their limitations and advantages.

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

Geographic and Opportunistic Routing for Underwater Sensor Networks

Abstract: Underwater wireless sensor networks (UWSNs) have been showed as a promising technology to monitor and explore the oceans in lieu of traditional undersea wireline instruments. Nevertheless, the data gathering of UWSNs is still severely limited because of the acoustic channel communication characteristics. One way to improve the data collection in UWSNs is through the design of routing protocols considering the unique characteristics of the underwater acoustic communication and the highly dynamic network topology. In this paper, we propose the GEDAR routing protocol for UWSNs. GEDAR is an anycast, geographic and opportunistic routing protocol that routes data packets from sensor nodes to multiple sonobuoys (sinks) at the sea's surface. When the node is in a communication void region, GEDAR switches to the recovery mode procedure which is based on topology control through the depth adjustment of the void nodes, instead of the traditional approaches using control messages to discover and maintain routing paths along void regions. Simulation results show that GEDAR significantly improves the network performance when compared with the baseline solutions, even in hard and difficult mobile scenarios of very sparse and very dense networks and for high network traffic loads.

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 Taxonomy of Attacks in RPL-based Internet of Things

Abstract: The growing interest for the Internet of Things is contributing to the large-scale deployment of Low power and Lossy Networks (LLN). These networks support communications amongst objects from the real world, such as home automation devices and embedded sensors, and their interconnection to the Internet. An open standard routing protocol, called RPL, has been specified by the IETF in order to address the specific properties and constraints of these networks. However, this protocol is exposed to a large variety of attacks. Their consequences can be quite significant in terms of network performance and resources. In this paper, we propose to establish a taxonomy of the attacks against this protocol, considering three main categories including attacks targeting network resources, attacks modifying the network topology and attacks related to network traffic. We describe these attacks, analyze and compare their properties, discuss existing counter-measures and their usage from a risk management perspective.

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.

Efficient network reachability analysis using a succinct control plane representation

Abstract: To guarantee network availability and security, operators must ensure that their reachability policies (e.g., A can or cannot talk to B) are correctly implemented. This is a difficult task due to the complexity of network configuration and the constant churn in a network's environment, e.g., new route announcements arrive and links fail. Current network reachability analysis techniques are limited as they can only reason about the current "incarnation" of the network, cannot analyze all configuration features, or are too slow to enable exploration of many environments. We build ERA, a tool for efficient reasoning about network reachability. Instead of reasoning about individual incarnations of the network, ERA directly reasons about the network "control plane" that generates these incarnations. We address key expressiveness and scalability challenges by building (i) a succinct model for the network control plane (i.e., various routing protocols and their interactions), and (ii) a repertoire of techniques for scalable (taking a few seconds for a network with > 1000 routers) exploration of this model. We have used ERA to successfully find both known and new violations of a range of common intended polices.

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

HydroCast: Pressure Routing for Underwater Sensor Networks

Abstract: A Sensor Equipped Aquatic (SEA) swarm is a sensor cloud that drifts with water currents and enables 4-D (space and time) monitoring of local underwater events such as contaminants, marine life, and intruders. The swarm is escorted on the surface by drifting sonobuoys that collect data from the underwater sensors via acoustic modems and report it in real time via radio to a monitoring center. The goal of this study is to design an efficient anycast routing algorithm for reliable underwater sensor event reporting to any surface sonobuoy. Major challenges are the ocean current and limited resources (bandwidth and energy). In this paper, these challenges are addressed, and HydroCast, which is a hydraulic-pressure-based anycast routing protocol that exploits the measured pressure levels to route data to the surface sonobuoys, is proposed. This paper makes the following contributions: a novel opportunistic routing mechanism to select the subset of forwarders that maximizes the greedy progress yet limits cochannel interference and an efficient underwater dead end recovery method that outperforms the recently proposed approaches. The proposed routing protocols are validated through extensive simulations.

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.

A Specification-Based IDS for Detecting Attacks on RPL-Based Network Topology

Abstract: Routing Protocol for Low power and Lossy network (RPL) topology attacks can downgrade the network performance significantly by disrupting the optimal protocol structure To detect such threats, we propose a RPL-specification, obtained by a semi-auto profiling technique that constructs a high-level abstract of operations through network simulation traces, to use as reference for verifying the node behaviors This specification, including all the legitimate protocol states and transitions with corresponding statistics, will be implemented as a set of rules in the intrusion detection agents, in the form of the cluster heads propagated to monitor the whole network In order to save resources, we set the cluster members to report related information about itself and other neighbors to the cluster head instead of making the head overhearing all the communication As a result, information about a cluster member will be reported by different neighbors, which allow the cluster head to do cross-check We propose to record the sequence in RPL Information Object (DIO) and Information Solicitation (DIS) messages to eliminate the synchronized issue created by the delay in transmitting the report, in which the cluster head only does cross-check on information that come from sources with the same sequence Simulation results show that the proposed Intrusion Detection System (IDS) has a high accuracy rate in detecting RPL topology attacks, while only creating insignificant overhead (about 63%) that enable its scalability in large-scale network

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.

E-CARP: An Energy Efficient Routing Protocol for UWSNs in the Internet of Underwater Things

Abstract: With the advance of the Internet of Underwater Things, smart things are deployed under the water and form the underwater wireless sensor networks (UWSNs), to facilitate the discovery of vast unexplored ocean volume. A routing protocol, which is not expensive in packets forwarding and energy consumption, is fundamental for sensory data gathering and transmitting in UWSNs. To address this challenge, this paper proposes Enhanced CARP (E-CARP), which is an enhanced version of the channel-aware routing protocol (CARP) developed by S. Basagni et al. , to achieve the location-free and greedy hop-by-hop packet forwarding strategy. In general, CARP does not consider the reusability of previously collected sensory data to support certain domain applications afterward, which induces data packets forwarding which may not be beneficial to applications. Besides, the PING - PONG strategy in CARP can be simplified for selecting the most appropriate relay node at each time point, when the network topology is relatively steady. These two research problems have been addressed by our E-CARP. Simulation results validate that our technique can decrease the communication cost significantly and increase the network capability to a certain extent.

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.

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.

Wdfad-dbr

Abstract: The design of routing protocols for Underwater Acoustic Sensor Networks (UASNs) poses many challenges due to long propagation, high mobility, limited bandwidth, multi-path and Doppler effect. Because of the void-hole caused by the uneven distribution of nodes and sparse deployment, the selection of next hop forwarding nodes only based on the state of current node may result in the failure of forwarding in the local sparse region. In order to reduce the probability of encountering void holes in the sparse networks, in this paper we present weighting depth and forwarding area division DBR routing protocol, called WDFAD-DBR. The novelties of WDFAD-DBR lie in: firstly, next forwarding nodes are selected according to the weighting sum of depth difference of two hops, which considers not only the current depth but also the depth of expected next hop. In this way, the probability of meeting void holes is effectively reduced. Secondly, the mechanisms for forwarding area division and neighbor node prediction are designed to reduce the energy consumption caused by duplicated packets and neighbors' requests, respectively. Thirdly, we make theoretical analyses on routing performance in case of considering channel contending with respect to delivery ratio, energy consumption and average end-to-end delay. Finally we conduct extensive simulations using NS-3 simulator to verify the effectiveness and validity of WDFAD-DBR.

LEACH-MAC: a new cluster head selection algorithm for Wireless Sensor Networks

Abstract: Battery power is a critical resource of Wireless Sensor Networks (WSNs). Therefore, an effective operation of WSNs depend upon the efficient use of its battery resource. Cluster based routing protocols are proven to be more energy efficient as compared to other routing protocols. Most of the cluster based routing protocols, especially Low Energy Adaptive Clustering Hierarchy (LEACH) protocol, follows Dynamic, Distributed and Randomized (DDR) algorithm for clustering. Due to the randomness present in clustering algorithms, number of cluster heads generated varies highly from the optimal count. In this paper, we present an approach which attempts to control the randomness present in LEACH's clustering algorithm. This approach makes the cluster head count stable. NS-2 simulation results show that proposed approach improved the First Node Death (FND) time and Last Node Death (LND) time by 21 and 24 % over LEACH, 10 and 20 % as compared to Advance LEACH (ALEACH) and 5 and 35 % over LEACH with Deterministic Cluster Head Selection (LEACH-DCHS) respectively.

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.

Multi-objective fractional artificial bee colony algorithm to energy aware routing protocol in wireless sensor network

Abstract: Due to the promising application of collecting information from remote or inaccessible location, wireless sensor networks pose big challenge for data routing to maximize the communication with more energy efficient. Literature presents different cluster-based energy aware routing protocol for maximizing the life time of sensor nodes. Accordingly, an energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head. The hybrid optimization algorithm called, multi-objective fractional artificial bee colony is developed to control the convergence rate of ABC with the newly designed fitness function which considered three objectives like, energy consumption, distance travelled and delays to minimize the overall objective. The performance of the proposed FABC-based cluster head selection is compared with LEACH, PSO and ABC-based routing using life time, and energy. The results proved that the proposed FABC maximizes the energy as well as life time of nodes as compared with existing protocols.

A Street-Centric Opportunistic Routing Protocol Based on Link Correlation for Urban VANETs

Abstract: In urban vehicular ad hoc networks (VANETs), due to the high mobility and uneven distribution of vehicles, how to select an optimal relaying node in an intra-street and how to determine a street selection at the intersection are two challenging issues in designing an efficient routing protocol in complex urban environments. In this paper, we build a link model with a Wiener process to predict the probability of link availability, which considers the stable and unstable vehicle states according to the behavior of vehicles. We introduce a novel concept called the link correlation which represents the influence of different link combinations in network topology to transmit a packet with less network resource consumption and higher goodput. Based on this concept, we design an opportunistic routing metric called the expected transmission cost over a multi-hop path (ETCoP) implemented with our link model as the selection guidance of a relaying node in intra-streets. This metric can also provide assistance for the next street selection at an intersection. Finally, we propose a street-centric opportunistic routing protocol based on ETCoP for VANETs (SRPE). Simulation results show that our proposed SRPE outperforms the conventional protocols in terms of packet delivery ratio, average end-to-end delay, and network yield.

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.