scispace - formally typeset
Search or ask a question

Showing papers on "Geographic routing published in 2019"


Journal ArticleDOI
TL;DR: An artificial spider geographic routing in urban VAENTs (ASGR) is proposed, which performs best in terms of packet delivery ratio and average transmission delay with an up to 15% and 94% improvement, respectively.
Abstract: Recently, vehicular ad hoc networks (VANETs) have been attracting significant attention for their potential for guaranteeing road safety and improving traffic comfort. Due to high mobility and frequent link disconnections, it becomes quite challenging to establish a reliable route for delivering packets in VANETs. To deal with these challenges, an artificial spider geographic routing in urban VAENTs (ASGR) is proposed in this paper. First, from the point of bionic view, we construct the spider web based on the network topology to initially select the feasible paths to the destination using artificial spiders. Next, the connection-quality model and transmission-latency model are established to generate the routing selection metric to choose the best route from all the feasible paths. At last, a selective forwarding scheme is presented to effectively forward the packets in the selected route, by taking into account the nodal movement and signal propagation characteristics. Finally, we implement our protocol on NS2 with different complexity maps and simulation parameters. Numerical results demonstrate that, compared with the existing schemes, when the packets generate speed, the number of vehicles and number of connections are varying, our proposed ASGR still performs best in terms of packet delivery ratio and average transmission delay with an up to 15% and 94% improvement, respectively.

93 citations


Journal ArticleDOI
TL;DR: This work proposes a robust 3-D localization method for partially connected UOWSNs, which can accommodate the outliers and optimize the placement of the anchors to improve the localization accuracy.
Abstract: Location is one of the basic information required for underwater optical wireless sensor networks (UOWSNs) for different purposes, such as relating the sensing measurements with precise sensor positions, enabling efficient geographic routing techniques, and sustaining link connectivity between the nodes. Even though various 2-D UOWSNs’ localization methods have been proposed in the past, the directive nature of optical wireless communications and 3-D deployment of sensors require to develop 3-D underwater localization methods. Additionally, the localization accuracy of the network strongly depends on the placement of the anchors. Therefore, we propose a robust 3-D localization method for partially connected UOWSNs, which can accommodate the outliers and optimize the placement of the anchors to improve the localization accuracy. The proposed method formulates the problem of missing pairwise distances and outliers as an optimization problem, which is solved through half quadratic minimization. Furthermore, analysis is provided to optimally place the anchors in the network, which improves the localization accuracy. The problem of optimal anchor placement is formulated as a combination of Fisher information matrices for the sensor nodes where the condition of D-optimality is satisfied. The numerical results indicate that the proposed method outperforms the literature substantially in the presence of outliers.

61 citations


Journal ArticleDOI
TL;DR: A distributed routing protocol DGGR is proposed, which comprehensively takes into account sparse and dense environments to make routing decisions and performs best in terms of average transmission delay and packet delivery ratio by varying the packet generating speed and density.
Abstract: Due to the random delay, local maximum and data congestion in vehicular networks, the design of a routing is really a challenging task especially in the urban environment. In this paper, a distributed routing protocol DGGR is proposed, which comprehensively takes into account sparse and dense environments to make routing decisions. As the guidance of routing selection, a road weight evaluation (RWE) algorithm is presented to assess road segments, the novelty of which lies that each road segment is assigned a weight based on two built delay models via exploiting the real-time link property when connected or historic traffic information when disconnected. With the RWE algorithm, the determined routing path can greatly alleviate the risk of local maximum and data congestion. Specially, in view of the large size of a modern city, the road map is divided into a series of Grid Zones (GZs). Based on the position of the destination, the packets can be forwarded among different GZs instead of the whole city map to reduce the computation complexity, where the best path with the lowest delay within each GZ is determined. The backbone link consisting of a series of selected backbone nodes at intersections and within road segments, is built for data forwarding along the determined path, which can further avoid the MAC contentions. Extensive simulations reveal that compared with some classic routing protocols, DGGR performs best in terms of average transmission delay and packet delivery ratio by varying the packet generating speed and density.

59 citations


Journal ArticleDOI
TL;DR: This work proposes and implements a new mechanism for geographic routing based on a weighted centroid localization technique, where the positions of unknown nodes are calculated using fuzzy logic method to minimize the position error of nodes and reduces the error localization average.

55 citations


Journal ArticleDOI
TL;DR: This paper proposes a new strategy named Path Aware GPSR (PA-GPSR), which includes additional extension tables in the Neighbors’ Table to select the best path and bypass the nodes that have delivered such previous packets in recovery mode, and can eliminate packet routing loops.
Abstract: Geographic routing has been widely studied over the years as an effective solution for Vehicular Ad Hoc Networks (VANETs), especially because of the availability of wireless devices and global positioning system services. Given the unpredictable behavior of VANETs, selecting the next relay node has been proved a very challenging task. Therefore, in order to maintain acceptable network performance, the routing algorithm needs to be carefully designed to adapt to the fast network changes. The Geographic Perimeter Stateless Routing (GPSR) protocol is a widely adopted position-based routing protocol for VANETs, which makes it a good benchmark candidate. In this paper, we analyze the shortcomings of GPSR and propose a new strategy named Path Aware GPSR (PA-GPSR), which includes additional extension tables in the Neighbors' Table to select the best path and bypass the nodes that have delivered such previous packets in recovery mode. Moreover, our proposed algorithm can eliminate packet routing loops avoiding the delivery of the same packet to the same neighbor node. These PA-GPSR features can, for instance, help to overcome link-breakage due to the unavoidable reasons, such as road accidents or dead-end roads. We used the Simulation of Urban MObility (SUMO) and Network Simulator-version 3 (NS-3) platform to compare our proposed algorithm to the traditional GPSR and Maxduration-Minangle GPSR (MM-GPSR) in scenarios varying the number of nodes as well as the number of source-destination pairs. Our results show that the proposed PA-GPSR strategy performed better than the traditional GPSR and MM-GPSR when packet loss rate, end-to-end delay, and network yield are considered as performance metrics.

55 citations


Journal ArticleDOI
TL;DR: A novel routing protocol based on fuzzy logic systems is proposed, which can help in coordinating and analyzing contradicting metrics and combines multiple metrics considering vehicles’ position, direction, link quality, and achievable throughput to select the most suitable next-hop for packet forwarding.
Abstract: Vehicular ad hoc networks (VANETs) are envisioned as the future of intelligent transportation systems, which enable various kinds of applications aiming at improving road safety and transportation efficiency. Uni-cast routing is required for many of these applications. As VANET is expected to be massive in terms of number of nodes and amount of generated information, geographic routing protocols are considered the most suitable for such network owing to their scalability. Due to VANETs’ extremely dynamic topology and variable channel condition, multiple metrics related to vehicles’ mobility, link quality, and bandwidth availability need to be considered to make more informed and reliable routing decisions. However, some of these metrics might oppose each other. While the main forwarding strategy in geographic routing selects nodes closer to the destination to maximize distance progress, these nodes are most probably located at the border of the communication range where the probability of link breakage increases. Furthermore, the continuous selection of these nodes without considering their available bandwidth might result in higher packet delays and losses. This paper proposes a novel routing protocol based on fuzzy logic systems, which can help in coordinating and analyzing contradicting metrics. The proposed routing protocol combines multiple metrics considering vehicles’ position, direction, link quality, and achievable throughput to select the most suitable next-hop for packet forwarding. Results from our simulation experiments of relatively dense urban environments show remarkable performance improvements in terms of packet delivery ratio, end-to-end delay, and total network throughput.

49 citations


Journal ArticleDOI
TL;DR: A new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs and increases the throughput, energy efficiency, link quality and scalability, and reduces the delay and energy consumption.
Abstract: In wireless sensor networks (WSN), the nodes are used to collect and gather the data from different environments. Hence, the network consumes more energy which is the main and challenging issue in WSNs. Since the sensor is operating under battery, recharging is impossible and hence the lifetime of each sensor is an important issue. Therefore, it is necessary to introduce new and efficient techniques to extend the network lifetime. In this paper, a new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs. This approach introduces a delay constraint based reliable routing approach which reduces the energy consumption by constructing efficient clusters without increasing the end-to-end delay. Moreover, the proposed technique called the rule based clustering for routing model provides better performance in terms of network lifetime than the other existing techniques since they consume more energy during the formation of clusters and finding the shortest path. Moreover, additional overhead on the cluster head selection is tackled also using rules in this proposed model in an efficient manner by building balanced clusters. The main advantage of the proposed approach is that it extends the lifetime of the network and increases the throughput, energy efficiency, link quality and scalability. The experimental verification of this technique has been carried out using MATLAB simulations and proved that this model increases the packet delivery rate, network performance and reduces the delay and energy consumption.

44 citations


Journal ArticleDOI
TL;DR: A new metric called depth threshold is introduced to minimize the number of hops between source and destination while ensuring successful packet delivery and the proposed routing techniques perform better than the selected existing ones in terms of good-put and energy cost of the network.
Abstract: In this paper, depth and reliability aware delay sensitive (DRADS), interference aware DRADS (iDRADS) and cooperative iDRADS (Co-iDRADS) routing protocols are proposed for maximizing network good-put while minimizing end-to-end delay. We have introduced a new metric called depth threshold to minimize the number of hops between source and destination while ensuring successful packet delivery. Our interference aware and co-operative routing based algorithms select the best relay node at each hop. Extensive simulation results validate that the proposed routing techniques perform better than the selected existing ones in terms of good-put and energy cost of the network.

32 citations


Journal ArticleDOI
TL;DR: A stateless greedy forwarding is proposed that uses an area knowledge obtained from the satellite imagery (available at the edge cloud) by applying deep learning to proactively avoid the local minimum problem by diverting traffic with an algorithm that emulates electrostatic repulsive forces.

31 citations


Journal ArticleDOI
TL;DR: A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes that tolerates static and dynamic faults.
Abstract: Dragonfly networks have been widely used in the current high-performance computers or high-end servers. Fault-tolerant routing in dragonfly networks is essential. The rich interconnects provide good fault-tolerance ability for the network. A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes. The new fault-tolerant routing algorithm tolerates static and dynamic faults. Our method can determine whether a packet can reach the destination at the source by using the new safety information model, which avoids dead-ends and aimless misrouting. Sufficient simulation results show that the proposed fault-tolerant routing algorithm even outperforms the previous minimal routing algorithm in fault-free networks in many cases.

21 citations


Journal ArticleDOI
TL;DR: In uniform and random deployment scenarios, the MATLAB-based evaluation result has revealed that when the communication range increases, the probability of finding one-hop predicted forwarders to reach multicast destinations also increases.
Abstract: In the past decades, the unmanned aerial systems have been utilized only for military operations. However, recently, the potential uses and applicability of unmanned aerial vehicles (commonly known...

Journal ArticleDOI
TL;DR: A routing scheme with an inverse reinforcement learning concept to learn the reward function in real time to improve the performance and efficiency of unmanned robotic networks (URNs) and evaluate the performance of the RFLQGeo in comparison with other protocols.
Abstract: This letter proposes a new scheme that uses Reward Function Learning for Q-learning-based Geographic routing (RFLQGeo) to improve the performance and efficiency of unmanned robotic networks (URNs). High mobility of robotic nodes and changing environments pose challenges for geographic routing protocols; with multiple features simultaneously considered, routing becomes even harder. Q-learning-based geographic routing protocols (QGeo) with preconfigured reward function encumber the learning process and increase network communication overhead. To solve these problems, we design a routing scheme with an inverse reinforcement learning concept to learn the reward function in real time. We evaluate the performance of the RFLQGeo in comparison with other protocols. The results indicate that the RFLQGeo has a strong ability to organize multiple features, improve network performance, and reduce the communication overhead.

Journal ArticleDOI
07 Jan 2019-Sensors
TL;DR: Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem and the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.
Abstract: The geographic routing protocol only requires the location information of local nodes for routing decisions, and is considered very efficient in multi-hop wireless sensor networks. However, in dynamic wireless sensor networks, it increases the routing overhead while obtaining the location information of destination nodes by using a location server algorithm. In addition, the routing void problem and location inaccuracy problem also occur in geographic routing. To solve these problems, a novel fuzzy logic-based geographic routing protocol (FLGR) is proposed. The selection criteria and parameters for the assessment of the next forwarding node are also proposed. In FLGR protocol, the next forward node can be selected based on the fuzzy location region of the destination node. Finally, the feasibility of the FLGR forwarding mode is verified and the performance of FLGR protocol is analyzed via simulation. Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem. Compared with existing protocols, the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.

Journal ArticleDOI
TL;DR: A Quality of Forwarding-based reliable geographic routing (QFRG) in urban vehicular ad hoc networks (VANETs) is proposed, where the best route is determined by guaranteeing the QoF and satisfying the link reliability requirement.
Abstract: Because of the dynamic topology, high mobility of nodes, and complicated channel environments in urban areas, existing routings methods are susceptible to frequent link interruptions and channel congestions. To address these issues, a Quality of Forwarding (QoF)-based reliable geographic routing (QFRG) in urban vehicular ad hoc networks (VANETs) is proposed, where the best route is determined by guaranteeing the QoF and satisfying the link reliability requirement. Two theoretical models for QoF and link reliability analysis are first presented. Taking into consideration the transmission cost and the packet delivery ratio, the QoF is, then, employed to provide the quantitative evaluation to the road segments through the presented road weight evaluation (RWE) scheme, which takes into account the impact of the relative position of links on the network performance. Next, to accommodate the network scale of an urban city, the city map is divided into smaller grid zones. Based on the position of the destination, different transmission strategies are presented for packet forwarding. The extensive simulations demonstrate our protocol's superiority in both transmission delay and packet delivery ratio compared with the existing schemes.

Journal ArticleDOI
TL;DR: Evaluation results reveal that the ERGR-EMHC significantly improves the energy consumption, average delay, packet delivery ratio and network overhead in all tested scenarios compared to VBF and GBPR routing protocols.

Journal ArticleDOI
TL;DR: CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission and results show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.
Abstract: The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

Journal ArticleDOI
TL;DR: A greedy perimeter stateless routing algorithm (GPSR) into three dimensions named GPSR-3D, which is of great reliability, energy efficiency and storage efficiency, and performs much better than MDT and GDSTR-3d in terms of average storage cost and the average storage space.
Abstract: Smart factory is a typical application scene of Internet of Things and wireless terminal devices naturally compose a three-dimensional (3-D) industrial wireless network. A primary requirement in the network is delivering packets from source node to destination node. Most geographic routing algorithms are designed for planar networks and they do not suit 3-D networks. In this paper, we extend a greedy perimeter stateless routing algorithm (GPSR) into three dimensions named GPSR-3D. In GPSR-3D, each node decides next hop of a packet by cooperating with only local neighbors and hence this algorithm is totally distributed. GPSR-3D comprises two packet forwarding patterns named greedy forwarding pattern (GFP) and surface forwarding pattern (SFP). In GFP, a node always sends the packet to a neighbor closest to destination and when it fails, SFP is employed for recovery. In SFP, we first divide the whole network space into a set of subspaces based on a novel 3-D geometric structure. Then, a parallel polyhedron traverse algorithm is proposed to recover local minima. A flowchart of GPSR-3D is given to clearly present the process of delivering a packet based on GFP and SFP. Simulation results show that GPSR-3D is of great reliability, energy efficiency and storage efficiency. Specifically, data transmission amount in GPSR-3D is about 67% and 71% to that of multihop Delaunay triangulation (MDT) and GDSTR-3D on average. Moreover, GPSR-3D performs much better than MDT and GDSTR-3D in terms of average storage cost and the average storage space in GPSR-3D is about 48% and 26% to that of MDT and GDSTR-3D, respectively.

Journal ArticleDOI
TL;DR: The proposed PS-ROGR technique improves the network lifetime by 22% and reduces the average end to end delay by 46% and the packet delivery ratio is enhanced up to 11% and energy consumption is minimized to 16% with the help of this technique.
Abstract: In a Mobile ad hoc network (MANET), scalability, dynamic topology and high mobility are the most significant challenges to perform the routing with improved network lifetime. According to the geographical location, geographic routing termed as position-based routing performs data transmission between source node and destination node in a MANET. But, geographic routing protocols were not able achieve effective routing with enhanced network lifetime by improving the resource optimization and optimal coverage performance. In order to improve the resource optimization and network lifetime, an efficient Particle Swarm based Resource Optimized Geographic Routing (PS-ROGR) technique is introduced in MANET. Initially, each particle (i.e. mobile node) movement in a network is controlled by its local best known position in the search space (i.e. geographic location). The PSO permits all the particles in the network to communicate with the other particles with minimum energy. The particle which has the better global best function is selected for energy efficient routing based on the fitness value. Therefore the entire particles share the similar best position to optimize the network resources. Thereby, the PS-ROGR technique prolong the lifetime of the network with minimum energy utilization. Simulation is carried out on the factors such as packet delivery ratio, average end to end delay, energy consumption and network lifetime. Thus, the proposed PS-ROGR technique improves the network lifetime by 22% and reduces the average end to end delay by 46%. Then, the packet delivery ratio is enhanced up to 11% and energy consumption is minimized to 16% with the help of proposed PS-ROGR technique.

Proceedings ArticleDOI
01 Aug 2019
TL;DR: This paper proposes a new geographic routing strategy of applying NDN in vehicular networks with Delay Tolerant Networking (DTN) support, called GeoDTN-NDN, and introduces a hybrid geographic routing solution with restricted greedy, greedy, perimeter, and DTN modes in packet forwarding.
Abstract: The Vehicular Ad Hoc Network (VANET) is used for communication among vehicles to provide traffic and other important information critical for smart transportation. Named Data Networking (NDN) is a recently proposed future Internet architecture that focuses on what the content is rather than where the host is. In this paper, we propose a new geographic routing strategy of applying NDN in vehicular networks with Delay Tolerant Networking (DTN) support, called GeoDTN-NDN. One challenge of using NDN in VANET is that in addition to the flooding problem of interest forwarding, data forwarding and delivery may also experience disruption because of the high mobility of vehicles in VANETs. We adapt geographical routing mechanisms to deal with the flooding problem of interest forwarding and the disruption problem of data forwarding in NDN. We introduce a hybrid geographic routing solution with restricted greedy, greedy, perimeter, and DTN modes in packet forwarding. To evaluate the performance, we compare the results of our solution with the original Vehicular Inter-Networking via Named Data Networking (V-NDN). Our hybrid geographic routing solution that deals with both interest forwarding and data delivery results in better performance.

Journal ArticleDOI
Khaled Hadi1
TL;DR: This work exploits the directional forwarding exhibited in geographic routing where a sensor node could be passed by several redundant data messages and shows that a degree of data aggregation and a reduction in energy consumption are accomplished compared with no aggregation at all.

Posted Content
TL;DR: In this article, a cross-layer optimized routing protocol (VL-ROUTE) is proposed to maximize the throughput of the network by taking into account the reliability of routes.
Abstract: Visible Light Ad Hoc Networks (LANETs) is being perceived as an emerging technology to complement Radio Frequency (RF) based ad hoc networks to reduce congestion in the overloaded RF spectrum. LANET is intended to support scenarios requiring dense deployment and high data rates. In Visible Light Communication (VLC), most of the attention has been centered around physical layer with emphasis on point-to-point communication. In this work, we focus on designing a routing protocol specifically to overcome the unique challenges like blockage and deafness that render routes in LANETs highly unstable. Therefore, we propose a cross-layer optimized routing protocol (VL-ROUTE) that interacts closely with the Medium Access Control (MAC) layer to maximize the throughput of the network by taking into account the reliability of routes. To accomplish this in a distributed manner, we carefully formulate a Route Reliability Score (RRS) that can be computed by each node in the network using just the information gathered from its immediate neighbors. Each node computes an RRS for every known sink in the network. RRS of a given node can be considered as an estimate of the probability of reaching a given sink via that node. The RSS value is then integrated to the utility based three-way handshake process used by the MAC protocol (VL-MAC) to mitigate the effects of deafness, blockage, hidden node, and maximize the probability of establishing full-duplex links. All these factors contribute towards maximizing the network throughput. Extensive simulation of VL-ROUTE shows 124% improvement in network throughput over a network that uses Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) along with shortest path routing. Additionally, VL-ROUTE also showed up to 21% improvement in throughput over the network that uses VL-MAC along with a geographic routing.

Journal ArticleDOI
TL;DR: Infrastructure-aided hybrid routing that uses a roadside unit (RSU) to help vehicular nodes to select idle channels and relay nodes and proves better performance in delay, delivery ratio, and overhead by comparing the proposed technique with two existing techniques.
Abstract: With long delays due to sporadic routing links in cognitive vehicular communications systems, relay node selection is one of the key design factors, as it significantly improves end-to-end delay, thereby improving overall network performance. To this end, we propose infrastructure-aided hybrid routing that uses a roadside unit (RSU) to help vehicular nodes to select idle channels and relay nodes. Channel selection is done with a belief propagation algorithm, which aggregates individual beliefs with the help of vehicles and RSUs to make a final belief, providing high accuracy in hypotheses about spectrum availability. The selection of a relay node is determined by calculating the message delivery time—the source/relay node selects the one that has the minimum message delivery time from among all the neighboring nodes. This is a hybrid (vehicle-to-vehicle and vehicle-to-RSU) communications scheme where two nodes can communicate only when they have consensus about a common idle channel. The idea is to combine cognitive capabilities with a routing technique in order to simultaneously overcome spectrum scarcity and network connectivity issues. Therefore, both dense and sparse network conditions are considered in this routing protocol for both highway and city scenarios. To enhance the stability of cognitive routing links, different functions for vehicles and RSUs are considered. We prove better performance in delay, delivery ratio, and overhead by comparing the proposed technique with two existing techniques (one dealing with, and another without, RSUs).

Proceedings ArticleDOI
24 Jun 2019
TL;DR: A geographic routing algorithm for efficient data dissemination in electromagnetic WNSN is proposed in the context of a health-monitoring application where multiple nano-devices are deployed in an artery and results confirm that the geographic routing scheme is scalable and energy efficient without impairing the packet delivery ratio.
Abstract: Recent advances in wireless communications and electronics have enabled the development of nano sensor nodes that are able to process and transmit sensed data. These tiny sensor nodes leverage the idea of nano sensor networks that are expected to find several applications such as health care monitoring, wildlife surveillance, etc. The networking of several nano-devices is still a major open issue. In fact, the very limited transmission ranges in the terahertz band renders direct communication between nano-devices unfeasible most of the time. Hence, multihop communication among nano-nodes is currently regarded as the viable solution for nano-network realization. However, the simplicity and energy constraints of nano-sensor nodes are far from the complexity of classical multi-hop routing and forwarding protocols. On the other hand, researches on dedicated communications protocols for Wireless Nano Sensor Networks (WNSNs) are still in their early stage. In this paper, we propose a geographic routing algorithm for efficient data dissemination in electromagnetic WNSN. We evaluate our solution in the context of a health-monitoring application where multiple nano-devices are deployed in an artery. We compare our proposal to the flooding scheme and results confirm that the geographic routing scheme is scalable and energy efficient without impairing the packet delivery ratio.

Proceedings ArticleDOI
01 Dec 2019
TL;DR: This paper aims at proposing a lightweight distributed geographic routing protocol, which can prolong the lifetime of WSNs under the hole occurrence and strongly outperforms state-of-the-art protocols in terms of the network lifetime, packet latency and energy consumption.
Abstract: Geographic routing is one of the most popular routing protocols in wireless sensor networks (WSNs) due to its simplicity and efficiency. However, with the occurrence of holes, geographic routing incurs with the so-called local minimum problem that may lead to a long hole detour path as well as the traffic concentration around the hole boundary. In consequence, the network lifetime is shortened. In this paper, we aim at proposing a lightweight distributed geographic routing protocol, which can prolong the lifetime of WSNs under the hole occurrence. Our main idea is to exploiting Q-learning technique to estimate the distance from a node to the holes. The routing decision is then determined based on the residual energy of the nodes, their estimated distance to the holes, and their distance to the destination. The simulation experiments show that our protocol strongly outperforms state-of-the-art protocols in terms of the network lifetime, packet latency and energy consumption. Specifically, our proposed protocol extends the network lifetime by more than 12% compared to the existing protocols.

Proceedings ArticleDOI
10 Jun 2019
TL;DR: This work proposes a cross-layer optimized routing protocol (VL-ROUTE) that interacts closely with the Medium Access Control (MAC)layer to maximize the throughput of the network by taking into account the reliability of routes.
Abstract: Visible Light Ad Hoc Networks (LANETs)is being perceived as an emerging technology to complement Radio Frequency (RF)based ad hoc networks to reduce congestion in the overloaded RF spectrum. LANET is intended to support scenarios requiring dense deployment and high data rates. In Visible Light Communication (VLC), most of the attention has been centered around physical layer with emphasis on point-to-point communication. In this work, we focus on designing a routing protocol specifically to overcome the unique challenges like blockage and deafness that render routes in LANETs highly unstable. Therefore, we propose a cross-layer optimized routing protocol (VL-ROUTE)that interacts closely with the Medium Access Control (MAC)layer to maximize the throughput of the network by taking into account the reliability of routes. To accomplish this in a distributed manner, we carefully formulate a Route Reliability Score (RRS)that can be computed by each node in the network using just the information gathered from its immediate neighbors. Each node computes an RRS for every known sink in the network. RRS of a given node can be considered as an estimate of the probability of reaching a given sink via that node. The RSS value is then integrated to the utility based three-way handshake process used by the MAC protocol (VL-MAC)to mitigate the effects of deafness, blockage, hidden node, and maximize the probability of establishing full-duplex links. All these factors contribute towards maximizing the network throughput. Extensive simulation of VL-ROUTE shows 124% improvement in network throughput over a network that uses Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA)along with shortest path routing. Additionally, VL-ROUTE also showed up to 21% improvement in throughput over the network that uses VL-MAC along with a geographic routing.

Journal ArticleDOI
TL;DR: A Junction-Aware vehicle selection for Multipath Video Streaming (JA-MVS) scheme, based on the multipath data forwarding concept using greedy-based geographic routing, which is compared against two baseline schemes in urban Vehicular Ad-Hoc Networks (VANETs).
Abstract: In multipath video streaming transmission, the selection of the best vehicle for video packet forwarding considering the junction area is a challenging task due to the several diversions in the junction area. The vehicles in the junction area change direction based on the different diversions, which lead to video packet drop. In the existing works, the explicit consideration of different positions in the junction areas has not been considered for forwarding vehicle selection. To address the aforementioned challenges, a Junction-Aware vehicle selection for Multipath Video Streaming (JA-MVS) scheme has been proposed. The JA-MVS scheme considers three different cases in the junction area including the vehicle after the junction, before the junction and inside the junction area, with an evaluation of the vehicle signal strength based on the signal to interference plus noise ratio (SINR), which is based on the multipath data forwarding concept using greedy-based geographic routing. The performance of the proposed scheme is evaluated based on the Packet Loss Ratio (PLR), Structural Similarity Index (SSIM) and End-to-End Delay (E2ED) metrics. The JA-MVS is compared against two baseline schemes, Junction-Based Multipath Source Routing (JMSR) and the Adaptive Multipath geographic routing for Video Transmission (AMVT), in urban Vehicular Ad-Hoc Networks (VANETs).

Journal ArticleDOI
TL;DR: Numerical results show that the proposed PTCCR outperforms two state-of-art routings, i.e., the real-time intersection-based segment aware routing protocol (RTISAR) and Reliable Traffic Aware Routing Protocol (RTAR), in terms of packet delivery ratio, average end-to-end delay and communication overhead.
Abstract: In Internet of Vehicles (IoV), high vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, variation of network topology and constraints for routing protocols. Besides, with vehicular positions and street-level digital maps available, the intersection-based geographic routing becomes indispensable considering its ability for avoid forwarding packets through segments with low network density and high scale of network disconnections. In this paper, considering the benefits of intersection-based routing and challenges of high dynamic IoV, a Path Transmission Costs-based Multi-lane Connectivity Routing protocol (PTCCR) is proposed with the help from intersection nodes and/or neighboring nodes. First, we investigate the multi-lane connectivity based on vehicular speed under free-flow state for various types of road sections. Second, A Path Transmission costs (PTC) measurement mechanism is proposed considering the impact of the sequence of selected sections or intersections on the routing performance. After that, the PTC of sent packets is quantitatively analyzed and used as the path selection metric. Finally, the path with the largest multi-lane connectivity and lowest PTC is selected as the optimal path taking the transmission direction, neighbor's location and destination position into account. Numerical results show that our proposed PTCCR outperforms two state-of-art routings, i.e., the real-time intersection-based segment aware routing protocol (RTISAR) and Reliable Traffic Aware Routing protocol (RTAR), in terms of packet delivery ratio, average end-to-end delay and communication overhead.

Patent
18 Jan 2019
TL;DR: In this article, a distance-based energy balance dynamic geographic routing method in an underwater sensor network is proposed. But the method comprises the steps: establishing and maintaining a neighbor node table; selecting neighbor nodes that forward a data packet according to the neighbor node tables to form a data-packet forwarding area; calculating a forwarding factor; and setting the time for the adjacent sensor nodes in waiting for the forwarding of the data packet, according to forwarding factor.
Abstract: The invention discloses a distance-based energy balance dynamic geographic routing method in an underwater sensor network, and the method comprises the steps: establishing and maintaining a neighbor node table; selecting neighbor nodes that forward a data packet according to the neighbor node table to form a data packet forwarding area; calculating a forwarding factor; and setting the time for theadjacent sensor nodes in waiting for the forwarding of the data packet according to the forwarding factor. The method performs routing selection through the coordinate position information of the nodes, effectively compensates for some defects of a topology information routing method, dynamically adjusts the size of the forwarding area, reduces excessive redundant nodes for sending data, and enables a routing protocol to have dynamic adaptability. The greater the remaining energy of a node is, the easier it is to forward data, and vice versa. Finally, energy balance can be achieved.

Journal ArticleDOI
TL;DR: This paper presents and implements two algorithms for geographic routing that are based purely on distance-vector data and another, more complicated algorithm based on path data, and shows that the algorithms converge relatively quickly following link drops.

Journal ArticleDOI
TL;DR: This paper provides a comprehensive investigation of recently proposed Geographical Routing Protocols (GRPs) and open issues and future orientations are included in order to motivate the further research.
Abstract: Over the past few years, Vehicular Delay Tolerant Networks (VDTNs) have been exploited in those communications that do not take place through end-to-end connectivity. VDTNs framework is characterised by frequent disconnection, network partitioning, and high delay. A number of routing protocols have already been proposed for VDTN. These protocols make effort to achieve significant delivery potential with low network overhead. Geographic routing is an alternative. The protocols in geographic routing utilise the fact that most vehicles are equipped with Global Positioning System (GPS). The major concern of Geographical Routing Protocols (GRPs) is to enhance the delivery potential and to minimise the delay. This paper provides a comprehensive investigation of recently proposed GRPs. Additionally, open issues and future orientations are included in order to motivate the further research.