Movement Of Mobile Nodes Research Articles

To Reduce Channel Interference in Mobile Ad-Hoc Networks through LSTM and GRU Prediction Algorithms

The demand for the applications that mobile ad-hoc networks (MANETs) can provide is rising along with their popularity. Two important features of MANETs are communication interference and connection. In MANET environments, the movement of mobile nodes has been rising. Co-channel or adjacent interference congestion is especially common due to the increasing mobility of mobile nodes. Due to the severe degradation in MANET performance caused by these interference events, they are becoming critical difficulties. There is a lack of accuracy in MANET's capacity to predict the resources that are required and accessible to prevent disrupting traffic patterns. The flow of traffic is one of its main drawbacks. One kind of deep learning is called the "deep channel," which learns sequentially using encoders and decoders. This model predicts variability in wireless signal quality based on past signal intensity. Two Deep channel versions share a core cell structure: long short-term memory (LSTM) and gated recurrent unit (GRU). A brief description of MANETs and their applications is given in this work. This study also presents the application of machine learning and deep learning in MANETs. The study demonstrated how signal interference issues may be resolved by using neural networks.

Performance Analysis of Non-Realistic Routing Protocol using Random Waypoint Model in MANET

A mobile ad hoc network (MANET) is a collection of wireless nodes connected via wireless networks and has no set structure. MANETs feature a self-organized routing topology in which mobile nodes are free to move, making it difficult and crucial to construct a stable and reliable network. Thus, failure of the route is also regarded as a prime factor affecting the efficiency of any MANET routing protocol. The breaking of the connection between two routes or more nodes will cause the failure of the route specifically in the non-realistic routing protocol. In a network of mobile nodes, the link break is mainly based on the mobility of individual nodes. Therefore, the objective of this research is to investigate the performance of proactive DSDV and reactive AODV routing protocol using the Random Waypoint(RWP) mobility model in MANET. NS-2 network simulator is used to simulate the MANET environment and BonnMotion is to create a movement of mobile nodes that integrate with the routing protocol. The network performance metrics used are throughput, packet delivery ratio, and average end-to-end delay. In addition, three simulation scenarios have been conducted to compare AODV and DSDV routing protocols with varying numbers of nodes, a comparison of AODV and DSDV routing protocols with varying pause time, and a comparison of AODV and DSDV routing protocols with varying mobility speed. The result from the three scenarios analysed and concluded that the RWP mobility model with AODV gives a better performance of throughput with 869.69 kbps and Packet Delivery Ratio (PDR) with 83.00% meanwhile, RWP with DSDV is better for the average end-to-end delay(EED) with 212.970 bps.

Optimizing Path Selection in Dynamic Autonomous Mobile Ad Hoc Networks: A Clustering Approach for Variable Nodes

The dynamic autonomous mobile ad hoc networks (MANETs) allow nodes to move everywhere quickly and communicate without the support of a network infrastructure. The movement of mobile nodes in MANETs leads to several issues, such as changeable topology, energy limitations, path conservation, and bandwidth ineffectiveness. This would negatively impact the network’s QoS. The primary aim of the present study is to select the optimal path in MANETs using the clustering technique for variable nodes (i.e., 100–1000). The network performance characteristic and energy efficiency of the present ORSMAN protocol are simulated in the ns3 simulator. The research results demonstrate that compared to the current OPSTSA, EAAORS, EERS, and OEERS techniques, the suggested ORSMAN has a higher packet delivery ratio, the lowest latency, the lowest jitters, and superior throughput. The maximum improvement in throughput is 29.81%, and in energy efficiency, it is 9.67% compared to current techniques. Additionally, a trade‐off study between energy efficiency and QoS reveals that the performance characteristics enhance QoS while reducing energy efficiency. This reduction may be attributed to variations in throughput, jitter, and latency. The total QoS performance was improved by 22.16% for the present study compared to the current techniques.

LFPR: A Lazy Fast Predictive Repair Strategy for Mobile Distributed Erasure Coded Cluster

Mobile distributed erasure coded Internet of Things (IoT) clusters store popular data, reducing communication latency, and ensuring data reliability while requiring low storage overhead. However, it suffers a high repair overhead to ensure data reliability and availability due to mobile device failures or leaving the cluster. Predictive repair is an effective strategy for reducing repair overhead that has gained attention with the development in accurate failure and mobile node movement trajectory prediction technologies in recent years. We propose LFPR, a hybrid lazy fast predictive repair strategy that combines two baseline predictive repair approaches (reconstruction and migration), including LFPRH and LFPRC for a hot and cold data distributed cluster, respectively. LFPRC and LFPRH adopt different mechanisms to determine whether a block should perform predictive repair immediately. The predictive repair mechanisms of LFPR couples migration and reconstruction in parallel to reduce average repair time per block. LFPR significantly reduces average repair time per block via large-scale simulation and local cluster experiments, compared with existing predictive repair solutions, such as FastPR and the two baselines.

Ad Hoc Communication Topology Construction for Delay-Sensitive Internet of Vehicle Applications

Advances in new technologies are changing the Internet of Things (IoTs) from vehicular ad hoc networks (VANETs) to Internet of Vehicles (IoVs). This IoV needs to construct a network topology in order to efficiently send and receive data to Cloud or Fog nodes. In such a topology construction, there are various methods of configuring a topology considering network interference and configuring a topology for energy saving, such as a mobile sensor network. However, there has been no research on the topology construction considering the rapidly high movement of mobile node, characteristic of IoV. In this article, we proposed the k-Lifetime Tree Topology Construction (k-LTTC) algorithm during emergency situations for IoV with highly dynamic characteristics. By applying the time domain to the topology construction, it is guaranteed to maintain the topology for a specific period of time (k-Life Time). The first algorithm is a centralized algorithm to construct k-lifetime tree topology, and the second algorithm is a decentralized algorithm to construct k-lifetime tree topology. We describe the time complexity and message complexity for the mathematical analysis of our proposed algorithms. Furthermore, we provided the simulation results to verify our proposed method.

A Distributed Localization Method for Wireless Sensor Networks Based on Anchor Node Optimal Selection and Particle Filter.

In wireless sensor networks, due to the significance of the location information of mobile nodes for many applications, location services are the basis of many application scenarios. However, node state and communication uncertainty affect the distance estimation and position calculation of the range-based localization method, which makes it difficult to guarantee the localization accuracy and the system robustness of the distributed localization system. In this paper, we propose a distributed localization method based on anchor nodes selection and particle filter optimization. In this method, we first analyze the uncertainty of error propagation to the least-squares localization method. According to the proportional relation between localization error and uncertainty propagation, anchor nodes are selected optimally in real-time during the movement of mobile nodes. Then we use the ranging and position of the optimally selected anchor nodes to obtain the location information of the mobile nodes. Finally, the particle filter (PF) algorithm is utilized to gain the optimal estimation of the localization results. The experimental evaluation results verified that the proposed method effectively improves the localization accuracy and the robustness of the distributed system.

Fuzzy COmplex PRoportional ASsessment of alternatives‐based Node Cooperation Enforcing Trust Estimation Scheme for enhancing Quality of Service during reliable data dissemination in Mobile Ad hoc Networks

SummaryTrust is considered as the most significant factor that helps in enforcing cooperation among the autonomous nodes of Mobile Ad hoc Network (MANETs). The computation of trust is essential for assessing the level of cooperation rendered by each individual mobile toward the activity of data routing. The calculation of trust in a self‐configuring and infrastructure‐less network is a challenge due to the dynamic movement of mobile nodes. Moreover, the trust of intermediate nodes in the routing path needs to be estimated for preventing the deterioration of network performance. In this paper, a Fuzzy COPRAS‐based Node Cooperation Enforcing Trust Estimation (FCOPRAS‐NCETE) Scheme was proposed for maintaining superior Quality of Service (QoS) in the event of reliable data dissemination. This proposed FCOPRAS‐NCETE Scheme was proposed for comprehensive ranking of mobile nodes acting as intermediate nodes between the source and destination nodes. It incorporated the benefits of fuzzy set theory and COmplex PRoportional ASsessment of alternatives (COPRAS) to determine the trust of intermediate nodes for isolating them from the routing path in the uncertain routing process with the objective to maintain superior QoS in the network. The simulation experiments of the proposed FCOPRAS‐NCETE Scheme conducted using ns‐2 confirmed its predominance in improving the throughput, packet dissemination rate, packet loss rate, energy consumptions and total overhead with different number of mobile nodes, CBR traffic rate and pairs of source and destination nodes in the network.

UAV Aided Data Collection for Wildlife Monitoring using Cache-enabled Mobile Ad-hoc Wireless Sensor Nodes

Unmanned aerial vehicle (UAV) assisted data collection is not a new concept and has been used in various mobile ad hoc networks. In this paper, we propose a caching assisted scheme alternative to routing in MANETs for the purpose of wildlife monitoring. Rather than deploying a routing protocol, data is collected and transported to and from a base station using a UAV. Although some literature exists on such an approach, we propose the use of intermediate caching between the mobile nodes and compare it to a baseline scenario where no caching is used. The paper puts forward our communication design where we have simulated the movement of multiple mobile sensor nodes in a field that move according to the Levy walk model imitating wildlife animal foraging and a UAV that makes regular trips across the field to collect data from them. The unmanned aerial vehicle can collect data not only from the current node it is communicating with but also data of other nodes that this node came into contact with. Simulations show that exchanging cached data is highly advantages as the drone can indirectly communicate with many more mobile nodes.

FTmRP-NCS: Fault-Tolerant And Reliable mRPL Routing Protocol For W-NCS Communication

The exponential rise in the demands for reliable and fault resilient communication over Wireless Network Control Systems (WNCS) across industrial monitoring and control ecosystems has alarmed academia-industries to develop more efficient wireless transmission solutions. On the other hand, the emergence of cloud-assisted Internet-of-Things (IoT) also has broadened the demands for reliable WNCS systems. To cope up with such irreplaceable needs, WNCS has exploited different wireless communication paradigms including IPv6 Routing Protocol for Low Power Lossy Networks (RPL) based WSN that enables reliable communication across the industrial setup to make optimal real-time process decision. However, being dynamic in nature WNCS with often undergo link-outage due to dynamic topology, node death, congestion etc. Though, a few researchers have addressed the routing problem in WNCS; however, integrating RPL with mobility to enable optimal communication has remained untouched. Additionally, no significant research addressed fault-resilient routing decision over WNCS setup, which motivates us to develop a highly robust Fault-Tolerant and Reliable mobile-RPL Routing Protocol for W-NCS (FTmRP-NCS). Unlike classical WNCS models, FTmRP-NCS employs dual objective-based routing decision by considering the Received Signal Strength Indicator (RSSI) and the number of control packets required (ETX). Here, the inclusion of RSSI ensures forwarding path formation with most reliable link condition, while ETX objective function helps maintaining low control packets and hence low energy exhaustion, low redundancy and high efficiency. FTmRP-NCS applies link-sensitive mobile node movement for data gathering across WNCS, which makes overall communication more reliable as well as time-efficient. Furthermore, fault-sensitive routing decision strengthens our proposed FTmRP-NCS protocol helps WNCS to yield optimal performance. FTmRP-NCS has been applied over standard IEEE 802.15.4 protocol stack and functions in parallel to the link and network layer, which retains backward compatibility with native RPL and hence assures easy implementation with real-time WNCS environment.

Interpretation on Energy Consumption of DYMO Protocol Towards Green Environment

Mobile Ad hoc Network is a decentralized network which can be deployed instantly. Routing is a very challenging task in this network due to dynamic movement of mobile nodes. Various routing protocols such as OLSR, DYMO and ZRP are proposed to establish the route for the data packets in MANET’s. As deploying of the protocols into real environment is a cost expensive process, the protocols are initially evaluated through a simulated arena. Many of the mobile devices are battery equipped and each protocol consumes energy in different manner. In this paper, energy consumption evaluation is carried out on OLSR, DYMO and ZRP protocols in a grid environment. The experiments have shown that DYMO protocol has less energy consumption when compared to OLSR and ZRP protocols.

Ad Hoc On-demand Distance Vector Inherent Techniques Comparison for Detecting and Eliminating the Black Hole Attack Nodes in Mobile Ad Hoc Network

It is important to connect wirelessly a group of moving mobile nodes together in a static or dynamic form, to transfer digital data between them, this form known as a mobile ad hoc network. This private network can be used in different essential situations where it depends on each connected mobile node to deliver and pass the data between them, without any fixed access point or router. Unfortunately, there are different types of attacks that can affect these nodes, and steal or corrupt the data inside, one of these attacks called the black hole attack. In this paper, a compared study will be done between two major innovative techniques derived from the ad hoc on-demand distance vector routing protocol to avoid the black hole attack; the paper will compare the two techniques in delay, throughput and packet dropping efficacy.

Implementation of Random Direction-3D Mobility Model to Achieve Better QoS Support in MANET

Mobile Ad hoc Networks (MANETs) provides changing network topology due to the mobility of nodes. The complexity of the network increases because of dynamic topology of nodes. In a MANET, nodes communicate with each other without the help of any infrastructure. Therefore, achieving QoS in MANET becomes a little difficult. The movement of mobile nodes is represented through mobility models. These models have great impact on QoS in MANET. We have proposed a mobility model which is a 3D implementation of existing Random Direction (RD) mobility model. We have done a simulation on AODV with QoS metrics throughput, delay and PDR, using NS-3 and performed analysis of the proposed mobility models with other 3D mobility models, namely Random Way Point (RWP) and Gauss Markov (GM). It is concluded that our proposed model gives better throughput, delay and PDR for AODV routing protocol in comparing to RWP and GM mobility models. This paper is for students and researchers who are involved in wireless technology and MANET. It will help them to understand how a mobility model impacts the entire network and how its enhancement improves the QoS in MANET.

Path Stability Evaluation and Controlled Broadcast Provision with A-AOMDV-CSE

Wireless network is most emerging area and progressing day by day. These days accessibility of large number of handheld devices has made the use of wireless-technology possible for making communication easier. Mobile Adhoc Networks (MANETs) are the essential sub-part of wireless technology which don’t use fixed entity or stand alone for the purpose of long distance communication. Every mobile node play the role of a router in forwarding the data packets as well as control. Due to the dynamic nature of mobile nodes, the path breaks are frequently happen and this is a becoming the major issue of MANET. During movement of mobile nodes, energy consumption is very high and make the routing process difficult so that connection lost in between. Swarm intelligence is the collective behavior of decentralized and self organized system and Ant Colony Optimization (ACO) is a specific branch of Swarm intelligence which can be used to solve optimization problems like routing. In this paper, a new multi-path routing algorithm is devised with the help of ACO and is incorporated in the environment of Ad hoc on Demand Multi-path Distance Vector (AOMDV) routing protocol. The new algorithm is designed by considering the features like path stability and regulating the intermediate nodes for the transfer or broadcasting of the packets. The new algorithm is compared with other prominent routing algorithms like ADSR, AOMDV, TORA and DSDV. This algorithm demonstrate the better performance in comparison with all the other algorithms.

Link-state QoS routing protocol under various mobility models

<p>Mobile Ad Hoc Network (MANET) consists of a group of mobile or wireless nodes that are placed randomly and dynamically that causes the continual change between nodes. A mobility model attempts to mimic the movement of real mobile nodes that change the speed and direction with time. The mobility model that accurately represents the characteristics of the mobile nodes in an ad hoc network is the key to examine whether a given protocol. The aim of this paper is to compare the performance of four different mobility models (i.e. Random Waypoint, Random Direction, Random walk, and Steady-State Random Waypoint) in MANET. These models were configured with Optimized Link State Routing (OLSR) protocol under three QoS (Quality of Service) <a title="Learn more about Metrics" href="https://www.sciencedirect.com/topics/engineering/metrics">metrics</a> such as the Packet Delivery Ratio (PDR), Throughput, End-to-End delay. The simulation results show the effectiveness of Steady-State Random Waypoint Mobility Models and encourage further investigations to extend it in order to guarantee other QoS requirements.</p>

A Fish Swarm Inspired Holes Recovery Algorithm for Wireless Sensor Networks

Wireless sensors networks (WSNs) have be applied to a number of fields such as environment monitoring, military surveillance, data collection and etc. However, the coverage holes problem are usually caused by some undesirable reasons, such as random deployment of sensors, energy consumption imbalance, unethical attack and hardware failures. The holes affect capabilities of WSNs greatly, so its recovery is one of the pivotal problems in WSNs. In order to enhance the performance of holes recovery, a robust approach based on an improved artificial fish swarm algorithm is presented in this paper. The movement of mobile nodes is analogized to the motion of artificial fish with the network coverage rate as objective function. Besides the classic artificial fish motion such as prey, follow and swarm, two novel fish motions called as leap and rebirth are also presented to enhance the convergence of this algorithm. An approach of self-adaptive visual range and step length for fish motion are adopted when updating the status of artificial fish. Simulation experiments show the effectiveness and robustness of the algorithm. The holes can be recovered efficiently without location information and holes detection using the least amount of mobile nodes. The network coverage is improved significantly with this proposed algorithm.

Delay-Tolerant Sequential Decision Making for Task Offloading in Mobile Edge Computing Environments

In recent years, there has been a significant increase in the use of mobile devices and their applications. Meanwhile, cloud computing has been considered as the latest generation of computing infrastructure. There has also been a transformation in cloud computing ideas and their implementation so as to meet the demand for the latest applications. mobile edge computing (MEC) is a computing paradigm that provides cloud services near to the users at the edge of the network. Given the movement of mobile nodes between different MEC servers, the main aim would be the connection to the best server and at the right time in terms of the load of the server in order to optimize the quality of service (QoS) of the mobile nodes. We tackle the offloading decision making problem by adopting the principles of optimal stopping theory (OST) to minimize the execution delay in a sequential decision manner. A performance evaluation is provided using real world data sets with baseline deterministic and stochastic offloading models. The results show that our approach significantly minimizes the execution delay for task execution and the results are closer to the optimal solution than other offloading methods.

An Efficient Group-Based Control Signalling within Proxy Mobile IPv6 Protocol

Providing a seamless handover in the Internet of Thing (IoT) applications with minimal efforts is a big challenge in mobility management protocols. Several research efforts have been attempted to maintain the connectivity of nodes while performing mobility-related signalling, in order to enhance the system performance. However, these studies still fall short at the presence of short-term continuous movements of mobile nodes within the same network, which is a requirement in several applications. In this paper, we propose an efficient group-based handoff scheme for the Mobile Nodes (MNs) in order to reduce the nodes handover during their roaming. This scheme is named Enhanced Cluster Sensor Proxy Mobile IPv6 (E-CSPMIPv6). E-CSPMIPv6 introduces a fast handover scheme by implementing two mechanisms. In the first mechanism, we cluster mobile nodes that are moving as a group in order to register them at a prior time of their actual handoff. In the second mechanism, we manipulate the mobility-related signalling of the MNs triggering their handover signalling simultaneously. The efficiency of the proposed scheme is validated through extensive simulation experiments and numerical analyses in comparison to the state-of-the-art mobility management protocols under different scenarios and operation conditions. The results demonstrate that the E-CSPMIPv6 scheme significantly improves the overall system performance, by reducing handover delay, signalling cost and end-to-end delay.

An Analysis on Security Threats of Black-Hole and Jellyfish Attacks in Mobile Ad-Hoc Network using HTTP Traffic

Mobile ad-hoc network (MANET) is an infrastructure less network. This network is a collection of randomly moving mobile nodes. As MANET does not have any centralized management, this network can form anywhere with the participation of randomly moving nodes. Because of such vulnerable behavior of MANET, this network has to face many security problems. There are so many security threats of MANET, which does not have any solution. Even detection of those problems is not easy. Some of the security threats are very severe. Those threats can even destroy the whole network. Researchers are working to find out the solution of those threats. Among those threats, we have worked with two security threats, which are Black-hole attack and Jellyfish attack. Here, we have found out the threats using HTTP traffic. We use OPNET modeler 14.5 as simulator AODV routing protocol. The aim of this paper is to find out the impact of security threats on MANET using HTTP traffic. We decide the impact using number of events and average number of events utilizing throughput of the OPNET modeler.

EECASC: an energy efficient communication approach in smart cities

The power consumption and connectivity of mobile nodes to the network are two essential issues in smart cities. In this paper, we have proposed a decentralized approach for mobility management of mobile nodes in smart cities. We propose a customized communication protocol compliant with 6LoWPAN along with the scheme that consumes less power regarding previous solutions. The proposed approach organizes static nodes as a tree for efficient routing, automatic addressing, and handling movement of mobile nodes. The proposed approach has a hybrid data transmission capability by proactively choosing multi-hop or single-hop routing to reduce power consumption of mobile nodes. It is evaluated based on different factors. The results show the superiority of the approach compared with the previous works. The promising analytical results manifest the higher performance (about 10% compared to the best scheme) of the proposed approach specifically in reducing the power consumption of mobile nodes.

Addressed Query Gossip Resource Discovery Protocol for Mobile P2P Networks and Its Performance in Diverse Mobility Models

This article describes how P2P resource discovery protocols perform poorly over mobile ad hoc networks mainly due to the frequent network dynamics. Peer-to-Peer search techniques including structured and unstructured can be employed over MANETs. Empirical studies indicate that searching in such resultant networks are not efficient and effective due to peer discovery, connectivity and mobility issues. The author proposes Addressed Query Gossip Resource Discovery algorithm, a lightweight resource discovery designed to suit the mobility requirements of ad hoc networks to optimize the search performance while at the same time minimize the extra usage of mobile and network resources. Mobility models represent the movements of mobile nodes. Such models are used to represent how the location, velocity and acceleration change over time. The author conducts performance analyses of the proposed protocol and widely used unstructured search techniques over MANET under 2 realistic mobility models, i.e., Random Waypoint and Reference Point Group Mobility models. The results show that the proposed protocol has the best performance in almost every measured metrics. In addition, the protocol consumes less energy, has less message overhead and good success ratio for random waypoint movement as compared to the reference group mobility model. After extensive evaluations, the simulation results clarify that the mobility models have a significant impact on the performance of peer-to-peer content discovery protocols over mobile ad hoc networks.