An Adaptable Secure Scheme in Mobile Ad hoc Network to Protect the Communication Channel From Malicious Behaviours

Mobile ad-hoc network (MANET) is a trending field in the smart digital world; it is effectively utilized for communication sharing purposes. Besides this communication, it has numerous advances like a personal computer. However, the packet drop and low throughput ratio became serious issues. Several algorithms are implemented to increase the throughput ratio by developing multipath routing. But in some cases, the multipath routing ends in routing overhead and takes more time to transfer the data because of data load in the same path. To end this problem, this research aimed to develop a novel temporary ordered route energy migration (TOREM). Here, the migration approach balanced the data load equally and enhanced the communication channel; also, the reference node creation strategy reduced the routing overhead and packet drop ratio. Finally, the outcome of the proposed model is validated with recent existing works and earned better results by minimizing packet drop and maximizing throughput ratio.

Hybrid AODV: An Efficient Routing Protocol for Manet Using MFR and Firefly Optimization Technique

A MANET is a category of ad hoc protocol that could vary positions and track itself on the flutter. It utilizes wireless connections that are attached to several networks. They include wirelessly in a self-configured, self-healing network while not having permanent communication linked in a collection of mobile networks. The network topology of nodes typically varies in MANET, and nodes are free to stir errantly and independently as a router as they accelerate traffic to more nodes within the network. Ad hoc on-demand distance vector (AODV) was employed for node selection to attain the shortest path strategy in existing techniques. In the proposed system, the hybrid AODV (HAODV) technique incorporates the MFR (Most Forward within Radius) technique to detect the shortest path routing algorithm. The MFR method was deployed for selecting the neighbor node, while HAODV was deployed to find the shortest path. To find the shortest path based on the updating equation, the Firefly algorithm is also implemented into the Hybrid AODV. The proposed work’s performance is calculated by different network parameters like the end to end delay, average routing overhead, throughput, and packet delivery ratio. After comparing AODV and DSR algorithms, the proposed algorithm (HAODV) shows improvement in packet delivery ratio, end-to-end delay, Routing overhead, and throughput.

Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks

With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%.

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 cluster optimization framework for internet of things (IoT) based Wireless Body Area Networks

PurposeWireless Body Area Network (WBAN) technology envisions a network in which sensors continuously operate on and obtained critical physical and physiological readings. Sensors deployed in WBANs have restricted resources such as battery energy, computing power and bandwidth. We can utilize these resources efficiently. By devising a mechanism that is energy efficient with following characteristics, i.e. computational complexity is less, routing overhead is minimized, and throughput will be maximum. A lot of work has been done in this area but still WBAN faces some challenges like mobility, network lifetime, transmission range, heterogeneous environment, and limited resources. In the present years well, contemplative studies have been made through a large body to reach some holistic points pertaining to the energy consumption in WBAN. Thus we/put forward appropriate algorithm for energy efficiency which can vividly corroborate the advances in this specific domain. We have also focused on various aspects and phases of the studies like study computational complexity, routing overhead and throughput type of characteristics. There is still a room for improvement to get the desired energy optimization in WBAN. The network performance mainly relies upon the algorithm used for optimization process. In this work, we intended to develop an energy optimization algorithm for energy consumption in WBAN which is based on evolutionary algorithms for inter-BAN communications using cluster-based routing protocol.Design/methodology/approachIn this paper we propose a meta heuristics algorithm Goa to solve the optimization problem in WBAN. Grasshopper is an insect. Generally, this insect is viewed individually and creating large swarm in nature. Figure 5 shows the individual grasshoppers' primitive patterns in swarm. Figure 7 depicts the pseudo code of Goa. In Goa, experiments are done to view the behavior of grasshoppers in swarm. How they gradually move towards the stationary and mobile target. Through experimentation it is conceived that swarm gradually converge towards their target. Another interesting pattern related to convergence of grasshopper is that it slowly towards its target. This shows that grasshopper does not trapped in local optima. In starting iterations of exploration process Goa, search globally and in last iterations it searches local optima. Goa makes the exploration and exploitation process balanced while solving challenging optimization problems.FindingsEnergy efficiency is achieved in the optimization process of cluster formation process. As the use of proposed algorithm Goa creates the optimal number of clusters. Shorter cluster lifetime means more times clustering procedure is called. It increases the network computational cost and the communication overhead. Experimentation results show that proposed Goa algorithm performs well. We compare the results of Goa with existing optimization Algorithms ACO and MFO. Results are generated using MATLAB.Originality/valueA lot of work has done for the sake of energy optimization in WBAN. Many algorithms are proposed in past for energy optimization of WBAN. All of them have some strengths and weaknesses. In this paper we propose a nature inspired algorithm Goa. We use the Goa algorithm for the sake of energy optimization in WBAN.

Genetic Optimized Location Aided Routing Protocol for VANET Based on Rectangular Estimation of Position

Vehicle Ad-Hoc Network (VANET) is a dynamic decentralized network that consists of various wireless mobile vehicles with no individual user management. Several routing protocols can be used for VANETs, for example, the Location-Aided Routing (LAR) protocol that utilizes location information provided by the Global Positioning System (GPS) sensors. It can help to reduce the search space for the desired route—limiting the search space results in fewer route discovery messages. However, two essential aspects are ignored while applying the LAR protocol in the VANET-based environment. Firstly, the LAR does not exploit the fact that nodes in VANET do not have pure random movement. In other words, nodes in LAR predict the position of destination node by ignoring the fact that the pre-defined constraint on the destination node navigation is met. Secondly, the nodes in the conventional LAR (or simply stated as LAR) protocol use the location information of the destination node before selecting the route location, which is most likely to expire because of the fast movement of the nodes in the VANET environment. This study presents an estimation based on a heuristic approach that was developed to reject weak GPS location data and accept accurate ones. The proposed routing protocol stated as Rectangle-Aided LAR (RALAR) is based on a moving rectangular zone according to the node′s mobility model. Additionally, the proposed RALAR protocol was optimized by using the Genetic Algorithm (GA) by selecting the most suitable time-out variable. The results were compared with LAR and Kalman-Filter Aided-LAR (KALAR), the most commonly utilized protocols in VANET for performance metrics using Packet Delivery Ratio (PDR), average End-to-End Delay (E2E Delay), routing overhead and average energy consumption. The results showed that the proposed RALAR protocol achieved an improvement over the KALAR in terms of PDR of 4.7%, average E2E delay of 60%, routing overhead of 15.5%, and 10.7% of energy consumption. The results proved that the performance of the RALAR protocol had outperformed the KALAR and LAR protocol in terms of regular network performance measures in the VANET environment.

Secured Routing Using Neighbour Coverage with Minimum Overhead in Ad Hoc Networks

A wireless ad hoc network is a dispersed type of wireless network. The network is called as ad hoc as it does not rely on any pre existing infrastructure. Routing decisions are ready by node itself, so the determination of which node to forward data is prepared dynamically based on network connectivity. The overhead of a route discovery cannot be neglected. In this, Neighbour coverage protocol proposes for reducing routing overhead and to utilize the neighbour coverage knowledge and the probabilistic mechanism, which can radically decrease the number of retransmissions to reduce the routing overhead, and can also improve the routing performance. Due to high mobility of nodes in ad hoc networks, there exist regular link breakages, which lead to frequent path failures and route discoveries. ALERT dynamically partitions the network field into zones and arbitrarily chooses nodes in zones as intermediate relay nodes, which form a non-traceable unsigned route. In addition, it conceals the data initiator/receiver among many initiators/receivers to build up source and destination anonymity protection. Thus, ALERT offers anonymity security to sources, destinations, and routes for effective counter intersection and timing attacks and overheads are reduced.