Two-Hop Energy Consumption Balanced Routing Algorithm for Solar Insecticidal Lamp Internet of Things

Due to the sparsity deployment of nodes, the full connection requirement, and the unpredictable electromagnetic interference on communication caused by high voltage pulse current of Solar Insecticidal Lamps Internet of Things (SIL-IoTs), a Two-Hop Energy Consumption Balanced routing algorithm (THECB) is proposed in this research work. THECB selects next-hop nodes according to 1-hop and 2-hop neighbors’ information. In addition, the greedy forwarding mechanism is expressed in the form of probability; that is, each neighbor node is given a weight between 0 and 1 according to the distance. THECB reduces the data forwarding traffic of nodes whose discharge numbers are relatively higher than those of other nodes so that the unpredictable electromagnetic interference on communication can be weakened. We compare the energy consumption, energy consumption balance, and data forwarding traffic over various discharge numbers, network densities, and transmission radius. The results indicate that THECB achieves better performance than Two-Phase Geographic Greedy Forwarding plus (TPGFPlus), which ignores the requirement of the node-disjoint path.

Advanced GPSR in Mobile Ad-hoc Networks (MANETs)

This work aims to develop the routing capability of GPSR in MANETs. A new GPSR advancement described as Adaptive GPSR (AGPSR) is proposed with enhanced greedy forwarding and efficient routing decision. AGPSR greedy forwarding model consists of three major phases; initialization, finding target neighbor, weight value computation and next hop selection. The weight value encounters a set of network metrics including node density, network size, congestion level, transmission range, node speed and movement direction. An intensive evaluation methodology was implemented in order to evaluate the performance of proposed AGPSR in MANET. Results confirm that proposed GPSR has surpassed several MANET environmental challenges and outperformed conventional GPSR in terms of PDR, E2E delay, routing overhead, and power consumption. The delay is reduced by AGPSR of up-to 10% compared to conventional GPSR. In addition, 5% increase in PDR and more than 7% decrease in routing overhead and in power consumption was achieved by AGPSR.

An Efficient Routing Protocol for Vehicular Ad-Hoc Networks

Background: VANETs (Vehicular Ad-Hoc Networks) are the subclass of MANETs, which has recently emerged. Due to its swift changing topology and high mobility nature, it is challenging to design an efficient routing protocol for routing data amongst both moving vehicles and stationary units in VANETs. In addition, the performance of existing routing protocols is not effective due to high mobility characteristics of VANETs. Methods: In this paper, we proposed link reliable routing strategy that makes use of restricted greedy forwarding by considering neighborhood vehicles density and the least, average velocity with its own neighboring vehicles for the selection of next forwarder. Result: The proposed approach take the assumption that at every junction the police patrolling car (i.e. PCR junction node), which forwards the packet to vehicle onto correct road segment only. The link reliability is ensured by the mechanism for the selection of the next forwarder. Conclusion: The objective of this paper is to increase route reliability to provide increase throughput without greatly affecting end-to-end delay. The simulation results reveal that the proposed approach Reliable GPSR(R-GPSR) outperforms existing GPSR and E-GyTAR approach.

A Novel Greedy Forwarding Mechanism Based on Density, Speed and Direction Parameters for Vanets

In the recent years, the study and developments of networks that do not depend on any pre-existing infrastructure have been very popular. Vehicular Ad Hoc Networks (VANETs) belong to the class of these networks, in which each vehicle participates in routing by transmitting data for other nodes (vehicles). Due to the characteristics of VANET (e.g. high dynamic topology, different communication environment, frequently link breakage…), the routing process still one of the most challenging aspects. Hence, many routing protocols have been suggested to overcome these challenges. Moreover, routing protocols based on the position of vehicles are the most popular and preferred class, thanks to its many advantages like the less control overhead and the scalability. However, this class suffer from some problems such as frequent link breakages caused by the high-mobility of vehicles, which cause a low PDR and throughput. In this investigation, we introduce a novel greedy forwarding strategy used to create a new routing protocol based on the position of vehicles, to reduce the link breakages and get a stable route that improves the PDR and throughput. The proposed Density and Velocity (Speed, Direction) Aware Greedy Perimeter Stateless Routing protocol (DVA-GPSR) is based on the suggested greedy forwarding technique that utilizes the density, the speed and the direction for selecting the most convenient relaying node candidate. The results of simulation prove that DVA-GPSR protocol outperforms the classical GPSR in all studied metrics like PDR, throughput, and the ratio of routing overhead by changing the quantity of vehicles in urban and highway scenarios.

VEHICLE ADHOC NETWORK FOR INTELLIGENT VEHICLE COMMUNICATION SYSTEM .

Vehicular Ad-hoc Networks (VANETs), which considers both buses and cars as vehicular nodes running in both clockwise and anti-clockwise directions. It is a hybrid protocol, uses both the greedy forwarding approach and the carry-store-and-forward approach to ensure the connectivity of the routes. Our solution to situations, when the network is sparse and when any (source or intermediate) node left its initial position, makes this protocol better in city scenarios. We only consider Vehicle to-Vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. The paradigm of cross-layer design has been introduced as an alternative to pure layered design to develop communication protocols. Cross-layer design allows information to be exchanged and shared across layer boundaries in order to enable efficient and robust protocols. There has been several research efforts that validated the importance of cross-layer design in vehicular networks.

Performance Evaluation of Depth Adjustment and Void Aware Pressure Routing (DA-VAPR) Protocol for Underwater Wireless Sensor Networks

Underwater wireless sensor network (UWSN) has gained its popularity as a powerful technology for monitoring oceans, sea and river. The sensor node drifting along with ocean current offers 4D (space and time) monitoring for real-time underwater application. However, the main challenge arises from the underwater acoustic communication that results in high propagation delay, packet loss and overhead in the network. In order to overcome these issues, a depth adjustment and void aware pressure routing protocol is proposed for UWSN. A greedy forwarding strategy is used to forward the packet. In case a node fails to forward the packet using greedy forwarding strategy, then it immediately switches to the recovery mode. In the recovery mode, the node determines the new depth using particle swarm optimization technique. The global best value gives the new depth with minimum displacement. The void node forwards the packet with minimum displacement without any packet loss and delay.

Reliable Transmission in Wireless Sensor Networks using Greedy Perimeter Stateless Routing Scales Method

The wireless networks are made up of numerous numbers of wireless stations. The communication between these wireless stations requires traveling multiple hops to exchange information. The Wireless mobile network plays important roles in various sensing applications. This research paper planned to develop real time, trivial clarification method for transmitting in a wireless mobile sensor network. The proposed method works grounded on the routers positions and destination address of the packets to transfer packets, whereas the existing greedy forwarding decisions methods use information about the neighbor routers in the network topology. If a particular packet or an information reaches a destination region, the greedy forwarding is not worth to recover packets, since it search the packets the small perimeter of the region. When the number of destination node increases the proposed methods works better to scales router state when compared to existing shortest-path and ad-hoc routing protocols. In real time there will be frequent changes in network topology the proposed method will use local topology information to discover the shortest paths quickly. The experimental results shows that the proposed greedy perimeter stateless routing scales method provide high reliability and scalability than other methods in the large scale networks