Optimized reduction approach of congestion in mobile ad hoc network based on Lagrange multiplier

Over the past decades, computer networks have experienced an outbreak and with that came severe congestion problems. Congestion is a crucial determinant in the delivery of delay-sensitive applications (voice and video) and the quality of the network. in this paper, the Lagrangian optimization rate, delay, packet loss, and congestion approach (LORDPC) are presented. A congestion avoidance routing method for device-to-device (D2D) nodes in an ad hoc network that addresses the traffic intensity problem. The method of Lagrange multipliers is utilized for active route election to dodge heavy traffic links. To demonstrate the effectiveness of our proposed method, we applied extensive simulation that presents path discovery and selection. Results show that LORDPC decreases delay and traffic intensity while maintaining a high bitrate and low packet loss rate and it outperformed the ad hoc on-demand distance vector (AODV) protocol and the Lagrangian optimization rate, delay, and packet loss, approach (LORDP)

STABLE CLUSTERING ON AODV WITH SLEEP MODE

Clustering has evolved as an imperative research domain that enhances system performance such as throughput and delay in Mobile Ad hoc Networks (MANETs) in the presence of both mobility and a large number of mobile terminals. In this thesis, we present a clustering scheme that minimizes message overhead and congestion for cluster formation and maintenance. The algorithm is devised to be dependent on Ad-hoc On Demand Distance Vector (AODV) Routing with sleep mode algorithm of MANET. The dynamic formation of clusters helps reduce data packet overhead, node complexity and power consumption. The goal of this algorithm is to decrease the number of cluster forming, maintain stable clustering structure and maximize lifespan of mobile nodes in the system. Nodes in MANET networks are basically battery operated, and thus have access to a limited amount of energy. This process proposes an Energy based Ad-Hoc on-Demand Routing algorithm that balances energy among nodes so that a minimum energy level is maintained among nodes and the lifetime of network is increased. The simulation has been performed in ns-2. The simulation shows that the number of clusters formed is in proportion with the number of nodes in MANET

Routing Optimizing Decisions in MANET: The Enhanced Hybrid Routing Protocol (EHRP) with Adaptive Routing based on Network Situation

Mobile ad hoc networks (MANETs) are wireless networks that operate without a fixed infrastructure or base station. In MANETs, each node acts as a data source and a router, establishing connections with its neighboring nodes to facilitate communication. This research has introduced the Enhanced Hybrid Routing Protocol (EHRP), which combines the OLSR, AOMDV, and AODV routing protocols while considering the network situation for improved performance. The EHRP protocol begins by broadcasting a RREP (Route Reply) packet to discover a route. The selection of routing options is based on the current network situation. To determine the distance between the source and destination nodes, the proposed EHRP initiates a RREQ (Route Request) packet. In situations where network mobility exceeds the capabilities of the AODV protocol, the EHRP protocol can utilize the OLSR routing protocol for route selection and data transmission, provided that at least 70% of the network nodes remain stable. Additionally, the EHRP protocol effectively handles network load and congestion control through the utilization of the AOMDV routing protocol. Compared to the hybrid routing protocol, the enhanced hybrid routing protocol (EHRP) demonstrates superior performance. Its incorporation of the OLSR, AOMDV, and AODV protocols, along with its adaptive routing adaptation based on network conditions, allows for efficient network management and improved overall network performance. The analysis of packet delivery ratio for EHRP and ZRP reveals that EHRP achieves a packet delivery ratio of 98.01%, while ZRP achieves a packet delivery ratio of 89.99%. These results indicate that the enhanced hybrid routing protocol (EHRP) outperforms the hybrid routing protocol (ZRP) in terms of packet delivery ratio. EHRP demonstrates a higher level of success in delivering packets to their intended destinations compared to ZRP. The analysis of normal routing load for EHRP and ZRP reveals that EHRP exhibits a normal routing load of 0.13%, while ZRP exhibits a higher normal routing load of 0.50%. Based on these results, it can be concluded that the performance of the Enhanced Hybrid Routing Protocol (EHRP) is significantly better than that of the Hybrid Routing Protocol (ZRP) when considering the normal routing load. EHRP demonstrates a lower level of routing overhead and more efficient resource utilization compared to ZRP in scenarios with normal routing load. When comparing the average end-to-end delay between the Enhanced Hybrid Routing Protocol (EHRP) and ZRP, the analysis reveals that EHRP achieves an average delay of 0.06, while ZRP exhibits a higher average delay of 0.23. These findings indicate that the Enhanced Hybrid Routing Protocol (EHRP) performs better than ZRP in terms of average end-to-end delay. EHRP exhibits lower delay, resulting in faster and more efficient transmission of data packets from source to destination compared to ZRP. After considering the overall parameter matrix, which includes factors such as normal routing load, data send and receive throughput, packet delivery ratio, and average end-to-end delay, it becomes evident that the performance of the Enhanced Hybrid Routing Protocol (EHRP) surpasses that of the current hybrid routing protocol (ZRP). Across these metrics, EHRP consistently outperforms ZRP, demonstrating superior performance and efficiency. The Enhanced Hybrid Routing Protocol (EHRP) exhibits better results in terms of normal routing load, higher throughput for data transmission and reception, improved packet delivery ratio, and lower average end-to-end delay. Overall, EHRP offers enhanced performance and effectiveness compared to the existing hybrid routing protocol (ZRP)

A New Approach for DDoS attacks to discriminate the attack level and provide security for DDoS nodes in MANET

Mobile Ad Hoc Networks (MANETs) enable versatile hosts to frame a correspondence arrange without a prefixed framework. In military applications portable specially appointed system assumes essential part since it is particularly planned network for on request necessity and in circumstances where set up of physical network isn't conceivable. Despite the fact that it gives high adaptability, it likewise conveys more difficulties for MANETs to battle against malicious assaults. In any case, the property of mobility and excess additionally motivates new plans to outline safeguard procedure. In this paper, we propose a procedure to relieve DDoS assaults in MANETs. Expect that a malicious attacker ordinarily targets particular victims. The attacker will surrender if the assault neglected to accomplish the coveted objectives after a specific length of assaulting time. In our assurance system, we exploit high excess and select a protection node. Once a DDoS attack has been identified, the suspicious movement will be diverted to the protection node. The victim will work typically, and it is sensible to expect that the attacker will stop the trivial endeavors. Through escalated recreation test utilizing NS-2, we have confirmed the viability of our approach and assessed the cost and overhead of the framework

Recommendations Based QoS Trust Aggregation and Routing in Mobile Adhoc Networks

In mobile adhoc netwotk (MANET), a node’s quality of service (QoS) trust represents how much it is reliable in quality. QoS trust of a node is computed based on its multiple quality parameters and it is an interesting and challenging area in MANETs. In this work, QoS trust is evaluated by taking into consideration quality parameters like node residual energy, bandwidth and mobility. The proposed method “Recommendations Based QoS Trust Aggregation and Routing in Mobile Adhoc Networks-QTAR” is a frame work. Where the trust is established through four phases like QoS trust computation, aggregation, propagation and routing. The Dempster Shafer Theory (DST) is used for aggregation of trust recommendations. In the network, trust information is propagated through HELLO packets. Each node stores the QoS trust information of other nodes in the form of trust matrices. We applied matrix algebra operations on trust matrices for route establishment from source to destination. The time and space complexity of proposed method is discussed theoretically. The simulation is conducted for the varying of node velocity and network size, where the proposed method shown considerable improvement over existing protocols

A Survey on Intrusion Detection System in MANET

A mobile ad hoc network is an infrastructure less network which is prone to various malicious attacks when incorporated in applications. It is a dreadful task for attaining security to the greatest degree in MANET. This is awaited to the diverse characteristics of mobile ad hoc networks which unlike from well-established infrastructure network. In order to overcome this security challenges the Intrusion detection systems have been deployed in the ad hoc network. In this paper we focus on surveying heterogeneous intrusion detection systems used in MANET for defending various attacks

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field