Wireless Ad Hoc Networks Research Articles

Modeling and Detection of Flooding-Based Denial of Service Attacks in Wireless Ad Hoc Networks Using Uncertain Reasoning

Wireless Ad Hoc Networks are self-organizing networks deployed without any centralized infrastructure. Flooding based Denial-of-Service (DoS) attacks were targeting the constrained resources of mobile nodes as well as the network. Route Request (RREQ) flooding attack is one of the prominent DoS attacks launched from the network layer in which the attacker sends a huge number of spoofed Route Request (RREQ) packets which not only overflows the target buffer but also creates network congestion. In this work, novel methods were suggested for defending RREQ flooding attack in Wireless Ad Hoc Network using two well-known frameworks in uncertain reasoning namely Bayesian Inference and Dempster-Shafer (D-S) evidence theory. The present work reports the modeling of RREQ traffic and developed an optimum algorithm for the detection of persistent RREQ flooding attack using Bayesian Inference. The algorithm was further refined for the detection of high rate and low rate pulsed RREQ flooding attack using D-S evidence theory. Based on the comprehensive evaluation using mathematical modeling and simulation, the proposed method successfully defended any type of flooding based DoS attack in Wireless Ad Hoc Network with lower communication and memory overhead.

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%.

Implementation of Improved TOPSIS Method for Congestion Control in WSN

In wireless sensor networks, sensor nodes are limited in memory, battery power and computational power. Wireless Sensor Networks (WSN) are a specific category of wireless adhoc networks where their performance is highly affected by application, lifetime, storage capacity, topology changes and the communication medium and bandwidth. Whenever the traffic load in the network increases, buffer at a node becomes full and it cannot handle any more data packets. This causes packet loss and retransmission which affects delivery ratio, energy and decreases network lifetime. Congestion is an important issue in wireless networks. Congestion in WSN severely affects loss rate, channel quality, the number of retransmissions, traffic flow, network lifetime, delay, energy as well as throughput. The congestion can be resolved in WSN either by reducing the data rate or by increasing the resources to form alternative paths. In this paper, an Implementation of Improved TOPSIS Method for congestion control in WSN known as Improved Hierarchical tree Alternative path protocol has been proposed which provides an improved performance over the basic HTAP protocol.

Innovative Techniques for Attack Detection in Wireless Ad-Hoc Networks

As a result of the inherent weaknesses of the wireless medium, ad hoc networks are susceptible to a broad variety of threats and assaults. As a direct consequence of this, intrusion detection, as well as security, privacy, and authentication in ad-hoc networks, have developed into a primary focus of the current study. This body of research aims to identify the dangers posed by a variety of assaults that are often seen in wireless ad-hoc networks and provide strategies to counteract those dangers. The Black hole assault, Wormhole attack, Selective Forwarding attack, Sybil attack, and Denial-of-Service attack are the specific topics covered in this proposed work. In this paper, we describe a trust-based safe routing protocol with the goal of mitigating the interference of black hole nodes while routing in mobile ad-hoc networks. The overall performance of the network is negatively impacted when there are black hole nodes in the route that routing takes. As a result, we have developed a routing protocol that reduces the likelihood that packets would be lost because of black hole nodes. This routing system has been subjected to experimental testing to guarantee that the most secure path will be selected for the delivery of packets between a source and a destination. The invasion of wormholes into wireless networks results in the segmentation of the network as well as a disorder in the routing. As a result, we provide an effective approach for locating wormholes by using ordinal multi-dimensional scaling and round-trip duration in wireless ad hoc networks with either sparse or dense topologies. Wormholes that are linked by both short-route and long-path wormhole linkages may be found using the approach that was given. To guarantee that this ad hoc network does not include any wormholes that go unnoticed, this method is subjected to experimental testing. To fight against selective forwarding attacks in wireless ad-hoc networks, we have developed three different techniques. The first method is an incentive-based algorithm that makes use of a reward-punishment system to drive cooperation among three nodes for forwarding messages in crowded ad-hoc networks. A unique adversarial model has been developed by our team, and inside it, three distinct types of nodes and the activities they participate in are specified. We have demonstrated that the proposed method that is based on incentives prevents nodes from adopting individualistic behaviour, which ensures cooperation in the process of packet forwarding. In the second algorithm, a game theoretic model is proposed that uses non-cooperative game theory to ensure that intermediate nodes in resource-constrained ad-hoc networks faithfully forward packets.

Optimal Routing based Load Balanced Congestion Control using MAODV in WANET Environment

A decentralized sort of network that can allow the nodes to communicate with them lacking any central controller is Wireless Ad hoc Networks (WANET). Network Congestions can befall on account of nodes' restricted Bandwidth (BW) together with dynamic topology. Network Congestions brings about data loss as it makes the Data Packets (DP) be dropped on the network. Therefore, in order to lessen Network Congestions, it is necessary to model Congestion Control (CC) systems aimed at the WANET. Thus, this paper offers an optimal routing centered CC scheme utilizing the Modified Ad hoc on-demand Distances Vector (MAODV) Routing Protocol (RP) aimed at the WANET. Here, primarily, the Source Node (SN) together with Destination Nodes (DN) is initialized, and after that, the MAODV discovers the multiple routing paths. Subsequently, Stochastic Gradients Descent Deep Learning Neural Network (SGD-DLNN) identifies the Congestion Status (CS) of every node in the discovered paths. In addition, the MAODV allocates the traffic over the optimum congestion-free routing path if congestion befalls. The Levy Flight Based Black Widow Optimization (LF-BWO) algorithm chooses the optimal routing paths as of congestion-free paths. Centered upon path lifetime, residual energy, link cost, together with path distance, this algorithm enhances the Data Transmission (DT) performance by means of discovering a path. The experimentation’s outcomes are rendered to exhibit the proposed RP’s effectiveness.

Research on the Difficulty of Mobile Node Deployment’s Self‐Play in Wireless Ad Hoc Networks Based on Deep Reinforcement Learning

Deep reinforcement learning is one kind of machine learning algorithms which uses the maximum cumulative reward to learn the optimal strategy. The difficulty is how to ensure the fast convergence of the model and generate a large number of sample data to promote the model optimization. Using the deep reinforcement learning framework of the AlphaZero algorithm, the deployment problem of wireless nodes in wireless ad hoc networks is equivalent to the game of Go. A deployment model of mobile nodes in wireless ad hoc networks based on the AlphaZero algorithm is designed. Because the application scenario of wireless ad hoc network does not have the characteristics of chessboard symmetry and invariability, it cannot expand the data sample set by rotating and changing the chessboard orientation. The strategy of dynamic updating learning rate and the method of selecting the latest model to generate sample data are used to solve the problem of fast model convergence.

A new routing algorithm based on 2-hop neighbourhood information scheme for total power minimisation in wireless ad hoc networks

Wireless ad hoc networks (WANETs) include mobile nodes, equipped with power limited batteries. Due to the limited use of power sources by the node mobility, minimising the total power assigned to each node is the most important issue in WANETs. Nowadays, new methods and techniques for minimising the level of power transmission are introduced. In this study, a power minimisation routing algorithm using the neighbourhood information (PMRANI) is proposed to reduce the total power transmission. The proposed algorithm uses at least one source node with the cooperation of 1-hop and 2-hop neighbourhood nodes, which reduces the total power transmission of networks. The results show that the PMRANI with 2-hop neighbourhood and 3-hop neighbourhood nodes is capable of reducing the power transmission at a rate of 4.06% and 14.87% simultaneously. Therefore, according to results expressed for the amount of each successful submission, the PMRANI can reduce network power consumption and increases the lifetime of nodes.

Network Routing Issues in Global Geographic Information System

Research background: A geographic information system (GIS) is a computer-based information system that gathers, manages, and disseminates different geographic (related to earth) information to provide intelligent analytics necessary for prompt decisions and actions. A GIS can aggregate data from several different streams and turn it into a smart dashboard for different users to enhance productivity. The use of intelligent technologies, remote sensing, and ad-hoc wireless networks has significantly improved GIS. In GIS, utilization of sensed data from different sources depends upon the use of efficient sensing equipment, smart mobile nodes, and network gateways and relays that can efficiently route traffic towards the sink or base station. GIS achieve attention in emergency response scenarios for their capability to collect, analyze, and process spatial-referred. Purpose of the article: Article is focused on studying and identifying suitable routing issues of wireless mobile nodes, which are the main transponders for smooth and errorless data transmission. Methods: We performed a simulation-based comparative study of three different routing protocols used in ad-hoc wireless networks, namely is to identify suitable routing protocols that can aid the GIS to improve its overall performance. We calculated and compared our results with different routing protocols. We were able, with the Random mobility model, to estimate the performance of various network parameters. Findings & Value added: We proposed a study in this work that includes geo-information services overall of routing protocols to support a team in stressful situations. The study shows that the AODV routing protocol performed better than the other two routing protocols (OLSR & TORA) under the given topology.

Secure dynamic source routing protocol for defending black hole attacks in mobile Ad hoc networks

<p><span>Wireless Ad Hoc Network is a dynamically organized network on emergency situations, in which a group of wireless devices send data among themselves without requiring any base stations for forwarding data. Here the nodes itself perform the functions of routing. This important characteristic of mobile ad hoc networks allows the hassle free set up of the network for communications in different crisis such as battlefield and natural disaster zones. Multi hop communication in MANET is achieved by the cooperation of nodes in forwarding data packets. This feature of MANET is largely exploited to launch a security attack called black hole attack. A light weight solution called SEC-DSR is proposed to defend the network from black hole attack and enables communication among nodes even in the presence of attackers. In this scheme, by analyzing only the control packets used for routing in the network, the compromised nodes launching the attack are identified. From the collective judgment by the participating nodes in the routing path, a secure route free of black hole nodes is selected for communication by the host. Simulation results validate and ensure the effectiveness of the proposed solution tested on an ad hoc network with compromised black hole nodes.</span></p>

Construction method of secure tunnels in wireless Ad-Hoc Networks

In Ad-Hoc networks, the transmission data of some secure nodes has the security risk of being monitored by ordinary nodes. Building some encrypted secure tunnels between secure areas is an effective way to ensure transmission security. We mainly study some efficient methods for constructing secure tunnels. First of all, two basic principles of tunnel construction are proposed concerning locations and number of tunnels. Then, four methods of minimizing tunnel construction are designed for different network objects (tunnel links, secure areas, secure nodes and secure traffic) with different network parameter requirements. Finally, the main performance indicators are the suggestions analyzed through experiments, and the suggestions for tunnel construction in different network environments are also proposed.

Machine learning models to detect the blackhole attack in wireless adhoc network

An Ad-hoc network is used to set up a wireless connection directly from one device to another computer device. This network is a decentralised network. And it does not have Wi-Fi access point or Router. But, the main drawback of Ad hoc mode is minimal security. And also, without any trouble an attacker can connect with the ad-hoc network. So an efficient intrusion detection system is needed for the digital world. So that, these intrusion detection systems can monitor the network operation and detect the attack. In current digital information world, with the help of machine learning algorithms the intrusion detection systems were built. These IDS perform well and tries to attain better accuracy and speed. In this study six machine learning modelled IDSs were designed and analysed. The IDSs were designed with and without feature selection. The K-means cluster algorithm, SVM, Decision tree and Random forest classifiers are used to build the four IDSs without implementing feature selection. And Random forest and Principal component analysis are used as the feature selection techniques to design the two IDSs with K-means cluster classifier. For each intrusion detection system 19 samples were taken into account for the analysation. From this work it is understood that, in IDSs while implementing the feature selection technique the accuracy and detection rates are improved.

CFFD-MAC: A Hybrid MAC for Collision Free Full-Duplex Communication in Wireless Ad-Hoc Networks

Infrastructure-less (sometimes known as ad-hoc) networking paradigm is very appealing and potentially shaping its future into almost all emerging networks (i.e., IoT, wireless sensor networks, vehicular ad-hoc networks, emergency, and tactical radio networks, etc.). However, when conventional networking protocols are used, such networks often perform poorly, mainly because of interference within the network and limited network throughput. Recent advancements in wireless communications have enabled full-duplex (FD) operation by suppressing self-interference, which can theoretically double the network throughput. However, conventional medium access control (MAC) protocols like carrier-sense multiple access with collision avoidance (CSMA/CA) favor half-duplex (HD) operation and fail to benefit from FD transmission opportunities. This article proposes a novel hybrid MAC protocol for full-duplex ad-hoc networks. The proposed MAC combines time division multiple access (TDMA) and IEEE 802.11 distributed coordination function (DCF) strengths in chains of time-slotted contention-based control frames and collision-free data frames. The aim is to fully utilize FD transmission opportunities to increase network throughput. The proposed protocol modifies request-to-send (RTS) and clear-to-send (CTS) frames in IEEE 802.11 DCF MAC to form FD-RTS/CTS frames. These frames are used to enable collision-free FD communications among neighbors. The proposed scheme mitigates conventional MAC issues like hidden-node problem (HNP) and exposed-node problem (ENP). It also allows concurrent FD data transmissions in a collision-free manner. The model is generic and can be applied to any ad-hoc wireless network. In this article, the design is applied to a single channel ad-hoc network with FD transceivers. We compared the proposed design with IEEE 802.11 CSMA/CA protocol with both HD and FD transceivers. The simulation results show a 30% gain in throughput, reduced latency, and fairness among participating wireless nodes.

CSMCSM

Many MANET research works are based on the popular informal definition that MANET is a wireless ad-hoc network that has neither infrastructure nor backbone and every network node is autonomous and moves depending on its mobility. Unfortunately, this definition pays no attention to the network servers that are essential in core-based, mission-critical, and military MANETs. In core-based MANETs, external intrusion detection systems (IDS) cannot detect internal Byzantine attacks; in addition, internal Byzantine fault tolerant (BFT) systems are unqualified to detect typical external wireless attack. Therefore, there is a real need to combine both internal and external mobile ad-hoc network (MANET) ID systems. Here, CSMCSM is presented as a two-level client server model for comprehensive security in MANETs that integrates internal and external attack detectors in one device. The internal component is based on a BFT consensus algorithm while the external component employs decision tree to classify the MANET attacks.

Dynamic Routing Protocol for QoS Enhancement in Wireless Mobile Ad-Hoc Networks

Dynamic Routing Protocol for QoS Enhancement in Wireless Mobile Ad-Hoc Networks

Receiver-prioritized Next Transmission in Multichannel MAC Protocol for Wireless Ad-hoc Networks

Receiver-prioritized Next Transmission in Multichannel MAC Protocol for Wireless Ad-hoc Networks

A novel security scheme using deep learning based low overhead localised flooding algorithm for wireless sensor networks

A wireless specially appointed system is a self-sorting out, self-arranging confederation of remote frameworks. Wireless ad-hoc network gadgets (WANET) will interface and leave the system non-concu...

Swarm Security Intelligent Dynamic Networking Algorithm Based on Multiple Constraints

To reduce the security risks and guide management pressure of “mountain-type” scenic areas with steep and changeable topography, this paper combines the idea of swarm security intelligence and proposes a swarm security intelligent dynamic networking algorithm based on multiple constraints to ensure the swarm safety of the tour group and relieve the management pressure of tour guide through the dynamic group and the self-discovery after leaving the group. Based on multiple constraints such as signal strength, power consumption and fault probability etc, the algorithm optimizes the network topology in real-time, which can effectively reduce the high false-positive rate o f leaving the group due to node failure. Secondly, the algorithm constructs the Spf constrained fitness function and introduces the ant colony optimization algorithm to avoid the situation that the optimal routing path falls into the local optimal solution. Finally, the algorithm converts the adjacency matrix composed of routing table and node connection signals into areachable matrix to judge whether the member has left the group and reduce the false-negative rate of group loss in the case of multi-node connection. Experimental results show that the algorithm has good stability and robustness in mobile wireless adhoc networks

Performance analysis of modified on-demand multicast routing protocol for MANET using non forwarding nodes

ODMRP (On-Demand Multicast Routing Protocol) is an admired multicast protocol in wireless ad-hoc networks. ODMRP flood a route applies for over the total network to go for a set of forwarding nodes for packet delivery. On the other hand, a on its own forwarding path is exposed to node failures, which are common due to the vibrant nature of mobile ad hoc networks. Still, a set of mischievous or malicious nodes can generate network partitions and mount Denial-of- Service (DoS) attacks. We recommend a new ODMRP-based wireless multicast protocol that offer more forwarding paths in face of link failures. A subset of the nodes that are not on forwarding path rescreen received packets to nodes in their neighbourhoods to beat perceived node failure. This rebroadcasting creates superfluous forwarding paths to skirt unsuccessful areas in the network. Each node makes this forwarding conclusion probabilistically. Our simulation results indicate the unbiased packet delivery ratio with smallest control in the clouds.

Analysis of Learning Techniques for Performance Prediction in Mobile Adhoc Networks

Current advancements in cellular technologies and computing have provided the basis for the unparalleled exponential development of mobile networking and software availability and quality combined with multiple systems or network software. Using wireless technologies and mobile ad-hoc networks, such systems and technology interact and collect information. To achieve the Quality of Service (QoS) criteria, the growing concern in wireless network performance and the availability of mobile users would support a significant rise in wireless applications. Predicting the mobility of wireless users and systems performs an important role in the effective strategic decision making of wireless network bandwidth service providers. Furthermore, related to the defect-proneness, self-organization, and mobility aspect of such networks, new architecture problems occur. This paper proposes to predict and simulate the mobility of specific nodes on a mobile ad-hoc network, gradient boosting devices defined for the system will help. The proposed model not just to outperform previous mobility prediction models using simulated and real-world mobility instances, but provides better predictive accuracy by an enormous margin. The accuracy obtained helps the suggested mobility indicator in Mobile Adhoc Networks to increase the average level of performance.

Possibilities to Support Heterogeneous Mobile Services in Vehicle Communication Networks

Research on the provision of heterogeneous services in the field of intelligent transport is of great interest in the rapidly changing infrastructure of road transport. In particular, the availability of such services has increased through the use of wireless technologies and communication tools. The current development of Information Communication Technologies (ICT) and the integration of intelligent transport platforms and service systems make it possible to significantly improve road safety and reduce the likelihood of road accidents. However, the delivery of mobile-smart services requires the development of a rather sophisticated infrastructure to support multicast services. The purpose of this scientific article is to analyze the data transmission capabilities for heterogeneous services while ensuring road safety. The paper deals with the tasks of evaluating the possibilities of integrating such mobile services into the infrastructure of motor vehicles. Measuring bandwidth by enabling multicast services on the base of Ad-hoc wireless networks becomes an important task. The demonstrated results illustrate the capabilities of wireless networks by simulating these services in a transport service generating environment. The paper demonstrates that high-quality heterogeneous services require new wireless network interaction protocols, such as a session initiation protocol (SIP), GPRS functionality, routing protocols, and channel access to provide a large number of supportive service components.