Wireless Mobile Nodes Research Articles

Bio-inspired wireless sensor networks - a protocol for an enhanced hybrid energy optimization routing

Recently, there has been a focus on the significance of swarm intelligence-inspired routing algorithms for achieving optimum solutions in biologically inspired wireless sensor networks (WSNs). These protocols depict a network of wireless mobile nodes forming an infrastructure that is agile, dynamic, and independent of a central administrative facility. Among the challenges faced by bio-inspired WSNs, mobility awareness and excessive energy consumption (EC) stand out as significant hurdles, particularly in dynamic models with intermittent connections. This project seeks to tackle these obstacles by deploying the hybrid energy efficiency (HEED) approach to distributed clustering for network system cluster formation, along with fusion routing protocol of particle swarm optimization (PSO) and PIO to select cluster-heads and optimize solutions in bio-inspired WSNs. The success of the suggested approach is assessed using a variety of criteria, such as energy usage, rate of packet delivery, EC, and routing overhead and network lifetime. The methods like ad hoc on-demand distance vector's (AODV) and ant colony optimization (ACO) methods are employed in the testing and validation. In comparison to the reactive AODV routing protocol and ACO, the suggested routing protocol (HPSOPIO) reduces energy usage and increases network lifespan.

Data aggregation and routing in Mobile Ad hoc network: Introduction to Self-Adaptive Tasmanian Devil Optimization

Mobile Ad-Hoc Network (MANETs) is referred to as the mobile wireless nodes that make up ad hoc networks. The network topology may fluctuate on a regular basis due to node mobility. Each node serves as a router, passing traffic throughout the network, and they construct the network’s infrastructure on their own. MANET routing protocols need to be able to store routing information and adjust to changes in the network topology in order to forward packets to their destinations. While mobile networks are the main application for MANET routing techniques, networks with stationary nodes and no network infrastructure can also benefit from using them. In this paper, we proposed a Self Adaptive Tasmanian Devil Optimization (SATDO) based Routing and Data Aggregation in MANET. The first step in the process is clustering, where the best cluster heads are chosen according to a number of limitations, such as energy, distance, delay, and enhanced risk factor assessment on security conditions. In this study, the SATDO algorithm is proposed for this optimal selection. Subsequent to the clustering process, routing will optimally take place via the same SATDO algorithm introduced in this work. Finally, an improved kernel least mean square-based data aggregation method is carried out to avoid data redundancy. The efficiency of the suggested routing model is contrasted with the conventional algorithms via different performance measures.

Design and Analysis of a Bandwidth Aware Adaptive Multipath N-Channel Routing Protocol for 5G Internet of Things (IoT)

Large numbers of mobile wireless nodes that can move randomly and join or leave the network at any moment make up mobile ad-hoc networks. A significant number of messages are delivered during information exchange in populated regions because of the Internet of Things' (IoT) exponential increase in connected devices. Congestion can increase transmission latency and packet loss by causing congestion. More network size, increased network traffic, and high mobility that necessitate dynamic topology make this problem worse. An adaptive Multipath Multichannel Energy Efficient (AMMEE) routing strategy is proposed in this study, in which route selection strategies depend on forecasted energy consumption per packet, available bandwidth, queue length, and channel utilization. While multichannel uses a channel-ideal assignment process to lessen network collisions, multipath offers various paths and balances network strain. The link bandwidth is split up into a few sub-channels in the multichannel mechanism. To reduce network collisions, several source nodes simultaneously access the channel bandwidth. The cooperative multipath multichannel technique offers several paths from a single source or from several sources to the destination without colliding or becoming congested. The AMMEE routing approach is the basis for path selection. A load- and bandwidth-aware routing mechanism in the proposed AMMEE chooses the path based on node energy and forecasts their lifetime, which improves network dependability. The outcome demonstrates a comparative analysis of various multichannel medium access control (MMAC) techniques, including Parallel Rendezvous Multi Channel Medium Access Protocol (PRMMAC), Quality of Service Ad hoc On Demand Multipath Distance Vector (QoS-AOMDV), Q-learning-based Multipath Routing (QMR), and Topological Change Adaptive Ad hoc On-demand Multipath Distance Vector (TA-AOMDV) and the proposed AMMEE method. The results show that the AMMEE approach outperforms alternative systems. Doi: 10.28991/ESJ-2024-08-01-018 Full Text: PDF

An adaptive congestion and energy aware multipath routing scheme for mobile ad-hoc networks through stable link prediction

Advancement in mobile ad-hoc network (MANET's) has offered solutions to wide range of real-time applications. MANET's consist of group of battery operated wireless mobile nodes that forms a dynamic topology and functions autonomously without infrastructure. Mobile nodes are limited to resource, bandwidth, energy and memory. Due to mobile nature of the nodes, mobility and resource limitations are the two major factors that affect MANET's performance. Frequent topology changes and mobility affects the link stability between two nodes, frequent link interruption results in network congestion, lead to packet drop and increase retransmission delays. During multihop data transmissions, the wireless channel is shared among neighbour nodes. Determining the channel status and predicting the quality of link is still a challenging issue. Existing MANET's routing scheme considers optimal hop count as a metric for data transmission and selects the shortest path. Due to nodes movement, frequent link failure occurs, resulting in packet loss and retransmission of packet, which restablished path avoids packets loss, and alternate paths can be discovered within time such that congestion is controlled and delay is minimised. Therefore, it is required to design routing scheme for MANET's that can adapt to network changes and conditions to support quality of service (QoS). In this paper, we propose an Adaptive Congestion and Energy Aware Multipath Routing Scheme (ACEAMR) to provision QoS requirements in MANET's. ACEAMR discovers stable, energy aware, and congestion free paths towards destination. The congestion level at node is determined by computing queue utilization through adaptive feedback mechanism. ACEAMR integrates stable link prediction (SLP) to estimate the link quality and channel availability for reliable data transmission. Energy aware nodes are computed using fitness function of nodes having sufficient energy to extend network lifetime. Simulation results show that proposed ACEAMR achieves 30 % of higher throughput, 25 % more in packet delivery ratio, 27 % less delay and 28 % energy efficient compared to LLECP-AOMDV, OLEADM and AOMDV schemes.

End to end delay distribution analysis and interference aware high throughput for Wireless Mesh Networks

The wireless mesh network is an innovative and efficient wireless communication approach with immense potential to transform future wireless networks. This cutting-edge wireless technology provides a wide range of wireless services for personal, local, campus, and metropolitan environments. The wireless mesh network consists of a cluster of mobile wireless nodes that can dynamically and instantaneously create random and temporary network topologies, forming a wireless ad-hoc network. Ad hoc wireless networks are particularly advantageous due to their cost-effectiveness and ease of deployment. In order to further optimize the performance of ad-hoc networks, different routing algorithms such as Ad-hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing Algorithm (DSR) and Destination Sequenced Distance Vector (DSDV) have been thoroughly researched via simulation.

Energy Management Model for Mobile Ad hoc Network using Adaptive Information Weight Bat Algorithm

Mobile Ad Hoc Newark (MANET) is a collection or group of wireless mobile nodes that connect devices to communicate with each other through a wireless channel. The high mobility and dynamic topology nature of these nodes have opened MANET to challenges such as routing, resource discovery, node cooperation, network link breakages, energy constraints, and the absence of secured boundaries. Most existing work partly solves these aforementioned drawbacks by addressing the issue of energy constraints, but with less emphasis on knowing the amount of energy that is present in mobile nodes. Hence, the aim of this research work is to develop a model for energy management for MANET using the adaptive information weight (AIW-BA) technique. The developed model was implemented in the MATLAB 9.8 (R2020a) programming environment. The performance metrics used for this work are the saved energy in the nodes and the energy saving percentage. This work was compared with the routing protocols of some of the existing techniques. The results demonstrated that the developed model (AIW-BA) saves energy more effectively and efficiently than some of the existing methods. This study was able to provide adequate energy and hence prolong the network's lifetime.

Gradual Route Modification in Mobile Wireless Multihop Network with Combination of Carrying and Forwarding

In a wireless multihop network, data messages are transmitted along a wireless multihop transmission route composed of a sequence of intermediate wireless nodes forwarding the data messages. However, it is difficult to detect a wireless multihop transmission route from a source wireless node to a destination one if a wireless nodes are not evenly distributed and there are some areas in which wireless nodes are sparsely distributed. Some methods have been proposed to solve this problem by combination of forwarding data messages between neighbor intermediate wireless nodes as in a usual wireless multihop network and carrying data messages to pass through such areas. In the conventional methods with the combination of forwarding and carrying data messages, some dedicated intermediate mobile wireless nodes serve the role of carrying. Hence, such nodes are required to consume more battery power which results in lower connectivity of the network. In addition, transmissions of data messages might be suspended for waiting the carrying intermediate wireless nodes which results in longer end-to-end transmission delay. In order to solve the problems, this paper proposes a novel carrying and forwarding method which gradually modifies a wireless multihop transmission route to evenly share the required mobility overhead among all the intermediate mobile wireless nodes and to reduce end-to-end transmission delay of data messages by making the route shorter. The proposed method ensures that no successive intermediate wireless nodes pass each other without neighboring.

A Versatile Resilience Packet Ring Protocol Model for Homogeneous Networks

Optimizing routes and paths improves network performance. Due to the encapsulation and tunneling of the packets, mobile IP-based communication contributes to packet drops or significant delays between the sender and receiver. Packet loss during handoff reduces TCP throughput as well. One solution is to use the IEEE 802.11 Medium Access Control (MAC) protocol and TCP or UDP models to increase routing protocol performance. In the linkage of homogeneous networks, it is challenging to determine route failure. In addition, the 802.11 MAC also uses a link connection. As a result, re-covering the entire route path takes a longer time. Thus, improving wired and wireless mobile node communication and handover is both challenging and critical. To overcome this challenge, we propose to use the Versatile Resilience Packet Ring protocol (VRPR)-based model. In this paper, we propose a novel VRPR-based network model that allows uninterrupted communication in both wired and wireless media. VRPR is used in the network layer to avoid buffer overflow and client mobility. Our new model also identifies the cause of the route failure, whether it is due to client mobility (handover), due to link breakage (channel degradation), or due to buffer overflow. We evaluate our network model based on three performance factors, namely, the delay, packet, and packet loss, and compared it between wired and wireless media. Our Enhanced-VRPR-based network model outperforms the current VRPR wired and wireless network models. We validate our model through OMNet++ simulations.

Performance evaluation of dynamic source routing protocol with variation in transmission power and speed

<span lang="EN-US">Mobile ad-hoc network (MANET) is a set of mobile wireless nodes (devices) which is not rely on a fixed infrastructure. In MANETs, each device is responsible for routing its data according to a specific routing protocol. The three most common MANET routing protocols are: dynamic source routing protocol (DSR), optimized link state routing protocol (OLSR), and ad-hoc on-demand distance vector (AODV). This paper proposes an efficient evaluation of DSR protocol by testing the MANETs routing protocol with variation in transmission power at different speeds. The performance analysis has been given using optimized network engineering tools (OPNET) modeler simulations and evaluated using metrics of average end to end delay and throughput. The results show that the throughput increases as the transmission power increases up to a certain value after which the throughput decreases, also the network work optimally at a certain transmission power which varied at different speed.</span>

An Improved Multi-Objective Particle Swarm Optimization Routing on MANET

A Mobile Ad hoc Network (MANET) is a group of low-power consumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization. The primary aim of MANETs is to extend flexibility into the self-directed, mobile, and wireless domain, in which a cluster of autonomous nodes forms a MANET routing system. An Intrusion Detection System (IDS) is a tool that examines a network for malicious behavior/policy violations. A network monitoring system is often used to report/gather any suspicious attacks/violations. An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks, sending out alerts whenever it detects malicious nodes. The impact of Dynamic Source Routing (DSR) in MANETs challenging blackhole attack is investigated in this research article. The Cluster Trust Adaptive Acknowledgement (CTAA) method is used to identify unauthorised and malfunctioning nodes in a MANET environment. MANET system is active and provides successful delivery of a data packet, which implements Kalman Filters (KF) to anticipate node trustworthiness. Furthermore, KF is used to eliminate synchronisation errors that arise during the sending and receiving data. In order to provide an energy-efficient solution and to minimize network traffic, route optimization in MANET by using Multi-Objective Particle Swarm Optimization (MOPSO) technique to determine the optimal number of clustered MANET along with energy dissipation in nodes. According to the research findings, the proposed CTAA-MPSO achieves a Packet Delivery Ratio (PDR) of 3.3%. In MANET, the PDR of CTAA-MPSO improves CTAA-PSO by 3.5% at 30% malware.

Performance evaluation of MANET routing protocols under DDOS attacks

Mobile ad-hoc networks (MANETs) consist of a set of communicating wireless mobile nodes or devices that could be deployed without the need for pre-established infrastructure for communication. Due to the insecure wireless communication medium and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as distributed denial of service (DDOS) attacks. DDOS attacks are used to temporarily disable network services by overloading the target system with huge traffic, such that it cannot respond to legitimate traffic.
 In this paper, we evaluate the performance of the Ad hoc on demand vector (AODV), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols in MANETs under the DDOS attacks. These routing protocols are simulated using OPNET simulator to compare their performance using specific performance metrics on the network. The experimental results show that TORA protocol performs better than the AODV, OLSR, and GRP protocols under the DDOS attack.

QoS aware routing protocol using robust spatial gabriel graph based clustering scheme for ad hoc network

SummaryMANET (mobile ad hoc network) comprises of a set of wireless mobile node connected in a self‐healing and self‐configured network devoid of any fixed infrastructure. The cognitive radio (CR) in the MANET system has been developed for addressing the spectrum congestion issue. However, the existing techniques failed to solves the complex convex problem of channel assignment. To address this issue, the proposed protocol is designed. In the proposed scheme, both primary user (PU) and secondary user (SU) are clustered initially based on the graph theory process. After that, in each cluster, formation of robust spatial Gabriel graph (RS‐GG) takes place at which the neighboring nodes are predicted by estimating the weighted end‐to‐end delay. Once the multi path decision‐making condition is satisfied, the route path is established, and the communication takes place based on QoS constraint. This can lead to the enhancement of PDR, network connectivity maintenance and network lifetime. The performance analysis of the proposed methods is carried out for PDR, control overheads, energy consumption, and End‐to‐End delay and the analysis is compared with existing protocols to prove the effectiveness of proposed design. The simulation outcomes illustrate that the suggested strategy performs well and improves the data transmission.

Multi-Agent Deep Reinforcement Learning-Based Partial Task Offloading and Resource Allocation in Edge Computing Environment

In the dense data communication environment of 5G wireless networks, with the dramatic increase in the amount of request computation tasks generated by intelligent wireless mobile nodes, its computation ability cannot meet the requirements of low latency and high reliability. Mobile edge computing (MEC) can utilize its servers with mighty computation power and closer to tackle the computation tasks offloaded by the wireless node (WN). The physical location of the MEC server is closer to WN, thereby meeting the requirements of low latency and high reliability. In this paper, we implement an MEC framework with multiple WNs and multiple MEC servers, which consider the randomness and divisibility of arrival request tasks from WN, the time-varying channel state between WN and MEC server, and different priorities of tasks. In the proposed MEC system, we present a decentralized multi-agent deep reinforcement learning-based partial task offloading and resource allocation algorithm (DeMADRL) to minimize the long-term weighted cost including delay cost and bandwidth cost. DeMADRL is a model-free scheme based on Double Deep Q-Learning (DDQN) and can obtain the optimal computation offloading and bandwidth allocation decision-making policy by training the neural networks. The comprehensive simulation results show that the proposed DeMADRL optimization scheme has a nice convergence and outperforms the other three baseline algorithms.

Joint position and clock tracking of wireless nodes under mixed LOS-NLOS conditions

We propose an algorithm for the simultaneous position and clock tracking of a wireless mobile node by a set of reference nodes. Based on a protocol similar to that of two-way ranging, our algorithm efficiently estimates the position and velocity of the mobile, and the skew and offset of its clock. We take into account that the propagation conditions between each reference node and the mobile change as the latter moves. In particular, changes between line-of-sight (LOS) and several non-line-of-sight (NLOS) scenarios are considered. We study the performance of our algorithm and compare it to other relevant proposals in the literature by means of simulations, showing that our proposed method improves localization accuracy.

Secure data communication for wireless mobile nodes in intelligent transportation systems

Intelligent Transportation Systems (ITS) is one of the demanding area of research based on fast communication services. However, these networks are suffered with some congestion, routing and security issues especially in urban areas and cause of delay and computational complexities issues and lead to late messages delivery or data congestion. The Unmanned Ariel Vehicles (UAV) or drones and Internet of Vehicles (IoV) are facilitating ITS networks by collecting the data from road nodes and forward to the Road Side Units (RSU) or to the backbone architecture for decision making. This strategy will open new threats and challenges in the form of security, user privacy and other malicious activities. The traditional security and authentication mechanisms have not been feasible due to their complex and heavy computational processing. This study presents a novel Secure Data Communication in Drone Enables Internet of Vehicle (SDCD-IoV), solution for authentication among vehicle nodes, RSU and trust authority database in ITS networks. The proposed system is based on three main phases including initialization, registration, and authentication. The proposed solution provides the authentication mechanism to fulfill the security requirements to intelligent mobile nodes and provides node anonymity where vehicle nodes and drones are protected the identity during data transmission. The second important contribution of proposed solution is unlinkability where the network prevents them from adversary. Traceability and mutual authentication are also considered where nodes check malicious action and real identity of nodes recovery and verifying the messages from other entities. The proposed solution is tested in terms of time cost, computational cost, overhead in the presence of different number of nodes and velocities. The proposed solution achieved the high performance as compared to existing solutions.

Data Security-Based Routing in MANETs Using Key Management Mechanism

A Mobile Ad Hoc Network (MANET) is an autonomous network developed using wireless mobile nodes without the support of any kind of infrastructure. In a MANET, nodes can communicate with each other freely and dynamically. However, MANETs are prone to serious security threats that are difficult to resist using the existing security approaches. Therefore, various secure routing protocols have been developed to strengthen the security of MANETs. In this paper, a secure and energy-efficient routing protocol is proposed by using group key management. Asymmetric key cryptography is used, which involves two specialized nodes, labeled the Calculator Key (CK) and the Distribution Key (DK). These two nodes are responsible for the generation, verification, and distribution of secret keys. As a result, other nodes need not perform any kind of additional computation for building the secret keys. These nodes are selected using the energy consumption and trust values of nodes. In most of the existing routing protocols, each node is responsible for the generation and distribution of its own secret keys, which results in more energy dissemination. Moreover, if any node is compromised, security breaches should occur. When nodes other than the CK and DK are compromised, the entire network’s security is not jeopardized. Extensive experiments are performed by considering the existing and the proposed protocols. Performance analyses reveal that the proposed protocol outperforms the competitive protocols.

Two-level data packet security mechanism – secure location-aided routing (SLAR)

Secure data transmission is one of the most difficult challenges of Mobile Ad hoc Networks (MANET), it is a group of wireless mobile nodes that creates a temporary network without the help of a centralized system, infrastructure, or access point. Location-Aided Routing (LAR) protocols limit the ad hoc network's search for a new route to a limited "request zone." For safe message transmission in the current Location Aided Routing protocol, the Secure Location Aided Routing algorithm (SLAR) is proposed in this paper. The LAR is a geographic routing protocol that establishes the route discovery region between the source and distance before forwarding the route request packets. SLAR is an extension of LAR where the performance of LAR is compared in the presence and absence of malicious nodes, and the security of LAR is improved by putting cryptographic features in it. SLAR has significantly improved throughput, end-to-end delay, and packet delivery ratio compared to LAR.

Energy Aware Metaheuristic Optimization with Location Aided Routing Protocol for MANET

A mobile ad hoc network (MANET) involves a group of wireless mobile nodes which create an impermanent network with no central authority and infrastructure. The nodes in the MANET are highly mobile and it results in adequate network topology, link loss, and increase the re-initialization of the route discovery process. Route planning in MANET is a multi-hop communication process due to the restricted transmission range of the nodes. Location aided routing (LAR) is one of the effective routing protocols in MANET which suffers from the issue of high energy consumption. Though few research works have focused on resolving energy consumption problem in LAR, energy efficiency still remains a major design issue. In this aspect, this study introduces an energy aware metaheuristic optimization with LAR (EAMO-LAR) protocol for MANETs. The EAMO-LAR protocol makes use of manta ray foraging optimization algorithm (MRFO) to help the searching process for the individual solution to be passed to the LAR protocol. The fitness value of the created solutions is determined next to pass the solutions to the objective function. The MRFO algorithm is incorporated into the LAR protocol in the EAMO-LAR protocol to reduce the desired energy utilization. To ensure the improved routing efficiency of the proposed EAMO-LAR protocol, a series of simulations take place. The resultant experimental values pointed out the supreme outcome of the EAMO-LAR protocol over the recently compared methods. The resultant values demonstrated that the EAMO-LAR protocol has accomplished effectual results over the other existing techniques.

GENETIC ALGORITHM FOR WIRELESS SENSOR NETWORKS

Ad hoc networks are made up of a collection of wireless mobile nodes that form a temporary network with no pre-existing infrastructure or centralized management.Routing policies are crucial in determining how traffic is forwarded across a network. Adhoc networks necessitate a routing method that is very adaptable. Finding the shortest path (SP) between source and destination in a specific period of time to meet Quality of Service standards is one of the most common issues in these networks (QoS). QoS routing is difficult in an Ad hoc network because the topology changes frequently and it takes time since many QoS criteria such as distance, cost, and energy are all variable, and the state information supplied for routing is inherently faulty. The optimum path for Adhoc networks is found using a Genetic Algorithm (GA) in this paper.GA uses natural evolution-inspired methodologies to find answers to optimization problems. Crossover and mutation operations, as well as the proper chromosome structure, are all defined.

Energy competent cluster‐based secured CH routing EC2SR protocol for mobile wireless sensor network

SummaryMobile wireless sensor network (MWSN) consists of several wireless mobile sensor nodes which animatedly broadcast information among themselves without dependence of base station. Because of its unique mobility and energetic environment, MWSNs are more vulnerable to many forms of assaults and network protection. Any unusual activity that threatens resource dependability, privacy, or accessibility is referred to as an interruption. A novel, dynamic energy efficient cluster‐based secure routing identifies these challenges while discovering exact routing and identifying malicious node in MWSN. Design is organized as a dynamic hierarchy in which data is disseminated without loss from source to destination. Clustering methods are used to rearrange the dynamic hierarchy in order to improve communication. Cluster heads are chosen depending on residual energy and topology change. Proposed protocol is used for securing data and routing tactic will broadcasting. Simulation of energy efficient cluster‐based secured routing protocol is carried out by NS2. This routing protocol provides enhanced energy efficiency, secured clustering, lifetime of network and reduces network overhead.