Opportunistic Routing Mechanism Research Articles

A Reliable Transmission on Cluster Based Wireless Ad Hoc Network with Adaptive Negotiations Using Vector Assisted Energy Efficient Dynamic Opportunistic Routing Mechanism

A Reliable Transmission on Cluster Based Wireless Ad Hoc Network with Adaptive Negotiations Using Vector Assisted Energy Efficient Dynamic Opportunistic Routing Mechanism

An energy-efficient cross-layer-based opportunistic routing protocol and partially informed sparse autoencoder for data transfer in wireless sensor network

When sensor nodes in wireless sensor networks (WSNs) have limited energy, data minimization is crucial. Usually, data communications use up energy. A sensor node's lifespan can frequently be increased by sending and receiving the proper quantity of data. The PISAE (Partially Informed Sparse Autoencoder) is a state-of-the-art unmapped neural network architecture designed to reconstruct all sensor inputs from a limited number of sensors. It is presented in this publication. Use this architecture to create a system for selecting sensors. We now propose the cross-layer based opportunistic routing protocol (CORP) as an opportunistic routing mechanism for WSNs. In order to cut down on processing time and energy consumption and increase the dependability of data transfer, the best way is selected utilizing the CORP technique, which is suggested.For energy-efficient routing based combinatorial random sampling bat optimisation (ERFN-CSSBO), we also suggest using fuzzy neural networks. This enables you to conserve energy, increase the lifespan of your wireless sensor network, and keep your energy consumption in check. With CSSBO (Combined Random Sampling Prevosti Bat Optimisation), the best path is identified by integrating features (such as distance, energy, trust, and internode measurement connection stability) from all the bats.The key challenge in WSN is choosing cluster heads (CH). K-Medoid is used to enhance sensor node clustering. Important considerations include the effect on quality of service (QoS), sensor node position, proximity, and energy state needs. This study combines Hybrid BFO (Bacterial Foraging Optimization) and HSA (Harmony Search Algorithm), two well-known optimization techniques, to pick cluster heads in wireless sensor networks that are optimal in terms of distance and energy. On-task completion. The outcomes of the simulation indicate that the proposed technique improves QoS. Endpoints, throughput (1.0 Mbps), (98.5 % of packets are forwarded), and packet loss rate (1.5 %), and other QoS factors are all included in the performance statistics plotted. It performs better than conventional routing protocols in terms of network lifetime (6100 rounds), delay at both ends (1.5 s), and energy usage (30.35 mJ).

CED-OR Based Opportunistic Routing Mechanism for Underwater Wireless Sensor Networks

CED-OR Based Opportunistic Routing Mechanism for Underwater Wireless Sensor Networks

A Novel Cognitive Opportunistic Communication Framework for Coal Mines

The dynamic advancement and harsh environment of coal mines often result in intermittent or regional wireless connection between sending nodes and receiving nodes and then lead to the decrease of transmission success ratio and even failure. To solve this problem, the environmental cognition and best-effort transmission are both demanded. Here we proposed a novel communication framework for coal mines based on a cognitive opportunistic concept to address the wireless network communication problems in coal mines, which consists of the node mobility model in coal mines, cooperative cognition of the time-varying communication environment, and the opportunistic routing of intermittent or regional connection scenarios. To realize this framework, real time neighbor discovering mechanisms and mobility perceiving strategies, called environment cognition, must be deeply investigated to predict the trends of node movement. The obtained results of environment cognition are then used to analyze current channel characteristics in order to determine and set optimum communication system parameters and reduce the probability of intermittent or regional connection. To address those unavoidable situations of the intermittent or regional connection, the opportunistic routing mechanism is brought forward to provide relatively stable data transmission. Finally, as an example of cognitive opportunistic mine communication of this framework, personnel evacuation under an emergency is discussed.

RTGOR: Reliability and Timeliness Guaranteed Opportunistic Routing in wireless sensor networks

Cyber-physical systems (CPSs) connect physical equipment and the information system to realize real-time perception and intelligent control of the equipment. With the rapid development of wireless sensors, wireless sensor networks (WSNs) now play a major role in CPS and have become a focus of research. However, WSNs in CPS face great challenges in ensuring the high reliability and time critical performance of data transmission because of the characteristics of the complex structure and dynamic connectivity. In order to meet the performance requirement of CPS data transmission, a Reliability and Timeliness Guaranteed Opportunistic Routing (RTGOR) protocol is proposed that is based on opportunistic routing and combined with quantified transmission reliability and time guarantees. Our simulation results demonstrate that RTGOR performs better than the state-of-the-art protocol QMOR (QoS-assured Opportunistic Routing Mechanism), in terms of the packet delivery rate and end-to-end delay metrics.

Static Node Center Opportunistic Coverage and Hexagonal Deployment in Hybrid Crowd Sensing

Mobile Crowd Sensing (MCS) is widely used in large-scale complex social sensing tasks even though it cannot offer reliable sensing quality yet due to the mobility restrictions. In order to solve the inadequate sensing opportunities provided by an MCS system, we focus on building a Hybrid Crowd Sensing (HCS) network by organizing both static and uncontrolled mobile nodes. We use the static node central opportunistic coverage to measure the sensing quality of HCS by analyzing the different features of coverage in the three regions and forming definitions. Our proposed approach can enable the static nodes to be deployed in the traditional hexagonal lattice, and mobile nodes to be located by smaller hexagonal lattices. Moreover, the analysis results demonstrate that the hexagonal lattice is more economical in both the number of mobile nodes needed by the seamless coverage SSA and network connectivity with the square grid. Finally, we make further analysis of the stream successful transmission probability, and find out that there are many complex influence factors of the static node central opportunistic coverage, such as the size of the time window T, the relative position of the start location and the end location, the number of mobile nodes participates stream transmission, mobile strategy of mobile nodes, opportunistic delegation mechanism, opportunistic routing mechanism, and so on. We modelize the lower limitation of it by a discrete Markov chain, and the simulation results show both the feasibility and rationality of using the static node central opportunistic coverage as the sensing quality metric.

Timed bargaining-based opportunistic routing model for dynamic vehicular ad hoc network

Vehicular ad hoc network (VANET) is a mobile ad hoc network with a dynamic property; the vehicles possess high mobility and undergo fast topology changes. This special type of mobile ad hoc network is a popular topic of research. Owing to the specific features of VANETs, unique routing protocols are required for short-range, high-speed communication among nearby vehicles. In this study, we propose a new opportunistic routing scheme based on the timed bargaining game. In order to dynamically adapt to the current VANET situation, the proposed scheme effectively formulates the opportunistic routing mechanism as an iterative bargaining model with a timed learning approach. Based on a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes in diverse VANET environments.

HydroCast: Pressure Routing for Underwater Sensor Networks

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

Based on Energy-Efficient Opportunistic Multicast Routing for Mobile Wireless Sensor Networks

Energy-efficient is one of the main problems among all the problems in mobile wireless sensor networks, for improving the energy efficiency of the nodes in the multicast environment and complete the communication works with the minimum cost, we present a based on energy-efficient opportunistic multicast routing for mobile wireless sensor networks. In order to increase the reliability of links, we use opportunistic routing and collaboration mechanism to realize the routing method, and then use the path aggregation to reduce the energy consumption of the whole network. The results of simulation show that, the method presented in this paper is effective in reducing the consumption of links cost.

An opportunistic routing mechanism combined with long-term and short-term metrics for WMN.

WMN (wireless mesh network) is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count) does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing) and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX.

CORE: a coding-aware opportunistic routing mechanism for wireless mesh networks [Accepted from Open Call

Opportunistic routing is a new routing paradigm that takes advantage of the broadcast characteristic of a wireless channel for data delivery in a wireless mesh network. Network coding has recently emerged as a new coding paradigm that can significantly improve the throughput performance of a WMN. In this article we explore the combination of opportunistic routing and network coding for improving the performance of a WMN. We first review existing opportunistic routing and coding-aware routing protocols, respectively, classify these protocols based on different criteria, and discuss their merits and drawbacks. We then propose a coding-aware opportunistic routing mechanism that combines hop-by-hop opportunistic forwarding and localized inter-flow network coding for improving the throughput performance of a WMN. Through opportunistic forwarding, CORE allows the next-hop node with the most coding gain to continue the packet forwarding. Through localized network coding, CORE attempts to maximize the number of packets that can be carried in a single transmission. Simulation results show that CORE can significantly improve the throughput performance of a WMN as compared with existing protocols.

A Priority Based Opportunistic Routing Mechanism for Real-Time Voice Service in Mobile Ad hoc Networks

Traditional routing protocols send traffic along pre-determined paths and have been shown ineffective in coping with unreliable and unpredictable wireless medium which is caused by the multi-path fading. The most difference between the opportunistic routing and the traditional routing mechanism is that the opportunistic routing mechanism can use several lossy broadcast links to support reliable transmission. In this paper, an opportunistic routing mechanism for real-time voice service is proposed. This mechanism is based on the dynamic source routing (DSR) protocol with some modifications, the routing messages of DSR are used to construct the forwarder list, which guides the data packets forwarding process. The forwarder nodes have priorities to restrict the number of duplicated packets. Simultaneous flows can be supported well by our mechanism. Simulations show that our mechanism can effectively decrease the data packets transmission times and the amount of the control messages and reduce the end-to-end delay for real-time voice service, the quality of service can be supported well over the unstable wireless channel.

An opportunistic routing mechanism for real‐time voice service in mobile ad hoc networks

AbstractThe opportunistic routing mechanism can use several lossy broadcast links to support reliable transmission. In this paper, a simple opportunistic routing mechanism for real‐time multimedia services is proposed. This mechanism is based on the dynamic source routing protocol with some modifications, multiple route request, and route reply messages are used to construct the forwarder list, and the nodes within the forwarder list forward the packets which they overhear. The forwarder list is placed on the packet header in the form of a Bloom filter, which will restrict the size of the forwarder list to a constant value. There are no strict scheduling mechanisms for the forwarding order of the forwarder nodes, thus our opportunistic routing mechanism can be scalable for multiple simultaneous flows. Simulations show that our mechanism can effectively decrease the transmission times and the amount of the control messages for each packet and reduce the end‐to‐end delay for real‐time voice service, the quality of service for these services can be supported well over the unstable wireless channel. Copyright © 2009 John Wiley & Sons, Ltd.