Enhancing Reactive Ad Hoc Routing Protocols with Trust

In wireless ad hoc networks, security and communication challenges are frequently addressed by deploying a trust mechanism. A number of approaches for evaluating trust of ad hoc network nodes have been proposed, including the one that uses neural networks. We proposed to use packet delivery ratios as input to the neural network. In this article, we present a new method, called TARA (Trust-Aware Reactive Ad Hoc routing), to incorporate node trusts into reactive ad hoc routing protocols. The novelty of the TARA method is that it does not require changes to the routing protocol itself. Instead, it influences the routing choice from outside by delaying the route request messages of untrusted nodes. The performance of the method was evaluated on the use case of sensor nodes sending data to a sink node. The experiments showed that the method improves the packet delivery ratio in the network by about 70%. Performance analysis of the TARA method provided recommendations for its application in a particular ad hoc network.

Proposed emerged and enhanced routing protocols for wireless networks

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.

Energy Efficient Routing Protocol in Sensor Networks Using Genetic Algorithm

In this paper, we examine routing protocols with the shortest path in sensor networks. In doing this, we propose a genetic algorithm (GA)-based Ad Hoc On-Demand Multipath Distance Vector routing protocol (GA-AOMDV). We utilize a fitness function that optimizes routes based on the energy consumption in their nodes. We compare this algorithm with other existing ad hoc routing protocols including LEACH-GA, GA-AODV, AODV, DSR, EPAR, EBAR_BFS. Results prove that our protocol enhances the network performance in terms of packet delivery ratio, throughput, round trip time and energy consumption. GA-AOMDV protocol achieves average gain that is 7 to 22% over other protocols. Therefore, our protocol extends the network lifetime for data communications.

SO-AODV

MANET has emerged as an eager field for supporting disaster response and prevention applications like climate and weather observation, tracking, tsunamis, wildfire and emergency rescue operations, underwater level navigation, etc. In this paper, a new ad-hoc routing protocol named SO-AODV (Secured and Optimized Ad-Hoc On-Demand Distance Vector) is proposed for secured and optimized communication in any disaster like situations. For shortest route selection a technique called pigeons swarm optimization (PiSO) is used that also leads to minimize the hop count in selected optimal route. Lightweight digital watermarking (LDW) is used that ensures the authenticity of “hello” packets. For security of event messages, cyphertext stealing technique (CST) is used with encryption qu-Vanstone elliptic curve cryptography (qV-ECC) based public key cryptography. The qV-ECC generates public key. Experiments are conducted using NS2 and performance is evaluated and compared over AODV for several metrics (i.e., packet delivery ration, throughput, end-to-end delay, security, and hop count).

OLSR in android operating system

Optimized Link State Routing protocol, an ad-hoc routing protocol, has been popular in wireless devices running on Linux operating system for quite some time. In this project we have outlined the process of preparing Android devices for ad-hoc networking, a way to overcome limitations of the OS for continuous UDP communication, ensure all devices communicate on the same wireless Wi-Fi SSID, Cell-ID, subnet and finally implement the Optimized Links State Routing (OLSR) in Android Operating System using Google Nexus 7 devices. Using the code base from ProjectSPAN, an open source project, OLSR protocol has been ported to Android Nexus 7 devices. The core application is divided into two major sections, MANET and OLSR. Mobile Ad-hoc Network portion of the code takes care of setting up the device for ad-hoc mode communication, firewall and peripheral setup while OLSR portion of the code maintains the neighbor tables, MPRs and routing. The project also describes the process by which a device is prepared to run low level custom codes in Android operating system. The OLSR implementation has been successfully tested with three nodes test bed, demonstrating the multi-hop ad-hoc networking capabilities of this wireless routing protocol. With the aid of the Android’s graphical interface the application is able to exhibit the dynamic nature of the OLSR protocol. As nodes and neighbors in the network moves around with respect to time and relative location, OLSR protocol is able to form new neighbors and elect Multipoint Relay in real time.

OLSR in android operating system

Optimized Link State Routing protocol, an ad-hoc routing protocol, has been popular in wireless devices running on Linux operating system for quite some time. In this project we have outlined the process of preparing Android devices for ad-hoc networking, a way to overcome limitations of the OS for continuous UDP communication, ensure all devices communicate on the same wireless Wi-Fi SSID, Cell-ID, subnet and finally implement the Optimized Links State Routing (OLSR) in Android Operating System using Google Nexus 7 devices. Using the code base from ProjectSPAN, an open source project, OLSR protocol has been ported to Android Nexus 7 devices. The core application is divided into two major sections, MANET and OLSR. Mobile Ad-hoc Network portion of the code takes care of setting up the device for ad-hoc mode communication, firewall and peripheral setup while OLSR portion of the code maintains the neighbor tables, MPRs and routing. The project also describes the process by which a device is prepared to run low level custom codes in Android operating system. The OLSR implementation has been successfully tested with three nodes test bed, demonstrating the multi-hop ad-hoc networking capabilities of this wireless routing protocol. With the aid of the Android’s graphical interface the application is able to exhibit the dynamic nature of the OLSR protocol. As nodes and neighbors in the network moves around with respect to time and relative location, OLSR protocol is able to form new neighbors and elect Multipoint Relay in real time.

Lifetime Maximization for 5G Mobile Networks using Secured and Finest Optimal Routing Protocol

Enhancing the network lifetime is mandate since to increase the efficiency of the network and to improve their performance. However reliable routing in wireless mobile network is the most significant problem that exists. Therefore offering mobility characteristic to each and every node’s in the networks requires a new meaning for the lifetime of network. In this research article, joint optimization mechanism called Secured and Finest Optimal Routing (SFOR) protocol is proposed. When the mobile node’s routing is indefinite or unidentified in Software Defined Network (SDN) then the three cases of routing problem is formulated for deriving secured and finest optimal routing which aims in lifetime maximization. All the three cases may be modelled as linear programming (LP) problems which can be solved as the source node routing progresses. Further for mobile node’s routing which is definite or precise, the reference energy value is set to balance the network lifetime. The proposed SFOR protocol is simulated and the performance is compared with the existing scheme. From the performance analysis it is observed that the proposed SFOR protocol enhance the network lifetime 50% and 16% as compared with Route Selection based on Connectivity, Delay, and Trust (RSCDT) and Virtual Ad hoc Routing Protocol (VARP) respectively.