Showing papers on "Geographic routing 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

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.

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.

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

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.

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.

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.

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.

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.

A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks

Abstract: Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including `Mobility-Aware', `Thermal-Aware', `Restriction of Location and Number of Relays', `Link-aware', `Cluster- and Tree-Based', `Cross-Layer', `Opportunistic', and `Medium Access Control'. We, then, provide a full description of the statistical analysis of each category in relation to all papers, current hybrid protocols, and the type of simulators used in each paper. Next, we analyze the distribution of papers in each category during various years. Moreover, for each category, the advantages and disadvantages as well as the number of issued papers in different years are given. We also analyze the type of layer and deployment of mathematical models or algorithmic techniques in each category. Finally, after introducing certain important protocols for each category, the goals, advantages, and disadvantages of the protocols are discussed and compared with each other.

A Predictive Cross-Layered Interference Management in a Multichannel MAC with Reactive Routing in VANET

Abstract: Vehicular ad hoc networks (VANETs) represent a particular mobile technology that permits communication between vehicles, offering security and comfort. Nowadays, distributed mobile wireless computing is becoming a very important communication paradigm, due to its flexibility to adapt to different mobile applications. In this work, an interference aware metric is proposed in order to reduce the level of interference between each pair of nodes at the MAC and routing layer. In particular, this metric with a prediction algorithm is proposed to work in a cross-layered MAC and an on-demand routing scheme in multi-radio vehicular networks, wherein each node is equipped with two multi-channel radio interfaces. The proposed metric is based on the maximization of the average signal-to-interference ratio (SIR) level of the connection between source and destination. In order to relieve the effects of the co-channel interference perceived by mobile nodes, transmission channels are switched on a basis of a periodical SIR evaluation. Our solution has been integrated with an on-demand routing scheme but it can be applied to other routing strategies. Three on-demand interference aware routing schemes integrating IEEE 802.11p Multi-channel MAC have been tested to assess the benefits of the novel metric applied to a vehicular context. NS-3 has been used for implementing and testing the proposed idea, and significant performance improvements were obtained: in particular, the proposed policy has resulted in an enhancement of network performance in terms of throughput and packet delivery ratio.

Wireless routing and control: a cyber-physical case study

Abstract: Wireless sensor-actuator networks (WSANs) are being adopted in process industries because of their advantages in lowering deployment and maintenance costs. While there has been significant theoretical advancement in networked control design, only limited empirical results that combine control design with realistic WSAN standards exist. This paper presents a cyber-physical case study on a wireless process control system that integrates state-of-the-art network control design and a WSAN based on the WirelessHART standard. The case study systematically explores the interactions between wireless routing and control design in the process control plant. The network supports alternative routing strategies, including single-path source routing and multi-path graph routing. To mitigate the effect of data loss in the WSAN, the control design integrates an observer based on an Extended Kalman Filter with a model predictive controller and an actuator buffer of recent control inputs. We observe that sensing and actuation can have different levels of resilience to packet loss under this network control design. We then propose a flexible routing approach where the routing strategy for sensing and actuation can be configured separately. Finally, we show that an asymmetric routing configuration with different routing strategies for sensing and actuation can effectively improve control performance under significant packet loss. Our results highlight the importance of co- joining the design of wireless network protocols and control in wireless control systems.

A Street-Centric Routing Protocol Based on Microtopology in Vehicular Ad Hoc Networks

Abstract: In a vehicular ad hoc network (VANET), high mobility and uneven distribution of vehicles are important factors affecting the performance of routing protocols. The high mobility may cause frequent changes of network topology, whereas the uneven distribution of vehicles may lead to routing failures due to network partition; even high density of vehicles may cause severe wireless channel contentions in an urban environment. In this paper, we propose a novel concept called the microtopology (MT), which consists of vehicles and wireless links among vehicles along a street as a basic component of routing paths and even the entire network topology. We abstract the MT model reflecting the dynamic routing-related characteristics in practical urban scenarios along streets, including the effect of mobility of vehicles, signal fading, wireless channel contention, and existing data traffic. We first analyze the endside-to-endside routing performance in an MT as a basis of routing decision. Then, we propose a novel street-centric routing protocol based on MT (SRPMT) along the streets for VANETs. Simulation results show that our proposed SRPMT protocol achieves higher data delivery rate and shorter average end-to-end delay compared with the performance of greedy perimeter stateless routing (GPSR) and greedy traffic-aware routing (GyTAR).

SDGR: An SDN-Based Geographic Routing Protocol for VANET

Abstract: Vehicular Ad hoc Network (VANET) is a new technology that integrates the potentials of next generation wireless networks into vehicles. The design of routing protocols in VANETs is crucial in supporting the Intelligent Transportation Systems (ITS). Typical geographic routings only use local information to make routing decisions which may lead to local maximum and sparse connectivity problems. This paper proposes a novel SDN-based geographic routing (SDGR) protocol for VANET, based on node location, vehicles density and digital map. Software-Defined Networking (SDN) is used to decouple the network management from data transferring. In SDGR, the central controller gathers information of vehicles and provides a global view to compute the optimal routing paths. Simulation results show that the proposed scheme performs much better than related routing protocols in terms of both packet delivery ratio and delivery delay time.

Addressing Mobility in RPL With Position Assisted Metrics

Abstract: Mobility is still an open challenge in wireless sensor networks (WSNs). Energy efficient routing strategies designed for static WSNs, such as routing protocol for low-power and lossy networks (RPL), generally have a slow response to topology changes. Moreover, their high signalling cost to keep up-to-date routes in the presence of mobile nodes makes them inefficient in these scenarios. In this paper, we introduce Kalman positioning RPL (KP-RPL), a novel routing strategy for WSNs with both static and mobile nodes, based on RPL. The objective of KP-RPL is to provide robust and reliable routing, considering the positioning inaccuracies and node disconnections that arise in real-life WSNs. This considers the original RPL for the communication among static nodes and position-based routing for mobile nodes, which use a novel RPL metric that combines Kalman positioning and blacklisting. The simulation results show that the reliability and the robustness of the network in harsh conditions are enhanced compared with geographical routing. Moreover, KP-RPL reduces the density and the number of simultaneously active anchor nodes for positioning. As a result, the infrastructure cost is lower, and the network lifetime is extended.

An Adaptive Multipath Geographic Routing for Video Transmission in Urban VANETs

Abstract: Vehicular ad hoc networks (VANETs) have attracted many researchers' attention in recent years. Due to the highly dynamic nature of these networks, providing guaranteed quality-of-service (QoS) video-on-demand (VOD) sessions is a challenging problem. In this paper, a new adaptive geographic routing scheme is proposed for establishing a simplex VOD transmission in urban environments. In this scheme, rather than one route, a number of independent routes are discovered between source and destination vehicles whose number of routes depends on the volume of the requested video and lifetime (span of time in which a route is almost fixed) for each route. A closed-form equation is derived for estimating the connectivity probability of a route, which is used to select best connected routes. Simulation results show the QoS parameters: packet loss ratio is decreased by 40.79% and freezing delay is significantly improved by 25 ms compared with those of junction-based multipath source routing at the cost of 2-ms degradation in the end-to-end delay.

A survey on geographic routing protocols in delay/disruption tolerant networks

Abstract: Delay/Disruption Tolerant Networks (DTNs) have been attracting great interest from research community, where data communication naturally does not require contemporaneous end-to-end connectivity. Although they are suffering from a large variation of network topology, numerous previous routing protocols proposed for DTNs still make effort to qualify delivery potential, via network topology information. Geographic routing is an alternative, conceptually, by relying on the geographic information instead of topological information. In the literature, since this technique branch has not been extensively investigated in DTNs, our paper identifies the motivation and challenges for applying geographic routing in DTNs with the state of the art. Also, we highlight the future research directions for this branch.

Network slice selection, assignment and routing within 5G Networks

Abstract: 5G Networks are anticipated to provide a diverse set of services over Network Slices (NS) using Network Function Virtualization (NFV) technologies. We propose solutions to enable NS selection and routing of traffic routing through a NS. A framework for enabling negotiation, selection and assignment of NSs for requesting applications in 5G networks is presented. A definition for service description has been developed, which is then leveraged for negotiation between an application/user equipment and the serving network. Virtualized networks or slices of virtualized networks are selected and assigned based on QCI and security requirements associated with a requested service. We also describe static and dynamic mechanisms for packet routing within NSs.

Energy balanced position-based routing for lifetime maximization of wireless sensor networks

Abstract: Maximizing the network lifetime is the fundamental design issue in wireless sensor networks (WSNs). The existing routing algorithms DIR, MFR, GEDIR, and Dijkstra's algorithms select the same set of sensors for a source-destination pair for packet transmission that results in an early dead situation of the sensors, leading to the partition in the networks. In this paper, we present a new position based routing algorithm to fairly use the energy of the sensors to maximize the network lifetime. The forwarding search space (FSS) is introduced to control unnecessary transmissions. A next forwarder selection function is designed based on the residual energy, node degree, distance, and angle. Each time, this function selects different set of sensors for packets transmission, which is the essence of fairly balance the energy consumption among the sensors. Further, the mathematical expression for connectivity probability, expected one hop distance, expected distance between source and destination node, expected hop count, and expected energy consumption are derived. The simulation results are given to validate the analytical results. The experimental results show the proposed algorithm outperforms the state of the art routing algorithms in terms of network lifetime.

Three-dimensional geographic routing in wireless mobile ad hoc and sensor networks

Abstract: Geographic routing has been considered as an attractive approach for wireless mobile ad hoc and sensor networks due to its effectiveness and scalability. Over the past few decades, numerous geographic routing protocols have been proposed extensively in 2D space. However, these protocols are no longer valid if ad hoc or sensor networks are distributed in 3D environments, such as space, atmosphere, and ocean. Because of the surprisingly difficulty of designing geographic routing protocols for 3D networks compared to 2D networks, only a few prior studies have focused on 3D geographic routing specifically designed for ad hoc and sensor networks. In this article, we first illustrate the principles of 3D geographic routing, and categorize current research work based on different criteria. Then we compare the 3DGR protocols under study through comprehensive analysis. Finally, we point out the open issues and opportunities for further research.

Geographic Routing in Multilevel Scenarios of Vehicular Ad Hoc Networks

Abstract: Vehicular ad hoc networks (VANETs) present a multilevel feature when vehicles move in multilevel scenarios, such as viaducts, tunnels, and ramps. Different from city and highway scenarios, complicated node distribution and transmission conditions make the routing decision more challenging in the multilevel environment. To address the issue, this paper investigates geographic routing protocols for the multilevel scenario of VANETs. We first reveal the impacts of the multilevel feature on network characteristics by an outdoor transmission experiment and a stochastic analysis. In particular, the measured data and analysis results show that the wireless transmission range dramatically degrades, which deteriorates the connectivity probability and the performance of geographic routing protocols in the network. Motivated by these results, we propose a multilevel-scenario-oriented greedy opportunity routing protocol (M-GOR). In the protocol, we present a calculation method for the connectivity probability and a greedy opportunity forwarding (GOF) algorithm to respond to the impacts of the multilevel structure. Both the analysis and simulation results demonstrate benefits of M-GOR in terms of the average hop count and delivery ratio.