Nodes In MANET Research Articles

Federated Learning-Assisted Coati Deep Learning-Based Model for Intrusion Detection in MANET

MANET is a set of self-arranged, wirelessly connected nodes. Each mobile ad hoc network node acts as a router to send the packet from the source node to the destination node. MANET nodes’ random movements and decentralized architecture pose security challenges, making them vulnerable to various attacks like node selfishness, network partition, black hole, and DoS due to limited hardware resources. In this paper, a novel Hybrid Intrusion DEtection for MANet (HIDE-MAN) technique has been proposed to detect intrusion like DDoS and MitM attacks in MANET. The proposed HIDE-MAN framework initiates by preprocessing malicious data packets through data cleaning and data transformation resulting in the creation of high-dimensional vectors. The intrusion detection system then makes use of the CO-BiLSTM model, which is based on the actions of Coati and BiLSTM. It categorizes outputs into DDoS attacks, MitM attacks, or the absence of any attacks. Federated learning with GAN networks allows for the aggregation of updates from multiple local models distributed across MANET. Assessment metrics such as accuracy, precision, F1 score, detection rate, recall, and security rate have been utilized to assess the efficacy of the proposed HIDE-MAN method. The comparative analysis shows that the detection rate of the proposed HIDE-MAN is greater by 18.9%, 18.07%, and 4.03% than that of the current KBIDS, WOA-DNN, and MSA-GCNN techniques, respectively.

Physical and Data Link Layer Performance Enhancement in MANET to Overcome Hidden -Exposed Node Problem and Packet Loss Due to Buffer Overflow

In order to improve the performance of the MANET , the lower layers of MANET protocol stack has to improve the performance to overcome the hidden and expose node problem in the Physical layer and better buffer management scheme to be included in the data link layer .MAC layer in MANET ,Some cases the transmission range of the node can be idle but due to Hidden and Exposed node , the node could not be send the packet to other nodes. Node has to wait unnecessarily event the transmission medium is free. In case of more traffic in the MANET can leads to overflow in the buffer which causes the packet loss in the transmission. If any packet missed on the transmission the source node has to retransmit to the destination. This research article proposed the Mutual Exclusion MAC protocol for avoiding hidden and exposed terminal problem in MANET and active buffer management algorithm named Intelligent better buffer management (IBM) algorithm which improves the MANET nodes buffers to avoid packet loss . The proposed protocol is implemented with the support of Network simulator 3 and results are compared with the existing different protocol proposed for the MAC layer with the parameter and buffer management schemes and results shown the enhanced results shown.

Finding Packet Dropper and Collecting Missing Packet due to Packet Dropping Attackers in Mobile Adhoc Network Using Divide and Conquer Algorithm

Objective: Finding the Packet dropping attacker and collecting the missing packet in the MANET is one of the challenging task since the characteristics of the MANET node mobility. Packet Transmission from the source node to the Destination node is done after sending the Route Request and Route Reply, reliable path chosen based on the protocol selection in Mobile Adhoc Network which is self-organized running without any basic infrastructure. Data which is going to send by the sender is divided in to the packet and put sequence numbering on the packet finally transmitted on the medium. Each and every packet get travelled on the assigned path to reach to the destination. If any packet missed on the transmission the source node has to retransmit to the destination. while forwarding the packet from one hop to another the packet dropper attacks are play dropping the packets. Methods: There are several methods were proposed for elaborating the packet dropping attacks and solution for finding the attackers in the MANET, but none of the methods proposed for collecting the missed packet instead of getting retransmission. Divide and conquer method between the route to destination path applied to finding the packet dropper attacker and collecting the missing packet from the previous node. Findings: The proposed method could be implement using network simulator and performance result could be better than existing packet dropper attacker work. Novelty: This proposed article shows packet dropper attackers in the MANET and collecting the missing packet by using the divide and conquer algorithm in the source to destination path route.

Hybrid Bayesian and modified grey PROMETHEE-AL model-based trust estimation technique for thwarting malicious and selfish nodes in MANETs

Hybrid Bayesian and modified grey PROMETHEE-AL model-based trust estimation technique for thwarting malicious and selfish nodes in MANETs

Power Aware MANET Routing Protocol for Efficient Packet Transmission Using T–Test and Sleep and Awake Strategy

The majority of the suggested routing protocols have not given any attention to energy consumption whatsoever, despite the fact that advances in battery design have not yet reached the point where a device can be able to operate for a longer amount of time. Energy-efficient routing is one of the crucial issues that must be taken into account in MANETs. Numerous scholars have offered highly effective solutions for this problem. Since all nodes in MANETs are connected to and run by low-power battery devices, energy-aware routing is without a doubt the highest design standard The lifespan of the network is eventually shortened when an intermediary node is shut down due to a power outage because it not only impacts the node's own system but also its capacity to relay packets on behalf of others. The untimely shutdown of a node damages the entire network system because packet forwarding on the route will become fully disconnected as soon as a node Electronics 2020, 9, 1129 5 of 64 fails due to a power outage. However, the preceding node continues to wastefully retransmit the same packets up to a specific threshold, wasting both its power and bandwidth in the process. The preceding node then informs the source that the path is severed as a result of this. Finally, route finding is once more carried out by the source node, which uses a lot of energy in the network. This work suggested a new routing method that uses the T-test procedure to discover the most effective path between nodes. This proposed technique recursively identifies the optimum way between nodes for communication, ensuring that each node participating in route discovery has enough energy for transmission. The T-Test procedure defines and supports the criteria for evaluating the nodes that are chosen and rejected during the route discovery process. This technique, in conjunction with T-Test, enables successful packet transmission in MANET packet flows with sleep and awake strategies. It is also developed using network simulation and compared to the present routing system, indicating that it performs better overall.

Novel Routing Algorithm for Efficient Packet Transmission in MANET using T –Test Procedure and Sleep and Awake Strategy

Packet transmission is one of the time-consuming communication processes in a mobile ad hoc network. Many routing pathways may encounter failed packet delivery as a result of the MANET node's power backup. The routing algorithm determines the path packets follow as they travel from the source to the destination nodes, but it provides no assurances about packet delivery. This work suggested a new routing method that uses the T-test procedure to discover the most effective path between nodes. This proposed technique recursively identifies the optimum way between nodes for communication, ensuring that each node participating in route discovery has enough energy for transmission.. The T-Test procedure defines and supports the criteria for evaluating the nodes that are chosen and rejected during the route discovery process. This technique, in conjunction with T-Test, enables successful packet transmission in MANET packet flows with sleep and awake strategies. It is also developed using network simulation and compared to the present routing system, indicating that it performs better overall.

Routing Algorithm for Efficient Packet Transmission in Manet Using T–Test Procedure

One of the laborious communication tasks in a mobile ad hoc network is packet transmission. Due to the MANET node's power backup, many routing paths may experience unsuccessful packet delivery. The routing algorithm chooses the path that packets take as they travel from the source node to the destination nodes, but it makes no guarantees regarding packet delivery. In order to determine the most effective path between nodes, this paper proposed a new routing algorithm with the use of the T-test process. This suggested technique determines the best path between nodes for communication in a recursive manner, ensuring that each node participating in the route discovery has enough energy for transmission. The criteria for evaluating the nodes that are chosen and rejected throughout the route discovery process are defined and supported by the T-Test procedure. This technique, together with T-Test, supports effective packet transmission in MANET packet flow. It is also built with the help of network simulation and compared to the current routing protocol, demonstrating that it performs better overall.

Intelligent Buffer Management Algorithm to Prevent Packet loss in Mobile Adhoc Network

In a mobile ad hoc network, which is self-organized and operates without any fundamental infrastructure, packet transmission from the source node to the destination node is completed after sending the route request and route reply. A reliable path is then selected depending on the protocol choice. Data that the sender intends to deliver is broken up into packets and given sequence numbers before being transmitted over the channel. With the aid of an internal buffer that helps to receive packets and forward them to the next destination, each and every packet travels along the allotted path until it reaches its destination. If there is more traffic on the MANET, the buffer may overflow, which will result in packet loss during transmission.. The source node must retransmit to the destination if any packets were lost during the initial transfer. This article proposes the Intelligent Buffer Management (IBM) active buffer management algorithm to prevent such a scenario by enhancing the MANET nodes' buffers to prevent packet loss. The Network Simulator is used to help build this suggested approach, and the results are compared to those of the current buffer management method to show that IBM is superior.

An Integrated Z-Number and DEMATEL-Based Cooperation Enforcement Scheme for Thwarting Malicious Nodes in MANETs

An Integrated Z-Number and DEMATEL-Based Cooperation Enforcement Scheme for Thwarting Malicious Nodes in MANETs

Reputation based Symmetric Key Authentication for Secure Data Transmission in Mobile Ad Hoc Networks

INTRODUCTION: MANETs were a group of nodes which connected each other to establish the network via wireless association to forward packets towards destinations. OBJECTIVES: Reputation-based Symmetric Key Authentication (RSKA) technique is proposed to improve the security of data communication, which securely transmits data packets within MANET communication. Initially, a reputation counts-based node authentication algorithm is designed in RSKA technique by considering the reputation value of mobile nodes in networks. METHODS: By using a reputation count-based node authentication algorithm, the RSKA technique performs the node authentication process before initiating route identification and selects cooperative nodes in MANETs for data transmission. Therefore, the RSKA of nodes results in improved security of data communication for enhancing throughput and reducing data loss rate. Besides, the RSKA technique uses symmetric key cryptography for secure data transmission in which a secret key is generated for the data to be transmitted by the corresponding mobile node along the route path of the source-destination pair. The destination node having the secret key can only decrypt the cypher text. RESULTS: Thus, the RSKA technique improves the data confidentiality rate as well as minimizes the time to protect the data transmission in an efficient way. RSKA was calculated by various parameters, namely data loss rate, throughput and time to protect data delivery as well as data confidentiality rate. CONCLUSION: The simulation result of RSKA improves the data confidentiality rate for achieving secured data transmission as well as minimizes time to protect data delivery within MANETs compared with conventional methods.

Broadcast efficiency in mobile ad hoc networks: Dynamic methods and constant approximation

The term "MANET," which stands for "Mobile Adhoc Network," refers to an ad hoc wireless network incorporating routing mechanism atop an ad hoc link layer network. These networks consist of wirelessly linked mobile nodes that selfconfigure and self-heal. Due to frequent changes in network architecture, MANET nodes have the freedom to move. Each node in the network serves as a router, forwarding traffic to specified nodes. Broadcast algorithms in wireless ad hoc networks typically follow two main approaches: static and dynamic. In the static approach, local algorithms proactively determine each node's status based on local topology information and a globally known priority function. This paper reveals that existing local broadcast algorithms based on the static approach fail to achieve a satisfactory approximation factor for the optimum solution to an NP-hard problem. However, it is demonstrated that a constant approximation factor is attainable when relative position information is available. The hybrid broadcast method dynamically determines each node's state "on-the-fly," ensuring complete delivery and maintaining a consistent value approaching the ideal outcome as closely as possible.

Dual‐channel capsule generation adversarial network based blockchain technology for a secured dynamic optimal routing in mobile ad hoc network

AbstractMobile ad hoc network (MANET) routing is allocated packets to the base station. It preserves the routing buttressing and the efficiency of MANET. None of effective approaches presented so far averting spiteful node occurrences. To overcome this issue, in this article, dual‐channel capsule generation adversarial network (DCCGAN) optimized with arithmetic optimization algorithm is proposed for blockchain based trusted distributed routing scheme in MANET (DCCGAN‐AOA‐BC‐MANET). The proposed approach offers the distributed trust module for routing nodes in MANETs that is proof‐of‐authority through blockchain. Here, the token is engendered for the packet stream admittances with the secret key transmitted to every routing mobile node, also it offers the optimum path for data transmission. The trusted distributed optimum routing information is distributed based upon proposed blockchain based MANET. The proposed approach is simulated utilizing NS‐3 tool. The performance metrics, such as delay performance, average delay, average latency, average energy consume, BC token transactions throughput. The simulation of proposed DCCGAN‐AOA‐BC‐MANET method provides 76.26%, 65.57%, 80.32%, and 42.9% lower transaction latency, 73.06%, 63.82%, 85.56%, and 38.84% lower energy consumption compared to the existing methods.

Retraction Note: Optimised with Secure Approach in Detecting and Isolation of Malicious Nodes in MANET

Retraction Note: Optimised with Secure Approach in Detecting and Isolation of Malicious Nodes in MANET

Point coordination mechanism based mobile ad hoc network investigation against jammers

In this paper, a jamming attack (a kind of Denial-of-Service attack) was investigated, which interfered with the normal operation of a Mobile Ad Hoc network, which is more vulnerable to various attacks because of its self-configuration, dynamic characteristics, therefore, jammers would affect the network QoS parameters by reducing the throughput and increasing the delay. This problem is solved in this study by enabling the Point Coordination Function, which is a media access mechanism specified by the IEEE standard in some selected MANET nodes (guard nodes) to improve the deficiency of MANET’s performance. The Riverbed modeler was utilized as a simulation tool. In this study, six jammers with two different transmission power values had been applied. In a number of different simulation scenarios with and without jammers, the estimated results showed that the jammers affected the network performance by increasing the delay to 3.0658 sec and decreasing the throughput to 120200.59 bits/sec. After enabling the PCF mechanism in a number of selected nodes, the results allowed the user to solve the problem by improving the network deficiency so that the throughput had been increased to 137478.32 bits/sec and the delay had been decreased to 0.7556 sec. It can be concluded that PCF is a good improvement for different levels of jammer transmission power such as 0.01 W and 0.001 W, and PCF also improved the network’s delay and throughput when the number of PCF enabled nodes had been increased to 10 nodes and 12 nodes, respectively. The improvement is also increased. This study can be used in practice for any ad hoc network when attacked by jammers

Efficient Mobile Ad Hoc Route Maintenance Against Social Distances Using Attacker Detection Automation

In MANET, routing plays a vital role in packet interaction and data transmission. It is always easy to manage the data transmission over the MANET because of uncentralized control on the MANET nodes. Since the efficient route on MANET controls the packets and does not simplify the route between the source and destination. Hence the maintenance of route interaction becomes a crucial process. Methods: It is critical to enhance the route and decrease the attacker to sustain successful data transfers via the MANET Network. MANET, on the other hand, permits route interaction with security threads. The four processing schema are proposed in this study work to retain the security safeguards against Routing Protocols. The Rushing Attacker has significantly influenced MANET packet-based data transfer, particularly node communication. The Attacker Detection Automation of Bee Colony Optimization (ADABCP) Method is proposed in this article. Results: Existing ESCT, ZRDM-LFPM, and ENM-LAC techniques were compared to the suggested outcome. Consequently, routing and data transfer have enhanced the proposed illustration (SIRT-ADABCP-HRLD). Compared to the recommended approach, the end-to-end latency, communication overhead, packet delivery ratio, network lifetime, and energy usage are all improved. Discussion: The performance evaluation results of SIRT–ADABCP-HRLD with existing methods in terms of low End to End Delay (ms) of 49.8361% compared to existing methods ESCT, ENM-LAC, and ZRDM-LFPM. In terms of low Communication Overhead, an 81.4462% decrease compared to existing methods. However, it improves packet delivery by 56.9775%, more than ESCT, ENM-LAC, and ZRDM-LFPM. The energy consumption decreased by 36.31% less value than the existing process.

An efficient stable node selection based on Garson's pruned recurrent neural network and MSO model for multipath routing in MANET

AbstractIn mobile ad hoc network, the routing task is considered to be more complicated issue. In order to find efficient route in MANET, the positions of each stable node in the network is identified initially. The main contribution of this paper is to identify the locations of neighboring nodes in MANET for the establishment of multi path routing in diverse mobility patterns. It also handles packet scheduling to balance the load as well as data forwarding with less communication time. The proposed work explains four phases such as stable node prediction, stability determination, route exploration, and packet dissemination. At first, the stable nodes are identified using recurrent neural network along with modified seagull optimization approach. By means of Garson's pruning based recurrent neural network accompanied with modified sea gull optimization (RMSG) algorithm, the stable neighbors are chosen. The network routing is formed by interconnecting the stable nodes from the source to the destination. When a routing link failure happens, the route recovery process will be initiated. Thus, the data packets are broadcasted in multi‐paths without any intervention. The measures namely packet delivery ratio, throughput, end‐to‐end delay, routing overhead, optimal path selection, and energy consumption are utilized to evaluate the performance of proposed approach. The experimental analysis proved that the proposed approach well performed than other compared existing approaches.

NCPR Reducing Path-Discovery Overload in Mobile Adhoc Networks (MANET’s)

In this research manuscript we propose in improved NCPR protocol with security mechanism against attack. less broadcast traffic than flood broadcast method minimizing congestion and collision with maximum data packet delivery the scheme stands in with high density network which is main performance parameter. Due to soaring mobility of nodes in MANETs there exist recurrent connection breakages which direct to recurrent path crash and route Findings. The overhead of a path discovery cannot be deserted. In a route discovery, broadcasting is an original and successful data distribution method, where a movable node blindly rebroadcasts the first established route appeal packets unless it has a route to the target, and thus it causes the broadcast tempest difficulty. In this Manuscript we propose a neighbor coverage- based probabilistic rebroadcast protocol (NCPR0 for reducing routing overhead in MANETs. In arrange to successfully exploit the neighbor coverage knowledge, we recommend a novel rebroadcast delay to resolve the rebroadcast categorize, and then we can gain the more exact supplementary coverage ratio by sensing neighbor coverage knowledge. We also classify a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can appreciably diminish the number of retransmissions so as to reduce the routing overhead and can also progress the routing performance.

Multipoint Relay Selection based on Stability of Spatial Relation in Mobile Ad hoc Networks

Increasing stability is one of the main objectives in designing routing protocols for Mobile Ad-Hoc Network (MANETS). Various research schemes have been addressed to this challenge and to support it. In fact, some papers have considered modifications to MPRs selection mechanism in OLSR. In this paper, the author proposes a new mechanism to elect stable and sustainable nodes relay between all nodes in MANETs. In this mechanism, a mobility function is used as the main selection criterion based on the calculation of the spatial relation of a node relative to its neighbor. This mechanism is applied in OLSR protocol to choose stable and supportable MPRs nodes. This mechanism significantly finds more stable MPRs and it promises QoS metrics such as lost packets and delay. Simulation results reveals a significant performance gains and it motivates further examinations to develop the mechanism in order to improve the routing protocol requirements. Performances are evaluated based on Random Waypoint model and network simulator ns3.

Mobile Ad Hoc Network Security Using Mean Field Game Theoretic Threshold-Based Scheme

Background: Mobile ad hoc networks (MANET’s) have recently attracted attention as it is independent of any pre-existing network infrastructure or centralized administration. Security in MANET’s thus becomes a major concern due to its open and dynamic architecture. Objective: We have introduced a dynamic mean field game theoretic approach to enable an individual node in MANETs to make strategic security defense decisions without centralized administration. Method: The nodes in MANET’s act as a router to forward data packets and exchange routing information. Ad-hoc On demand Distance Vector (AODV) protocol is one of the standard MANET routing protocols which can be easily attacked by the fraudulent nodes. The fraudulent nodes can be deceptive and mislead the transmission of data packets in the network by providing shorter path and highest destination sequence number. Game theory finds wide application as a statistical and mathematical tool to model such dynamic networks and provide security. Results: We have implemented mean field game theory for addressing security issue in MANET’s. Each node in this dynamic distributed network, knows the information about its own state as well as the average reflection of the whole mean field. The players can strategically make distributed security defense decisions under adverse conditions. Unlike static threshold-based scheme for security, in our study the threshold is estimated dynamically. Each node checks whether the received Route REPly (RREP) sequence number is higher than a dynamically updated threshold value. Conclusion: The comparative performance analysis of throughput (TR), packet delivery rate (PDR) and average cost (AC) has been demonstrated. Game theory has a vital role to validate and justify the intuitive strategic actions taken by each player to maximize their utility by playing optimal strategy. On the basis of the dynamic threshold calculated, the higher throughput and PDR could be achieved by eliminating the misleading paths. Simulation results corroborate that our dynamic mean field game theoretic scheme outperforms the static scheme. Discussion: A dynamic approach for mobile ad hoc networks is presented in this paper to improve the performance of the network in hostile environment. We have introduced a dynamic mean field game theoretic approach to enable an individual node in MANETs to make strategic security defense decisions without centralized administration. In this dynamic distributed network, each node in the proposed scheme only needs to know its own state information and the average reflection of the whole mean field.

Towards The Development Of A Hybrid Routing Protocol For Flooding Attacks Mitigation In MANET.

Mobile Ad-Hoc Networks are infrastructure-less wireless communication technology that interconnects mobile devices such as phones, laptops, and smart devices including providing flexibility, seamless communication and mobility to all devices forming the network. MANET suffers security lapses due to the absence of central control infrastructure to monitor and control the devices that joins the network. These security lapses in MANET discourage it and makes it vulnerable to attacks such as denial of service attacks. Amongst various attacks prevalent on MANET environment, packet flooding is a common attack and causes a devastating effect on MANET nodes which if left undetected may lead to consequent crashing of the entire network. There is need to secure data and be kept confidential. In this paper, the separation of trusted nodes from malicious nodes and to protect the data packet from attackers is to be taken as research goal. Therefore, a highly secured Hybrid Trust-based Anonymous Authenticated Routing Protocol (HTBAARP) to mitigate flooding attacks is to be developed to avoid unauthorized access and to detect malicious nodes. This will be achieved by integrating a Modified Authenticated Anonymous Routing Protocol (MAASR) to a Trusted Management Scheme (TMS). Simulation will be done using NS-2 in conjunction with MATLAB R2020a to evaluate performance. The proposed solution is expected to improve throughput, packet delivery ratio and, reduces routing delay and routing overhead in the network. Keywords: Anonymous, Flooding, Hybrid protocol, MANET, Malicious nodes, Routing