5 research outputs found

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

    Get PDF
    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)

    Performance Analysis of Routing Protocol Using Trust-Based Hybrid FCRO-AEPO Optimization Techniques

    Get PDF
    Mobile Ad hoc Networks (MANETs) offer numerous benefits and have been used in different applications. MANETs are dynamic peer-to-peer networks that use multi-hop data transfer without the need for-existing infrastructure. Due to their nature, for secure communication of mobile nodes, they need unique security requirements in MANET. In this work, a Hybrid Firefly Cyclic Rider Optimization (FCRO) algorithm is proposed for Cluster Head (CH) selection, it efficiently selects the CH and improves the network efficiency. The Ridge Regression Classification algorithm is presented in this work to sense the malicious nodes in the network and the data is transmitted using trusted Mobile nodes for the QoS enactment metric improvement. A trust-based routing protocol (TBRP) is introduced utilizing the Atom Emperor Penguin Optimization (AEPO) algorithm, it identifies the best-forwarded path to moderate the routing overhead problem in MANET. The planned method is implemented using Matlab software and the presentation metrics are packet delivers ratio, packet loss ratio (PLR), routing overhead, throughput, end-to-end delay (E2ED), transmission delay, energy consumption and network lifetime. The suggested AEPO algorithm is compared with the prevailing PSO-GA, TID-CMGR, and MFFA. The AEPO algorithm’s performance is approximately 1.5%, 3.2%, 2%, 3%, and 4% higher than the existing methods for PLR, packet delivers ratio, throughput, and E2ED and network lifetime. The sender nodes can increase their information transmission rates and reduce delays in appreciation of this evaluation. Additionally, the suggested technique has a perfect benefit in terms of demonstrating the genuine contribution of distinct nodes to trust evaluation (TE)

    QIBMRMN: Design of a Q-Learning based Iterative sleep-scheduling & hybrid Bioinspired Multipath Routing model for Multimedia Networks

    Get PDF
    Multimedia networks utilize low-power scalar nodes to modify wakeup cycles of high-performance multimedia nodes, which assists in optimizing the power-to-performance ratios. A wide variety of machine learning models are proposed by researchers to perform this task, and most of them are either highly complex, or showcase low-levels of efficiency when applied to large-scale networks. To overcome these issues, this text proposes design of a Q-learning based iterative sleep-scheduling and fuses these schedules with an efficient hybrid bioinspired multipath routing model for large-scale multimedia network sets. The proposed model initially uses an iterative Q-Learning technique that analyzes energy consumption patterns of nodes, and incrementally modifies their sleep schedules. These sleep schedules are used by scalar nodes to efficiently wakeup multimedia nodes during adhoc communication requests. These communication requests are processed by a combination of Grey Wolf Optimizer (GWO) & Genetic Algorithm (GA) models, which assist in the identification of optimal paths. These paths are estimated via combined analysis of temporal throughput & packet delivery performance, with node-to-node distance & residual energy metrics. The GWO Model uses instantaneous node & network parameters, while the GA Model analyzes temporal metrics in order to identify optimal routing paths. Both these path sets are fused together via the Q-Learning mechanism, which assists in Iterative Adhoc Path Correction (IAPC), thereby improving the energy efficiency, while reducing communication delay via multipath analysis. Due to a fusion of these models, the proposed Q-Learning based Iterative sleep-scheduling & hybrid Bioinspired Multipath Routing model for Multimedia Networks (QIBMRMN) is able to reduce communication delay by 2.6%, reduce energy consumed during these communications by 14.0%, while improving throughput by 19.6% & packet delivery performance by 8.3% when compared with standard multimedia routing techniques

    QIBMRMN: Design of a Q-Learning based Iterative sleep-scheduling & hybrid Bioinspired Multipath Routing model for Multimedia Networks

    Get PDF
    Multimedia networks utilize low-power scalar nodes to modify wakeup cycles of high-performance multimedia nodes, which assists in optimizing the power-to-performance ratios. A wide variety of machine learning models are proposed by researchers to perform this task, and most of them are either highly complex, or showcase low-levels of efficiency when applied to large-scale networks. To overcome these issues, this text proposes design of a Q-learning based iterative sleep-scheduling and fuses these schedules with an efficient hybrid bioinspired multipath routing model for large-scale multimedia network sets. The proposed model initially uses an iterative Q-Learning technique that analyzes energy consumption patterns of nodes, and incrementally modifies their sleep schedules. These sleep schedules are used by scalar nodes to efficiently wakeup multimedia nodes during adhoc communication requests. These communication requests are processed by a combination of Grey Wolf Optimizer (GWO) & Genetic Algorithm (GA) models, which assist in the identification of optimal paths. These paths are estimated via combined analysis of temporal throughput & packet delivery performance, with node-to-node distance & residual energy metrics. The GWO Model uses instantaneous node & network parameters, while the GA Model analyzes temporal metrics in order to identify optimal routing paths. Both these path sets are fused together via the Q-Learning mechanism, which assists in Iterative Adhoc Path Correction (IAPC), thereby improving the energy efficiency, while reducing communication delay via multipath analysis. Due to a fusion of these models, the proposed Q-Learning based Iterative sleep-scheduling & hybrid Bioinspired Multipath Routing model for Multimedia Networks (QIBMRMN) is able to reduce communication delay by 2.6%, reduce energy consumed during these communications by 14.0%, while improving throughput by 19.6% & packet delivery performance by 8.3% when compared with standard multimedia routing techniques

    Game theory analysis and modeling of sophisticated multi-collusion attack in MANETs

    Get PDF
    Mobile Adhoc Network (MANET) has been a core topic of research since the last decade. Currently, this form of networking paradigm is increasingly being construed as an integral part of upcoming urban applications of Internet-of-Things (IoT), consisting of massive connectivity of diverse types of nodes. There is a significant barrier to the applicability of existing routing approaches in conventional MANETs when integrated with IoT. This routing mismatch can lead to security risks for the MANET-based application tied with the IoT platform. This paper examines a pragmatic scenario as a test case wherein the mobile nodes must exchange multimedia signals for supporting real-time streaming applications. There exist two essential security requirements viz. i) securing the data packet and ii) understanding the unpredictable behavior of the attacker. The current study considers sophistication on the part of attacker nodes. They are aware of each other’s identity and thereby collude to conduct lethal attacks, which is rarely reflected in existing security modeling statistics. This research harnesses the potential modeling aspect of game theory to model the multiple-collusion attacker scenario. It contributes towards i) modeling strategies of regular/malicious nodes and ii) applying optimization principle using novel auxiliary information to formulate the optimal strategies. The model advances each regular node’s capability to carry out precise computation about the opponent player’s strategy prediction, i.e., malicious node. The simulation outcome of the proposed mathematical model in MATLAB ascertains that it outperforms the game theory’s baseline approach
    corecore