Wireless Ad Research Articles

Fast Neighbor Discovery for Wireless Ad Hoc Network With Successive Interference Cancellation

Fast Neighbor Discovery for Wireless Ad Hoc Network With Successive Interference Cancellation

Spectrum Sensing and SINR Estimation in IEEE 802.11s Cognitive Radio Ad Hoc Networks with Heterogeneous Interference

Spectrum Sensing and SINR Estimation in IEEE 802.11s Cognitive Radio Ad Hoc Networks with Heterogeneous Interference

Optimal Channel Selection and Switching Using Q-Learning in Cognitive Radio Ad Hoc Networks

Optimal Channel Selection and Switching Using Q-Learning in Cognitive Radio Ad Hoc Networks

Spectrum-Aware Transitive On-Demand Routing Protocol for Military Cognitive Radio Ad Hoc Networks

The advancement of wireless technology is increasing the demand for scarce spectrum. Cognitive radio ad hoc networks (CRAHNs) were proposed as a solution to spectrum scarcity which is also deployed in combat. However, military cognitive radio ad-hoc networks (MCRAHNs) are subject to destruction and frequent link breakages. The challenge with MCRAHNs routing is the timing-out of packets. This paper proposes the spectrum-aware transitive multi-cast on-demand distance vector (SAT-MAODV), optimised for throughput and delay. The relay nodes are selected based on zonal data and mobility. This is achieved through handshaking and sharing of location data. The nodes are expected to store location data of nodes encountered, which is used in routing and in determining the movement of the node. The mobility of military nodes is organised and structured, which simplifies routing. The SAT-MAODV was evaluated in network simulator 2 and the results show that the scheme is effective. UsingSAT-MAODV instead of xWCETT reduced routing path and node relay delay by at least 65% and 13% respectively, and increased achievable throughput by 31%. It also improved the delivery ratio by 9% while reducing latency by 27% in comparison with MARSA.

Enhancing Smart Cities with IoT and Cloud Computing: A Study on Integrating Wireless Ad Hoc Networks for Efficient Communication

Smart cities have recently undergone a fundamental evolution that has greatly increased their potentials. In reality, recent advances in the Internet of Things (IoT) have created new opportunities by solving a number of critical issues that are allowing innovations for smart cities as well as the creation and computerization of cutting-edge services and applications for the many city partners. In order to further the development of smart cities toward compelling sharing and connection, this study will explore the information innovation in smart cities in light of the Internet of Things (IoT) and cloud computing (CC). IoT data is first collected in the context of smart cities. The data that is gathered is uniform. The Internet of Things, which enables gadgets to connect with one another mostly without human involvement, is made possible by AI. In line with this, The Ad Hoc Routing Function (ARF) AI computation is used for multi-rule simplification, the use of Adaptive Cloud Computing Virtual Machine Asset Allotment Technique (ACC-VMRA) is advised. To confirm its viability, the applied developments of IoT and CC in smart cities is examined and duplicated. The experiment results show that the recommended enhancement calculation is more productive than other currently used methods.

Spectrum Sensing based Trust Aware Routing for Cognitive Radio Ad hoc Networks (CRAHNs)

Spectrum Sensing based Trust Aware Routing for Cognitive Radio Ad hoc Networks (CRAHNs)

Ground Truth Validation of Sentinel-2 Data Using Mobile Wireless Ad Hoc Sensor Networks (MWSN) in Vegetation Stands

Satellite-based remote sensing (RS) data are increasingly used to map and monitor local, regional, and global environmental phenomena and processes. Although the availability of RS data has improved significantly, especially in recent years, operational applications to derive value-added information products are still limited by close-range validation and verification deficits. This is mainly due to the gap between standardized and sufficiently available close-range and RS data in type, quality, and quantity. However, to ensure the best possible linkage of close-range and RS data, it makes sense to simultaneously record close-range data in addition to the availability of environmental models. This critical gap is filled by the presented mobile wireless ad hoc sensor network (MWSN) concept, which records sufficient close-range data automatically and in a standardized way, even at local and regional levels. This paper presents a field study conducted as part of the Durable Environmental Multidisciplinary Monitoring Information Network (DEMMIN), focusing on the information gained with respect to estimating the vegetation state with the help of multispectral data by simultaneous observation of an MWSN during a Sentinel-2A (S2A) overflight. Based on a cross-calibration of the two systems, a comparable spectral characteristic of the data sets could be achieved. Building upon this, an analysis of the data regarding the influence of solar altitude, test side topography and land cover, and sub-pixel heterogeneity was accomplished. In particular, variations due to spatial heterogeneity and dynamics in the diurnal cycle show to what extent such complementary measurement systems can improve the data from RS products concerning the vegetation type and atmospheric conditions.

Hybrid Dynamic Source Routing Technique and Security Implementation in Adhoc Network Topology

Routing protocols that are developed with the error-prone environment and resource constraints of mobile nodes in mind perform better in wireless Ad Hoc environments. A good and dependable routing method is required to meet the packet transition aim. When the network is small, most existing routing algorithms operate fine, but when the network is large, there is a problem with link breakage in multipath routing algorithms, especially on demand routing algorithms. As a result, we investigated many forms of routing protocols in order to identify all of the existing algorithms' flaws. In this study, we examine existing protocols in terms of network factors such as delay, throughput, energy consumption, control overhead, and so on.

A Dynamic Addressing Hybrid Routing Mechanism Based on Static Configuration in Urban Rail Transit Ad Hoc Network

With the rapid development of urban rail transit, the traditional urban rail wireless network based on fixed infrastructure is not in a position to meet the increasingly complex communication demand. At the same time, Ad Hoc network, as a special wireless mobile network, is developing rapidly. Applying this self-organized networking architecture to the urban rail vehicle–ground communication network can overcome the problems existing in the traditional urban rail communication system. The routing protocols that can achieve low delay and highly reliable data transmission are important in the urban rail transit scenario. Therefore, combined with the wireless Ad Hoc network and the characteristics of the urban rail transit scenario, this paper proposes a dynamic addressing hybrid routing mechanism based on static configuration. Using an improved AODV routing discovery algorithm and then writing the routing table into the router in advance for static configuration not only reduces network overhead but also prolongs the network’s lifetime. It also saves the delay of routing discovery. Then, the cluster head node dynamically monitors the link status, dynamically finds the path when the link needs to be replaced, and selects different update paths according to different types of communication services. Finally, each algorithm’s network performance parameters, like the routing discovery overhead, residual link lifetime, packet delivery rate, throughput, and end-to-end delay, are analyzed and compared.

An intelligent AODV routing with energy efficient weight based clustering algorithm (EEWCA) in wireless Ad hoc network (WANET)

An intelligent AODV routing with energy efficient weight based clustering algorithm (EEWCA) in wireless Ad hoc network (WANET)

An improved AODV routing algorithm based on energy consumption for Ad Hoc networks

The Ad Hoc networks solves the problem of quickly establishing a temporary Ad Hoc network without the need for fixed facilities. However, problems such as network performance degradation, delay increase, and link interruption are endless. Aiming at the problem of shortening the survival time of Ad Hoc networks nodes, this paper proposes an improved AODV routing algorithm EC-MAODV (Energy Consumption-Modification AODV) based on energy consumption. EC-MAODV takes energy as the starting point, determines the time extension based on the residual energy of the current node, balance the power consumption of each node, and extends the networks lifetime. The effectiveness of EC-MAODV routing algorithm is proved by network simulator NS-3. The simulation results show that compared with the AODV routing protocol, the algorithm in this paper has more than 7% improvement and 19% increase in average delay and node lifetime. It can effectively prolong the life of the network, reduce the number of dead nodes, effectively solve the energy consumption problem of the wireless Ad Hoc network, and improve the overall performance of the network.

The impact of elements and advertising broadcasting intensity exposure in terrestrial radio

Advertising is appealing to most organisations since it provides information, entertains, and communicates, especially on the radio. Advertising can boost sales, but it must be carefully structured to be effective. Radio advertisers must create engaging messaging to be effective. Selective attention, Selective perception, and Selective retention are the three ways people pick mass media content. Selective attention occurs when people focus on interesting messages. Selective perception means people interpret messages according to their ability. Selective retention is when a person only remembers the message they want. Radio advertising has several qualities and tools, which can be divided into Message Style, Message Structure, and Presenter. Radio advertising messages are readily forgotten since they function on the right side of the brain and excite more impulse nets, so they must be repeated. According to current studies, improving the Radio Advertising Components (Message delivery style, Message Structure, and Message Conveyor) by 0.125 times will enhance audience attention. Under the same conditions, increasing radio ad frequency and duration by 0.0512 times decreases audience interest. Increased radio advertising intensity decreases audience interest. Nonetheless, this may happen because field surveys suggest audiences are happier or more interested in listening to high-quality radio ads by paying special attention to radio ad aspects. Radio advertisement broadcasting is intense and plays low-quality ads, which displeases audiences.

Wireless Ad Hoc Network Routing Protocols Performance Evaluation under Security Attack

Abstract: A mobile ad hoc network is made up of portable wireless nodes (MANET). The communication between these mobile nodes is not managed centralized. A self-organizing, self-configuring network known as MANET allows mobile nodes to roam around at whim. The mobile nodes can act as a router by receiving and sending packets. Due to the significance of routing in MANET, this thesis also evaluates several routing systems' efficacy. We compared the three routing protocols AODV, DSR, OLSR, and DSDV. Throughput, network load, and latency are the three metrics used to gauge how well-performing different routing systems are. The three routing techniques are well described using metrics. Information is transmitted end-to-end and hop-by-hop over the connections to the destination nodes using the proactive and reactive protocols of MANET. In multi-hop mobile ad hoc networks, energy consumption at the mobile nodes' end and its effective use are crucial factors. Nodes and other routing resources in MANETs cannot afford to run out of battery power while carrying out mission-critical operations like military or rescue missions. The effectiveness of MANET protocols such AODV, DSDV, OLSR, and DSR is studied in this study. Throughput, packet delivery ratio, and energy use are included while computing the Mobile Ad-hoc Networks' performance parameters. The circumstances that were simulated using various simulators are included in the research. The related research compared the performance of several protocols in MANETs with varying node mobility, stop length, and node density while examining the NS-2 scenario. The optimum routing system for mobile ad hoc networks will be identified after a comparison and analysis of these protocols.

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.

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.

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.

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.

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.

Energy Management in Mobile Ad Hoc Networks with Innovative Protocol TDQR CNFPQR and Bird Optimization Technique

It is impossible to stress the importance of a Dynamic Wireless Ad Hoc Network (MANET) for message path dependability and permanence. Data sharing is a vital activity in a mobile ad hoc network because packet loss occurs when nodes fail or are missing during data transfer. When a packet is lost, it can be subject to various infractions. To overcome this problem, a new algorithm was created known as TDQR CNFPQR (Trigger-Based Distributed QoS Clustered Node Failure Prediction QoS) Protocol. The MBO method analyses node state to minimize packet losses. In comparison to existing methodologies, our suggested methodology uses less energy, delivers more packets, and has a lower routing burden and higher end-to-end latency. Mobile station users can receive stationary network services offered via numerous jump links even if the network is not immediately available to them. Because wireless networks have limited route capacity, it is critical to react to user requests as rapidly as feasible. Because network nodes have limited energy resources, it is critical to spend as little energy as possible when transferring data across the network. Ad hoc wireless networks are hampered by limited battery power, making energy management a critical concern. Knowledge-based algorithm rule analyses the node's monitoring capabilities at the same time. We can then predict node failure, node longevity, and data exchange along the ideal path without packet loss using Migrating Birds Optimization (MBO).