Wireless Ad Hoc Networks Research Articles

Energy efficiency optimization routing decision scheme in three‐dimensional wireless ad hoc network

SummaryIn recent years, many realistic wireless ad hoc networks (WANETs) have taken on three‐dimensional characteristics due to the implementation of various structures such as viaducts, tunnels, and overpasses. An increasing amount of work has also been devoted to studying the challenges posed by 3D vanet scenarios. And research on routing methods for 3D vanet scenarios is a hot topic. However, the three‐dimensional scene routing decision schemes have some problems, such as low data transmission efficiency, high energy consumption, and low end‐to‐end delays. Therefore, an energy efficiency optimization routing decision system is proposed based on the establishment of a three‐dimensional Voronoi polygon topology model. First, we define a node state‐related attribute parameter that determines whether the source node and the forward node are linked. The data forwarding node is determined by comparing attribute differences. Then, a power control mechanism based on received signal strength is proposed to solve the energy consumption, which includes deterministic and random parts. Finally, the specific state of the network node is monitored by comparing the attribute decision matrix to ensure basic maintenance of network operation and improve network transmission reliability. The simulation results show that the proposed scheme not only ensures the communication performance index in WANETs but also improves the reliability of the network.

Impact of Age Violation Probability on Neighbor Election-Based Distributed Slot Access in Wireless Ad Hoc Networks

In this paper, we propose an analytical model of neighbor election-based distributed slot access by considering the relationship between the age of information (AoI) and the slot access process of nodes in wireless ad hoc networks. A node first maintains the information updates from its neighbors by relaying and receiving messages and determines message transmission slots by holding elections with its relevant competing neighbors. We first find out and analyze the interaction relationship between the transmission probability of nodes, the competing probability of neighbor nodes, and the violation probability that AoI exceeds the timeliness threshold of the neighbor election. Next, we obtain the approximated expression of the competing probability and the age violation probability based on the comprehensive analysis of the neighbor election process. Numerical and simulation results show that our approximation is tighter than the one in the literature and also provides insights into enhancing the design of network-aware distributed multiple access schemes.

Survey of Reinforcement-Learning-Based MAC Protocols for Wireless Ad Hoc Networks with a MAC Reference Model.

In this paper, we conduct a survey of the literature about reinforcement learning (RL)-based medium access control (MAC) protocols. As the scale of the wireless ad hoc network (WANET) increases, traditional MAC solutions are becoming obsolete. Dynamic topology, resource allocation, interference management, limited bandwidth and energy constraint are crucial problems needing resolution for designing modern WANET architectures. In order for future MAC protocols to overcome the current limitations in frequently changing WANETs, more intelligence need to be deployed to maintain efficient communications. After introducing some classic RL schemes, we investigate the existing state-of-the-art MAC protocols and related solutions for WANETs according to the MAC reference model and discuss how each proposed protocol works and the challenging issues on the related MAC model components. Finally, this paper discusses future research directions on how RL can be used to enable MAC protocols for high performance.

A Cross-Layer Solution for Contention Control to Enhance TCP Performance in Wireless Ad-Hoc Networks

With the development of wireless technology, users not only have wireless access to the Internet, but this has also sparked the emergence of Wireless Ad-hoc Networks (WANETs); this promising networking paradigm has the potential to adopt the shape of new emergent networks such as the Internet of Things (IoT), Vehicular Ad-hoc Networks (VANET) and Wireless Sensor Networks (WSN). However, channel contention (CC) is one of the key reasons why the TCP performs poorly in WANETs. This paper presents a mechanism called Cross-layer Solution for Contention Control (CSCC) to enhance TCP performance in WANETs. Each node starts marking packets in the proposed mechanism when its CC level reaches a certain threshold. As a result, the source node adjusts the congestion window (cwnd) size to a good state to control the insertion ratio of packets into the network. To provide a fair share to each flow, the flow having a large cwnd is penalized more. Numerous simulations have been conducted across several topologies to clarify the performance of the suggested mechanism. The simulation findings show that, in the presence of the Ad-hoc On-demand Distance Vector (AODV) routing and Dynamic Source Routing (DSR) protocols, the proposed CSCC mechanism outperformed TCP NewReno in terms of throughput and fairness. In comparison to TCP NewReno, the suggested mechanism has fewer retransmitted packets.

Performance Analysis of Wireless Adhoc Networks in Flat Fading and Frequency Selective Fading channels

This research article presents the probability of error analysis in flat fading and frequency selective fading channels for wireless adhoc networks which can aid mobile sustainable networks. Adhoc networks due to their network arrangement which is not fixed and can exhibit mobility its physical layer analysis metric of probability of error needs to be analysed. Information data transmitted from a source node into a wireless channel due to its multipath propagation can limit the performance determined by the metric of probability of error. Wireless channel experiencing flat fading can have Rayleigh distribution, Rician distribution and frequency selective fading channel can be obtained from the power delay profile (PDP). Simulation results are obtained for wireless adhoc networks in matrix laboratory (MATLAB) using binary phase shift keying (BPSK) modulation scheme in flat fading channel and frequency selective fading channels for assessing wireless adhoc networks which also can exhibit similar conditions in mobile networks. The obtained simulation results can provide significant information where 5G and 6G networks are to be deployed and can aid real time implementation.

WSN recruitments for encrypted medical image transmission securely

In both the open community and the military, wireless sensor networks (WSNs) demonstrate incredible promises for a variety of complex applications. Due to system assaults on the detection of energy and remote correspondence innovations, individual data without specific insurance is not reasonable for approval. Wireless Ad-Hoc Networks (WANET) additionally presents a number of security and risk concerns related to remote communication. This article explores issues and difficulties related to security in WANET-based remote sensor organizations. Survey-arranged security instruments for remote sensor networks are differentiated between security and risk in the article. Even though encryption and decoding calculations are moderately complex, information moves high (Mobility of Node) within the system. Second, a “review” idea is presented here to improve productivity in handling the security issue in WANET through consideration of remote sensor arrangements and confirmation of the server. Biometric data can be used to create a digest. To increase the reliability and availability of biometric frameworks, we demonstrate how this concept can be employed.

Genetic-based Fuzzy IDS for Feature Set Reduction and Worm Hole Attack Detection

The wireless ad-hoc networks are decentralized networks with a dynamic topology that allows for end-to-end communications via multi-hop routing operations with several nodes collaborating themselves, when the destination and source nodes are not in range of coverage. Because of its wireless type, it has lot of security concerns than an infrastructure networks. Wormhole attacks are one of the most serious security vulnerabilities in the network layers. It is simple to launch, even if there is no prior network experience. Signatures are the sole thing that preventive measures rely on. Intrusion detection systems (IDS) and other reactive measures detect all types of threats. The majority of IDS employ features from various network layers. One issue is calculating a huge layered features set from an ad-hoc network. This research implements genetic algorithm (GA)-based feature reduction intrusion detection approaches to minimize the quantity of wireless feature sets required to identify worm hole attacks. For attack detection, the reduced feature set was put to a fuzzy logic system (FLS). The performance of proposed model was compared with principal component analysis (PCA) and statistical parametric mapping (SPM). Network performance analysis like delay, packet dropping ratio, normalized overhead, packet delivery ratio, average energy consumption, throughput, and control overhead are evaluated and the IDS performance parameters like detection ratio, accuracy, and false alarm rate are evaluated for validation of the proposed model. The proposed model achieves 95.5% in detection ratio with 96.8% accuracy and produces very less false alarm rate (FAR) of 14% when compared with existing techniques.

Smart Sensor Networks for Industrial IoT Applications

Smart Sensor Networks (SSNs) are an indispensable part of the Industrial Internet of Things (IIoT), which seeks to improve efficiency, productivity, and safety in different industrial applications. SSNs consist of a large number of sensors, regularly deployed in a wireless ad-hoc network, which communicates with each other and with other devices, such as gateways and servers. Nevertheless, the building of SSNs in IIoT environments encounters many challenges, such as trust management, data reliability, privacy, and security. These challenges necessitate proposing novel solutions and protocols, to provide a reliable, secure, and efficient SSN. To this end, this study presents a novel DL system that can effectively discriminate between normal traffics and malicious traffic in SSNs. A convolutional feature extractor is developed to learn important discriminative features necessary for the early detection of security threats in SSNs. Then, an improved LSTM (ILSTM) is presented to model the temporal dynamics of the SSNs flows, which helps model long interdependency between traffic samples. A focal loss function is applied to deal with the imbalance between class samples. Experimental analysis is performed on an open-source SSN security dataset, named WSN-DS, the findings demonstrated the competitive advantages of our system over the prevailing solutions.

Anti-Jamming Games in Multi-Band Wireless Ad Hoc Networks

For multi-band wireless ad hoc networks of multiple users, an anti-jamming game between the users and a jammer is studied. In this game, the users (resp. jammer) want to maximize (resp. minimize) the expected rewards of the users taking into account various factors such as communication rate, hopping cost, and jamming loss. We analyze the arms race of the game and derive an optimal frequency hopping policy at each stage of the arms race based on the Markov decision process (MDP). It is analytically shown that the arms race reaches an equilibrium after a few rounds, and a frequency hopping policy and a jamming strategy at the equilibrium are characterized. We propose two kinds of collision avoidance protocols to ensure that at most one user communicates in each frequency band, and provide various numerical results that show the effects of the reward parameters and collision avoidance protocols on the optimal frequency hopping policy and the expected rewards at the equilibrium. Moreover, we discuss about equilibria for the case where the jammer adopts some unpredictable jamming strategies.

Retraction Note: Design and implement a cross layer verification framework (CLVF) for detecting and preventing blackhole and wormhole attack in wireless ad-hoc networks for cloud environment

Retraction Note: Design and implement a cross layer verification framework (CLVF) for detecting and preventing blackhole and wormhole attack in wireless ad-hoc networks for cloud environment

Performance Evaluation of Co-Channel Interference on Wireless Networks

ABSTRACT Over the past few years, a large number of mobile devices are being used in real life with the advancement of wireless technology. The explosive increase in the number of wireless mobile devices makes it impossible to avoid the co-channel interference (CCI) or adjacent channel interference (ACI) phenomenon. Therefore, this interference phenomenon has been recognized as an important problem as it causes network performance degradation. In this paper, we conducted a CCI experiment in an outdoor environment where a Wi-Fi signal is not detected and in the ns-3 simulator, and compared the CCI phenomenon with the experiment results and simulation results. As we evaluated network performance between real network and simulation, we analyzed the performance impact at each network stack how packet errors propagate to upper layers in wireless ad-hoc network and propose a theoretical maximum throughput considering error rate in the data link layer and TCP layer.

Network Condition-Aware Enhanced Distributed Channel Access for IEEE 802.11e Wireless Ad-Hoc Networks

Abstract The increasing use of multimedia applications in wireless ad-hoc networks makes the support of quality of service (QoS) an overriding necessity. In this article, we present a new extension of the IEEE 802.11e EDCA scheme called NCA-EDCA, which uses the lifetime and the number of retransmissions attempts of a packet to assess the aggressiveness of the environment in order to adjust the channel access parameters to work in the best possible way and improve service quality accordingly. This new extension aims to (1) improve the performance of real-time applications; (2) increase the overall throughput by reducing the collision rate and (3) achieve an acceptable level of fairness. The simulation results show that our extension significantly improves EDCA for better QoS support of multimedia applications. More specifically, it increases throughput of the different flows by no negligible factors and significantly reduces the collision rate while maintaining a high degree of fairness between flows of equal priority.

Twin-Node Neighbour Attack on AODV based Wireless Ad Hoc Network

As security is a very challenging issue in ad hoc networks, variety of research works related to security of ad hoc networks are being reported for last many years. In the present work, we propose a new sort of attack titled Twin-Node Neighbour Attack (TNNA), wherein two malicious nodes in close vicinity of each other exploits the provision of broadcast nature of Hello Messages in AODV routing protocol along with non-provision of any restriction regarding authentication of participating nodes. Mitigation measures are designed to lessen or perhaps remove security flaws and threats altogether. Detection and mitigation of TNNA attack are also proposed and discussed. The network's performance has been measured using four metrics viz. Packet Delivery Ratio, Throughput, Total Number of Received Packets and Average End-toEnd Delay. It is evident from simulations that the TNNA attack is significantly detrimental to the performance of WANETs using AODV routing protocol. After attack throughput of legitimate flow is found to be less than 5 % as compared to the Throughput without attack, when the data rate of malicious node is 100 Kibps. Due to stress of malicious flow of 100 Kibps, the number of transmitted (received) data packets of legitimate flow is reduced by a factor of more than 20.

Conceptual Aspects on Mobile Ad-Hoc Network System

A mobile ad hoc network is made up of mobile wireless hosts. When hosts move, the routes change, necessitating the need for a system to find new routes. A crucial aspect of the development of wireless networks is ad-hoc networking. Ad-hoc networks often consist of identical nodes that connect with one another via wireless links without the use of a centralized controller. Ad-hoc wireless networks carry over the standard issues with wireless and mobile communications, like bandwidth optimization, battery management, and improvement of transmission quality. Due to its self-upkeep and self-configuration characteristics or behavior, mobile ad hoc networks (MANET) have achieved great success and attention. Routing attacks are used to quickly alter the network topology of MANETs based on wired and wireless networks. Therefore, securing this network without infrastructure is a big problem. In recent years, experts from all over the worldhave paid particular attention to research on improving the performance of mobile ad-hoc networks (MANETs). Routing methods are especially crucial in a dynamic network environment like MANET for enhancing overall network performance. In addition to discussing the technical difficulties that protocol designers and network engineers must overcome, this paper offers insight into the possible applications of ad hoc networks. Routing, service and resource discovery, Internet access, billing, and security are some of these difficulties.

A Survey on Various MANET Protocols

In recent years, mobile technology is popular among the human society which makes the humans connected virtually to both living things [Social Media] and non living things [IOT]. MANET plays a vital role in wireless network infrastructure. Ad-hoc Wireless network consist of a two or more mobile nodes connected wirelessly in a self configured, self-healing network without having a constant framework. Each and every device in MANET was able to move freely in any directions to share the information between each devices or nodes of network. Many routing protocols for such networks have been proposed so far to find optimized routes from source to the destination and prominent among them are Dynamic Source Routing (DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV) routing protocols. The charateristics comparison of these protocols should be considered as the primary step to understand the routing protocol in a perfect manner.

An Optimized and Energy-Efficient Ad-Hoc On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI)

MANET (mobile ad-hoc network) is a wireless ad-hoc network made up of mobile devices that use peer-to-peer routing to provide network access instead of using a preexisting network infrastructure. Despite the network infrastructure’s simplicity, it faces issues such as changeable connection capacity, dynamic topology, node battery power exhaustion, and inadequate physical security. Broadcasting is a standard MANET approach for sending messages from a source node to all other nodes in the network. Flooding is a frequent method for broadcasting route request (RREQ) packets, which is susceptible to broadcast storms. The high retransmission rate is caused by the standard flooding technique, which causes media congestion and packet collisions, which can drastically reduce throughput and network performance. In a mobile ad-hoc network, efficient broadcasting focuses on selecting a compact forward node set while assuring broadcast coverage. The goal is to find a limited number of forward nodes that will provide complete coverage. In this paper, we propose an optimized and energy-efficient routing protocol for MANET (mobile ad-hoc network) based on dynamic forwarding probability in general and AODV (ad hoc on-demand distance vector) in particular, in which the route request packets are randomly controlled to increase the network lifetime and reduce packet loss in the flooding algorithm. We tested and assessed the results of our proposed solution using various network performance factors after implementing and integrating it into NS-2. According to simulation findings, our proposed technique effectively reduced route request propagation messages (RREQ). The suggested technique is more efficient, has a longer network lifetime, and uniformly utilizes node residual energy, enhancing network throughput and minimizing routing overhead when compared to regular and modified AODV protocols.

Load-Aware Distributed Resource Allocation for MF-TDMA Ad Hoc Networks: A Multi-Agent DRL Approach

Without control center assistance, it is difficult that users take traffic loads of whole Ad Hoc networks into account to utilize wireless resources collaboratively. Considering influence of load differences between users on resource allocation can be learned in advance, we construct a framework of load-aware distributed resource allocation for multiple frequencies time division multiple access (MF-TDMA) wireless Ad Hoc networks based on multi-agent deep reinforcement learning (DRL) with centralized training and distributed execution. In this framework, each user is regarded as an agent and the wireless transmission resources are partitioned into time-frequency resource blocks (RBs). Each user reserves RBs by sending network manager operational packet (NMOP) in turn at rotating broadcast stage (RBS) and how many RBs each user reserves depends on the corresponding agent's decision. The main innovative point of our work is achieving a result of wireless resource allocation that balance load degree of all users on the whole network in a distributed manner. With defining a novel network utility parameterized by traffic loads (termed timely capacity), we first model the resource allocation as an optimization problem for timely capacity sum maximization. Using the optimization objective as common reward function to train neural networks of all agents in an offline simulation environment, we obtain the distributed algorithm based on multi-agent DRL. Experimental results demonstrate that with the neural networks trained by the designed reward and enough training, users can successfully learn to collaboratively improve network utility in distributed implementation.

Artificial Intelligence Meets Autonomy in Wireless Networks: A Distributed Learning Approach

Future wireless networks entail autonomous controls of mobile devices in a variety of applications, such as internet of things and mobile edge computing. A distributed nature of wireless networks poses a fundamental challenge in decentralized management of separate devices. In particular, the coordination among devices possessing heterogeneous levels of cooperation policy and computation power emerges as a critical implementation issue for practical wireless networks. This challenge turns out to handle dynamic link topologies with node interconnections prone to arbitrary configurations and random changes. This article presents a structural learning solution called Platform for Learning Autonomy in Distributed Optimization (PLAyDO), with an objective of modeling dynamic interactions among wireless devices through a mesh of deep neural networks (NNs). This framework identifies distributed mechanisms among autonomous devices, such as decentralized computations and communication protocols, to handle arbitrary interaction topologies. The autonomous cooperation involves the design of a novel NN architecture that learns network-wide cooperation policies. To this end, device interaction mechanisms are classified according to interaction levels. NN unit groups called interaction slices are dedicated to configure heterogeneous cooperation abilities so that a multi-hop coordination of individual NN-empowered devices collectively characterizes a self-organizing management of the network. The feasibility and effectiveness of this NN-oriented formalism are investigated for decentralized power management of wireless ad-hoc networks.

Investigation of Route Request Retries of AODV Routing Protocol in a Linear Wireless Ad Hoc Network

AODV is a reactive routing protocol that sets up routes between source and destination nodes as and whenneeded. The performance of AODV protocol depends on the choice of certain parameters including route requestretries which is, by default, set as two in the corresponding RFC. In the present work, the effect of Route RequestRetries (RRR) on a set of performance metrics viz. Normalized Routing Load (NRL), Average End-to-End Delay(AEED), Packet Delivery Ratio (PDR) and Throughput has been investigated for a linear ad hoc network of fivenodes. Three different scenarios have been investigated wherein middle node is made to remain stationary, mobilewith low mobility and mobile with high mobility. Mobility of the middle node is found to be having significanteffect on the performance of such linear ad hoc networks. RRR has no influence on the performance of linear adhoc network of stationary nodes. However, RRR is having significant effect on the performance of linear ad hocnetwork if a node is made mobile. Performance of such linear ad hoc network is also affected by the choice ofduration of simulation.

An efficient packet dropping attack detection mechanism in wireless ad-hoc networks using ECC based AODV-ACO protocol

An efficient packet dropping attack detection mechanism in wireless ad-hoc networks using ECC based AODV-ACO protocol