Opportunistic Routing with Multi-Channel Cooperative Neighbour Discovery

Due to the scattered nature of the network,data transmission in a dis-tributed Mobile Ad-hoc Network(MANET)consumes more energy resources(ER)than in a centralized network,resulting in a shorter network lifespan(NL).As a result,we build an Enhanced Opportunistic Routing(EORP)protocol architecture in order to address the issues raised before.This proposed routing protocol goal is to manage the routing cost by employing power,load,and delay to manage the routing energy consumption based on theflooding of control pack-ets from the target node.According to the goal of the proposed protocol techni-que,it is possible to manage the routing cost by applying power,load,and delay.The proposed technique also manage the routing energy consumption based on theflooding of control packets from the destination node in order to reduce the routing cost.Control packet exchange between the target and all the nodes,on the other hand,is capable of having an influence on the overall efficiency of the system.The EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adja-cent nodes for each node in the routing route as part of the routing path discovery process,which occurs during control packet transmission.While control packet transmission is taking place during the routing path discovery process,the EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adjacent nodes for each node in the routing.Also included is a simulation of these protocols in order to evaluate their performance across a wide range of packet speeds using Constant Bit Rate(CBR).When the packet rate of the CBR is 20 packets per second,the results reveal that the EORP-MCCND is 0.6 s quicker than the state-of-the-art protocols,according to thefindings.Assuming that the CBR packet rate is 20 packets per second,the EORP-MCCND achieves 0.6 s of End 2 End Delay,0.05 s of Routing Overhead Delay,120 s of Network Lifetime,and 20 J of Energy Consumption efficiency,which is much better than that of the state-of-the-art protocols.

Novel Energy-Efficient Opportunistic Routing Protocol for Marine Wireless Sensor Networks Based on Compressed Sensing and Power Control

In marine wireless sensor networks(MWSNs),an appropriate routing protocol is the key to the collaborative collection and efficient transmission of massive data.However,designing an appropriate routing protocol under the condition of sparse marine node deployment,highly dynamic network topology,and limited node energy is complicated.Moreover,the absence of continuous endto-end connection introduces further difficulties in the design of routing protocols.In this case,we present a novel energy-efficient opportunistic routing(Novel Energy-Efficient Opportunistic Routing,NEOR)protocol for MWSNs that is based on compressed sensing and power control.First,a lightweight time-series prediction method-weighted moving average method is proposed to predict the packet advancement value such that the number of location information that is exchanged among a node and its neighbor nodes can be minimized.Second,an adaptive power control mechanism is presented to determine the optimal transmitting power and candidate nodeset on the basis of node mobility,packet advancement,communication link quality,and remaining node energy.Subsequently,a timer-based scheduling algorithm is utilized to coordinate packet forwarding to avoid packet conflict.Furthermore,we introduce the compressed sensing theory to compress perceptual data at source nodes and reconstruct the original data at sink nodes.Therefore,energy consumption in the MWSNs is greatly reduced due to the decrease in the amount of data perception and transmission.Numerical simulation experiments are carried out in a wide range of marine scenarios to verify the superiority of our approach over selected benchmark algorithms.

Efficient Clustering Routing Algorithm Based on Opportunistic Routing

Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink and the congestion situation. In the data transmission procedure, the high-efficiency CEDOR opportunistic routing algorithm is applied into the ED-HEED as the data transmission mode between cluster headers. A novel adaptive dynamic clustering mechanism is also considered into the algorithm, as well as the data redundancy and security control. Our Simulation demonstrates that the ED-HEED algorithm can reduce the energy consumption, prolong the network life and keep the security and availability of the network compared with the HEED algorithm.

Road traffic and geography topology based opportunistic routing for VANETs

The message delivery .ratio and transmission delay is affected deeply by road traffic flow in vehicular ad hoc networks （VANETs）. An opportunistic routing based on geography and road traffic flow for VANETs （ORRIS） was proposed. ORRIS leverages the knowledge of geography positions, motion vectors and road traffic flows. In order to estimate the traffic flow density, the history of encounter number of the vehicles in the opposite direction is considered in ORRIS. The forwarding decisions are made by distributed vehicles based on the geography topology and the road traffic flow. The real map based simulation results show that ORRIS has a better performance than other algorithms, especially when the road traffic is busy or the traffic flow rates have great differences between roads.

Channel Aware Opportunistic Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

Opportunistic routing （OR） involves multiple candidate forwarders to relay packets by taking advantage of the broadcast nature and multi-user diversity of the wireless medium. Compared with traditional routing （TR）, OR is more suitable for the unreliable wireless link, and can evidently improve the end to end throughput. At present, there are many achievements concerning OR in the single radio wireless network. However, the study of OR in multi-radio wireless network stays the beginning stage. To demonstrate the benefit of OR in multi-radio multi-channel network, we propose a new route metric -- multi-channel expected anypath transmission time （MEATT）, which exploits the channel diversity and resource of multiple candidate forwarders for OR. Based on the new metric, a distributed Mgorithm named Channel Aware Opportunistic Routing （CAOR） is proposed. The simulation results demonstrate that MEATT improves 1.14 and 1.53 times of the average throughput than existing expected anypath transmission time （EATT）and metric of interference and channel switching cost （MIC） respectively. The average delay of MEATT is 17% and 40% lower than those of EATT, MIC, respectively.

Graph partitioning algorithm for opportunistic routing in large-scale wireless network

Opportunistic routing takes advantage of the broadcast nature of wireless communications by forwarding data through a set of opportunistic paths instead of one ＇best＇ path in traditional routing. However, using the global scheduling opportunistic scheme like the existing opportunistic routing protocol （ExOR） would consume considerable transmission latency and energy in large-scale wireless topologies. In this article, a graph partitioning algorithm is proposed, namely, minimum cut with laplacians （MCL）, to divide the Ad-hoc network topology into subgraphs with minimized edge cuts across them. Then the existing opportunistic routing can be applied locally in each subgraph. In this way, forwarders in different subgraphs can transmit simultaneously, and each node only needs to maintain a local forwarder list instead of a global one. The simulations show that using MCL scheme in the opportunistic routing can reduce the end-to-end delay by about 49%, and increase the life time of the wireless node by about 39%.

Throughput oriented forwarders selection analysis for opportunistic routing in wireless mesh network

Opportunistic routing explicitly takes advantage of the broadcast nature of wireless communications by using a set of forwarders to opportunistically perform packet forwarding. A key issue in the design of opportunistic routing protocols is the forwarder list selection problem. This paper proposes a novel routing metric which shows the end-to-end throughput and a corresponding throughput oriented opportunistic routing forwarder-selecting algorithm throughput oriented forwarders selection （TOFS） through analyzing forwarding characteristics of forwarders. The algorithm puts forward a constraint mechanism that controls the number of forwarders by constraint of throughput for forwarders selection, achieving a better balance between number of forwarders and effective link stability by introducing the factor of transmission time. Simulation results show that the algorithm can improve the network end-to-end throughput effectively over existing methods.

LanePost:Lane-Based Optimal Routing Protocol for Delay-Tolerant Maritime Networks

Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobility of the vessels/ships and the large inter.ship distances, nodes in the maritime network are frequently disconnected, forcing data communication in the maritime mesh networks to be opportunistic and delay.tolerant. In this paper, we present Lane Post, an optimization approach for maritime delay.tolerant routing protocol. We exploit the shipping lane information to predict the rendezvous opportunities of the ships to optimize the route selection in delay.tolerant routing. In particular, we show that when the shipping lane information is available, an opportunistic routing graph(ORG) for each ship can be constructed to predict its multi.hop data routing opportunities to the other ships or to the shore. Based on the ORG, we develop an optimal route protocol(i.e., Lane Post) for each ship to minimize its delay of multi.hop packet delivery via dynamic programming. We discussed the ways of collecting shipping lane information by centralized method or distributed method.The proposed Lane Post protocol was evaluated by ONE, an open.source delay.tolerant network simulator, which shows its dramatic performance improvement in terms of delay reduction compared to the state.of.the.art opportunistic routing protocols.

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.

Context-Aware Adaptive Routing for Opportunistic Network

Opportunistic networking-forwarding messages in a disconnected mobile ad hoc network via any encountered nodes offers a new mechanism for exploiting the mobile devices that many users already carry. However, forwarding messages in such a network is trapped by many particular challenges, and some protocols have contributed to solve them partly. In this paper, we propose a Context-Aware Adaptive opportunistic Routing algorithm（CAAR）. The algorithm firstly predicts the approximate location and orientation of the destination node by using its movement key positions and historical communication records, and then calculates the best neighbor for the next hop by using location and velocity of neighbors. In the unpredictable cases, forwarding messages will be delivered to the more capable forwarding nodes or wait for another transmission while the capable node does not exist in the neighborhood. The proposed algorithm takes the movement pattern into consideration and can adapt different network topologies and movements. The experiment results show that the proposed routing algorithm outperforms the epidemic forwarding（EF） and the prophet forwarding（PF） in packet delivery ratio while ensuring low bandwidth overhead.