Geographic Opportunistic Routing Research Articles

Improved geographic opportunistic routing protocol for void hole elimination in underwater IoTs: Parameter tuning by TSA optimization

SummaryUnderwater IoT is incredibly helpful in monitoring a variety of jobs, from instrument monitoring to climate recording, from pollution management to natural catastrophe forecasting. Nevertheless, there exist various issues that have an impact on a network's efficiency such as the formation of void holes, excessive EC, and low PDR. As a result, the IGOR protocol is suggested in this study to increase PDR by reducing the percentage of void hole occurrence. The developed routing protocols' scalability is also examined. Here, the parameter optimization for the EC minimization and PDR maximization is performed by a meta‐heuristic optimization algorithm referred to as TSA. In order to verify that the suggested protocol is EC‐optimal by calculating the viable areas. In addition, suggested protocols are evaluated against contemporaries' benchmark routing protocols. The outcomes of the simulations clearly demonstrate that the suggested routing protocols obtained greater PDR than the current techniques. Additionally, there exists a reduction in the ratio of void hole incidence. Comparative research reveals that suggested routing protocols outperformed benchmark routing protocols by 80–81% in PDR. Further, the suggested routing procedures reduced the frequency of void holes by around 30%.

A Novel Hybridized Cluster-Based Geographical Opportunistic Routing Protocol for Effective Data Routing in Underwater Wireless Sensor Networks

Underwater wireless sensor nodes comprise hundreds to thousands of battery-operated sensor nodes with limited bandwidth. These networks are employed to transmit the data with enhanced quality of service (QoS). However, efficient data routing is the most challenging obstacle in many underwater applications. To solve the issues in underwater sensor nodes, the hybridized cluster-based geographical opportunistic routing protocol with distance vector establishment has been proposed to transmit the data efficiently. Primarily, the proposed methodology finds out the shortest path with minimal hop count whereas the void node can be updated with infinite hop count. Thereafter, the sleep/wake scheduling and waiting mechanism and periodic beaconing algorithm are incorporated into the proposed model to attain a higher packet delivery ratio with minimal energy consumption. This proper scheduling and optimal cluster routing enhance the continuous data transmission in underwater applications. The simulation result reveals that the proposed method achieves better energy efficiency and higher network lifetime when compared with the existing clustering methods.

Shadowing-fading-based intersection geographic opportunistic routing protocol for urban VANETs

Shadowing-fading-based intersection geographic opportunistic routing protocol for urban VANETs

WITHDRAWN: An efficient biometric based authenticated geographic opportunistic routing for IoT applications using secure wireless sensor network

The applications of Wireless Sensor Networks (WSNs) are been broadly utilized in the field of Internet of Things (IoT) under communication framework. Notwithstanding services gave by the WSNs, numerous IoT-related applications necessitate reliable and secure delivery of data over unsteady remote connections. In-order to ensure secure and reliable delivery of data, many existing paper works accomplish authentication based routing algorithms with numerous forwarders within the Wireless Sensor Networks. Be that as it may; these types of approaches are vulnerable to genuine attacks like Denial of Service (DoS), where countless duplicate data packets are intentionally dispatched to destination node which disturbs the typical activities of wireless sensor networks. So, here we propose a new scheme of security algorithm for the wireless sensor networks. Our method, Biometric based-Authenticated Geographic Opportunistic Routing (BAGOR) algorithm depends on the user biometrics to shield the violation of DoS attacks, in order to meet out the validness requirements and reliability in the network. By examining biometric and statistic state information (SSI) of remote connections, BAGOR uses a trust model as statistic state information to get better proficiency of packet delivery. Dissimilar to past pioneering routing algorithm, BAGOR guarantees data honesty by building up an entropy-deployed selective validation algorithm and can detach DoS aggressors and reduce the computational expense. Thus, the eveloped procedure is assessed and compared with already existing security techniques. The simulations show that BAGOR decreasing system traffic, shielding against Denial of Service attacks, and expanding the lifetime of a sensor node in the network. Thus, the usefulness and execution of the whole system is enhanced.

Secure Localization Based Authentication (SLA) Strategy for Data Integrity in WNS

Wireless Sensor Networks (WSN) has been extensively utilized as a communication model in Internet of Things (IoT). As well, to offer service, numerous IoT based applications need effective transmission over unstable locations. To ensure reliability, prevailing investigations exploit multiple candidate forwarders over geographic opportunistic routing in WSNs. Moreover, these models are affected by crucial denial of service (DoS) attacks, where huge amount of invalid data are delivered intentionally to the receivers to disturb the functionality of WSNs. Here, secure localization based authentication (SLA) is presented to fight against DoS attack, and to fulfil the need of reliability and authentication. By examining state information, SLA projects a trust model to enhance efficacy of data delivery. Indeed, of the prevailing opportunistic protocols, SLA guarantees data integrity by modelling a trust based authentication, providing protection against DoS attackers and diminishing computational costs. Specifically, this model acts as a verification strategy to accelerate? attackers and to handle isolation. This strategy helps SLA in eliminating duplicate transmission and by continuous verification that results from conventional opportunistic routing. Simulation is performed in a MATLAB environment that offers authentic and reliable delivery by consuming approximately 50% of the cost in contrast to other approaches. The anticipated model shows better trade off in comparison to the prevailing ones.

Intersection Routing Based on Fuzzy Multi-Factor Decision for VANETs

Vehicular ad hoc network (VANET) is a special form of mobile ad hoc network (MANET), which plays a key role in the intelligent transportation system (ITS). Though many outstanding geographic routing protocols are designed for VANETs, a majority of them use parameters that only affect routing performance. In this article, we propose an intersection routing based on fuzzy multi-factor decision (IRFMFD), which utilizes several features. The scheme is divided into two parts, namely vehicular decision management and intersection decision management. In the vehicular component, candidate vehicles between two static nodes (SNs) located at two intersections derive potential routing paths considering distance, neighbor quantity, and relative velocity. In the intersection component, the candidate SN was chosen from the current intersection’s 2-hop neighbors which were connected with the current intersection by a route that was decided on in part one. To get the best scheme, we also introduced other factors to estimate the number of hops in each link and link lifetime. The simulation shows that the IRFMFD outperforms on delivery ratio and end-to-end delay compared with AODV (Ad hoc on-demand distance vector), GPSR (Greedy perimeter stateless routing) and GeOpps (Geographical opportunistic routing).

FQ-AGO: Fuzzy Logic Q-Learning Based Asymmetric Link Aware and Geographic Opportunistic Routing Scheme for MANETs

The proliferation of mobile and IoT devices, coupled with the advances in the wireless communication capabilities of these devices, have urged the need for novel communication paradigms for such heterogeneous hybrid networks. Researchers have proposed opportunistic routing as a means to leverage the potentials offered by such heterogeneous networks. While several proposals for multiple opportunistic routing protocols exist, only a few have explored fuzzy logic to evaluate wireless links status in the network to construct stable and faster paths towards the destinations. We propose FQ-AGO, a novel Fuzzy Logic Q-learning Based Asymmetric Link Aware and Geographic Opportunistic Routing scheme that leverages the presence of long-range transmission links to assign forwarding candidates towards a given destination. The proposed routing scheme utilizes fuzzy logic to evaluate whether a wireless link is useful or not by capturing multiple network metrics, the available bandwidth, link quality, node transmission power, and distance progress. Based on the fuzzy logic evaluation, the proposed routing scheme employs a Q-learning algorithm to select the best candidate set toward the destination. We implemented FQ-AGO on the ns-3 simulator and compared the performance of the proposed routing scheme with three other relevant protocols: AODV, DSDV, and GOR. For precise analysis, we considered various network metrics to compare the performance of the routing protocols. The simulation result validates our analysis and demonstrates remarkable performance improvements in terms of total network throughput, packet delivery ration, and end-to-end delay. FQ-AGO achieves up to 15%, 50%, and 45% higher throughput compared to DSDV, AODV, and GOR, respectively. Meanwhile, FQ-AGO reduces by 50% the end-to-end latency and the average number of hop-count.

Low-Cost and Robust Geographic Opportunistic Routing in a Strip Topology Wireless Network

Wireless sensor networks (WSNs) have been used for many long-term monitoring applications with the strip topology that is ubiquitous in the real-world deployment, such as pipeline monitoring, water quality monitoring, vehicle monitoring, and Great Wall monitoring. The efficiency of routing strategy has been playing a key role in serving such monitoring applications. In this article, we first present a robust geographic opportunistic routing (GOR) approach—LIght Propagation Selection (LIPS)—that can provide a short path with low energy consumption, communication overhead, and packet loss. To overcome the complication caused by the multi-turning point structure, we propose the virtual Plane mirror (VPM) algorithm, inspired by the light propagation, which is to map the strip topology into the straight one logically. We then select partial neighbors as the candidates to avoid blindly involving all next-hop neighbors and ensure the data transmission along the correct direction. Two implementation problems of VPM—transmission spread angle and the communication range—are thoroughly analyzed based on the percolation theory. Based on the preceding candidate selection algorithms, we propose a GOR algorithm in the strip topology network. By theoretical analysis and extensive simulation, we illustrate the validity and higher transmission performance of LIPS in strip WSNs. In addition, we have proved that the length of the path in LIPS is two times the length of the shortest path via geometrical analysis. Simulation results show that the transmission success rate of our approach is 26.37% higher than the state-of-the-art approach, and the communication overhead and energy consumption rate are 33.11% and 40.23% lower, respectively.

Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks

To improve energy efficiency and packet delivery ratio in WSNs. We propose a two-hop geographic opportunistic routing (THGOR) protocol that selects a subset of 2-hop neighbours of node which have higher packet reception ratio and residual energy as the next forwarder node, it also selects 1-hop neighbours that have excellent coverage of 2-hop neighbours as relay nodes. The proposed protocol is compared with geographic opportunistic routing (GOR) and efficient QoS-aware geographic opportunistic (EQGOR). GOR and EQGOR select a forwarding sensor node on the basis of distance. However, GOR and EQGOR results in lower packet delivery rate, and quick depletion of energy. The THGOR is comprehensively evaluated through NS-2 and compared results with EQGOR and GOR. Simulation results show that THGOR significant improvement in packet advancement, reliable transmission, energy efficiency and optimises packet transmission delay.

Selective Authentication Based Geographic Opportunistic Routing in Wireless Sensor Networks for Internet of Things Against DoS Attacks

Wireless Sensor Networks (WSNs) have been widely used as the communication system in the Internet of Things (IoT). In addition to the services provided by WSNs, many IoT-based applications require reliable data delivery over unstable wireless links. To guarantee reliable data delivery, existing works exploit geographic opportunistic routing with multiple candidate forwarders in WSNs. However, these approaches suffer from serious Denial of Service (DoS) attacks, where a large number of invalid data are deliberately delivered to receivers to disrupt the normal operations of WSNs. In this paper, we propose a selective authentication-based geographic opportunistic routing (SelGOR) to defend against the DoS attacks, meeting the requirements of authenticity and reliability in WSNs. By analyzing statistic state information (SSI) of wireless links, SelGOR leverages an SSI-based trust model to improve the efficiency of data delivery. Unlike previous opportunistic routing protocols, SelGOR ensures data integrity by developing an entropy-based selective authentication algorithm, and is able to isolate DoS attackers and reduce the computational cost. Specifically, we design a distributed cooperative verification scheme to accelerate the isolation of attackers. This scheme also makes SelGOR avoid duplicate data transmission and redundant signature verification resulting from opportunistic routing. The extensive simulations show that SelGOR provides reliable and authentic data delivery, while it only consumes 50% of the computational cost compared to other related solutions.

Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks

Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks

Fault Activity Aware Service Delivery in Wireless Sensor Networks for Smart Cities

Wireless sensor networks (WSNs) are increasingly used in smart cities which involve multiple city services having quality of service (QoS) requirements. When misbehaving devices exist, the performance of current delivery protocols degrades significantly. Nonetheless, the majority of existing schemes either ignore the faulty behaviors’ variability and time-variance in city environments or focus on homogeneous traffic for traditional data services (simple text messages) rather than city services (health care units, traffic monitors, and video surveillance). We consider the problem of fault-aware multiservice delivery, in which the network performs secure routing and rate control in terms of fault activity dynamic metric. To this end, we first design a distributed framework to estimate the fault activity information based on the effects of nondeterministic faulty behaviors and to incorporate these estimates into the service delivery. Then we present a fault activity geographic opportunistic routing (FAGOR) algorithm addressing a wide range of misbehaviors. We develop a leaky-hop model and design a fault activity rate-control algorithm for heterogeneous traffic to allocate resources, while guaranteeing utility fairness among multiple city services. Finally, we demonstrate the significant performance of our scheme in routing performance, effective utility, and utility fairness in the presence of misbehaving sensors through extensive simulations.

Context sensitive trust based geographic opportunistic routing in mobile ad hoc networks

Position based opportunistic routing (POR) is a stateless, robust, and reliable geographic routing protocol in Mobile AdHoc NETwork (MANET). The opportunistic routing embraces broadcast property of wireless channels and utilizes it for opportunistic forwarding. Both the malicious node behavior and the backup nodes’ behavior are equally treated as malicious in the existing misbehavior detection mechanisms. Hence, incorporating a general trust model in POR is not combative with routing attacks. It is necessary to determine whether the misbehavior is likely a result of malicious activity or due to the backup scenario of opportunistic forwarding. On the other hand, if context-sensitive trust information is available on every node, it ensures a fair decision making and also supports secured routing in an opportunistic approach. This work investigates the utilization of context attributes along with generic trust model to allow POR for secure and reliable data forwarding. This paper introduces context-sensitive trust for choosing the data forwarding node in POR (CPOR) to assist opportunistic routing in selecting the trusted optimal data forwarding node and to cope with both security and reliability of communications. The proposed work exercises both coarse- and fine-grained trust evaluation to strengthen the trustworthiness. The coarse-grained trust measure includes positive progress per hop and behavioral attribute of the nodes in terms of routing service. The fine-grained trust evaluation differs the opportunistic routing environment from the adverse scenarios and aids the source node such that it builds a highly trusted positive progress set using contextual attributes. The fine-grained trust evaluation deduces the ideal contextual information such as the link quality, battery energy, and the backup service to determine the accurate trust value of nodes. As a result, it involves optimal routes and enables CPOR to maintain the routing performance equal to the POR even in the presence of malicious nodes in the network. The simulation results demonstrate that the packet delivery ratio of the proposed context-aware trust model is substantially high even when 50% of the total nodes are found malicious and outperforms the trust-aware opportunistic routing protocol (TAOR).

SGOR: Secure and scalable geographic opportunistic routing with received signal strength in WSNs

Wireless sensor networks (WSNs) are inherently susceptible to attacks as malicious nodes can disrupt the communication from any other node to the sink. To address a wide range of attacks, we propose a novel and comprehensive approach called Secure and Scalable Geographic Opportunistic Routing with received signal strength (SGOR), satisfying the requirements of both security and scalability in WSNs. Unlike most of previous secure protocols relying on infrastructure like anchor nodes, a distributed location verification algorithm is presented to utilize the received signal strength to address the location spoofing attack. As one of opportunistic geographic routings, SGOR provides the property of robustness by taking full advantage of the broadcast nature of wireless channels, and scalability for being inherited from geographic routing. Moreover, an ambient-sensitive trust model is proposed to defend against more kinds of attackers in SGOR. The theoretical results are given to demonstrate the effectiveness and robustness of SGOR to survive more severe attacks. In extensive simulations, we compare SGOR with four other representative protocols. The results show that SGOR achieves about two times higher packet delivery rate with acceptable overhead, particularly in large and highly hostile networks.

A Survey on Opportunistic Routing in Wireless Communication Networks

The great advances made in the wireless technology have enabled the deployment of wireless communication networks in some of the harshest environments such as volcanoes, hurricane-affected regions, and underground mines. In such challenging environments suffering from the lack of infrastructure, traditional routing is not efficient and sometimes not even feasible. Moreover, the exponential growth of the number of wireless connected devices has created the need for a new routing paradigm that could benefit from the potentials offered by these heterogeneous wireless devices. Hence, in order to overcome the traditional routing limitations, and to increase the capacity of current dynamic heterogeneous wireless networks, the opportunistic routing paradigm has been proposed and developed in recent research works. Motivated by the great interest that has been attributed to this new paradigm within the last decade, we provide a comprehensive survey of the existing literature related to opportunistic routing. We first study the main design building blocks of opportunistic routing. Then, we provide a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design. Hence, five opportunistic routing classes are defined and studied in this paper, namely, geographic opportunistic routing, link-state-aware opportunistic routing, probabilistic opportunistic routing, optimization-based opportunistic routing, and cross-layer opportunistic routing. We also review the main protocols proposed in the literature for each class. Finally, we identify and discuss the main future research directions related to the opportunistic routing design, optimization, and deployment.

QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks

QoS routing is an important research issue in wireless sensor networks (WSNs), especially for mission-critical monitoring and surveillance systems which requires timely and reliable data delivery. Existing work exploits multipath routing to guarantee both reliability and delay QoS constraints in WSNs. However, the multipath routing approach suffers from a significant energy cost. In this work, we exploit the geographic opportunistic routing (GOR) for QoS provisioning with both end-to-end reliability and delay constraints in WSNs. Existing GOR protocols are not efficient for QoS provisioning in WSNs, in terms of the energy efficiency and computation delay at each hop. To improve the efficiency of QoS routing in WSNs, we define the problem of efficient GOR for multiconstrained QoS provisioning in WSNs, which can be formulated as a multiobjective multiconstraint optimization problem. Based on the analysis and observations of different routing metrics in GOR, we then propose an Efficient QoS-aware GOR (EQGOR) protocol for QoS provisioning in WSNs. EQGOR selects and prioritizes the forwarding candidate set in an efficient manner, which is suitable for WSNs in respect of energy efficiency, latency, and time complexity. We comprehensively evaluate EQGOR by comparing it with the multipath routing approach and other baseline protocols through ns-2 simulation and evaluate its time complexity through measurement on the MicaZ node. Evaluation results demonstrate the effectiveness of the GOR approach for QoS provisioning in WSNs. EQGOR significantly improves both the end-to-end energy efficiency and latency, and it is characterized by the low time complexity.

LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs

Abstract Robust and efficient data delivery in vehicular ad hoc networks (VANETs) with high mobility is a challenging issue due to dynamic topology changes and unstable wireless links. The opportunistic routing protocols can improve the reliability of routing by making full use of the broadcast characteristics and assist in data transmission through additional backup links. In this paper, we propose a Link State aware Geographic Opportunistic routing protocol (LSGO) which exploits a combination of geographic location and the link state information as the routing metric. The LSGO aims to improve the reliability of data transmission in a highly dynamic environment, which selects the forwarders and prioritizes them based on the vehicle’s geographic location and the link’s quality. We compare the performance of LSGO with GpsrJ + which removes the unnecessary stop at a junction and greedy traffic aware routing protocol (GyTAR) using network simulator ns-2. The simulation results show that it opens more nodes to participate in the opportunistic data forwarding and increases a connection’s throughput while using no more network capacity than traditional routing. In the simulation, compared with other two protocols, when the number of vehicles and the average vehicle velocity increase, LSGO’s packet dropping rate is reduced and the network throughput is improved.

On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks

Geographic opportunistic routing (GOR) is an emerging technique that can improve energy efficiency in lossy multihop wireless networks. GOR makes local routing decision by using nodes' location inf...

Location-Aided Opportunistic Forwarding in Multirate and Multihop Wireless Networks

Routing in multihop wireless networks is challenging, mainly due to unreliable wireless links/channels. Geographic opportunistic routing (GOR) was proposed to cope with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and the spatial diversity of the network topology. Previous studies on GOR have focused on networks with a single channel rate. The capability of supporting multiple channel rates, which is common in current wireless systems, has not carefully been studied for GOR. In this paper, we carry out a study on the impacts of multiple rates, as well as candidate selection, prioritization, and coordination, on the performance of GOR. We propose a new local metric, i.e., the opportunistic effective one-hop throughput (OEOT), to characterize the tradeoff between one-hop packet advancement and packet forwarding time. We further propose a local rate adaptation and candidate-selection algorithm to approach the optimum of this metric. The simulation results show that the multirate GOR (MGOR) incorporating the rate adaptation and candidate-selection algorithm achieves higher throughput and lower delay than the corresponding single-rate and multirate traditional geographic routing and single-rate opportunistic routing protocols.

Capacity of opportunistic routing in multi-rate and multi-hop wireless networks

Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wireless networks. In this paper, we carry out a comprehensive study on the impacts of multiple rates, interference, candidate selection and prioritization on the maximum end-to-end throughput or capacity of OR. Taking into account the wireless interference and unique properties of OR, we introduce the concept of concurrent transmitter sets to represent the constraints imposed by the transmission conflicts of OR, and formulate the maximum end-to-end throughput problem as a maximum-flow linear programming subject to the transmission conflict constraints. We also propose two multi-rate OR metrics: expected medium time (EMT) and expected advancement rate (EAR), and the corresponding distributed and local rate and candidate set selection schemes, one of which is least medium time OR (LMTOR) and the other is multi-rate geographic OR (MGOR). We compare the capacity of multi-rate OR with single-rate ones under different settings. We show that our proposed multi-rate OR schemes achieve higher throughput bound than any single-rate GOR. We observe some insights of OR: 1) although involving more forwarding candidates increases the end-to-end capacity, the capacity gained from involving more forwarding candidates decreases; 2) there exists a node density threshold, higher than which 24 Mbps GOR performs better than 12 Mbps GOR, and vice versa.