Search

A Genetic algorithm is a search algorithm depends on the methodology of natural selection and natural genetics. A Mobile Ad hoc network (MANET) is a type of wireless nodes (Devices) which are free to move anywhere in the network without any constraints. The nodes which are in range can communicate each other through radio waves and those who are not in range use any routing algorithm for communication. In this review paper, we focus on the problems of MANET that has been solved by applying GA for it and highlights the characteristic and challenges of MANET in the literature. More specifically, we present the summary of review papers and basic solutions that use and in the last, we present some future direction. Consequently, we concluded that modification in Fitness function (Evaluation function) according to the problem is the base of Genetic algorithm and variation in algorithm parameters can give solutions in a reasonable time. [ABSTRACT FROM AUTHOR]

Routing is one of the most challenging task in mobile ad hoc networks. Several works have been proposed to address this challenge. Majority numbers of researchers have introduced the routing protocols based on minimize resource consumption but still research needs improvement to design the efficient routing protocols which control the node movement. Proper use of location information and dynamically adjustment of intermediate nodes' retransmission adopted by a number of algorithms contribute to a reduction in the number of retransmissions and consequently reduce control overhead and resource consumption, but this feat was achieved at a price on network reachability. In this paper, an overview of analytical, network, and simulation model used in the design of routing mechanisms wherever possible is presented. This review paper classifies routing protocols into three categories named as route discovery, QoS (Quality of Service), and route maintenance with their relative performance. This paper also compares routing mechanisms against routing efficiency, reliability, packet delay, packet delivery ratio, control overheads, and QoS. This paper reviewed some current literatures that were proposed to improve the reliable, resource consumption, scalable, and QoS based routing mechanisms. This article also highlights the performance demands required of these protocols to assist researcher in MANET resource conservation as a good starting point for developing efficient routing algorithm. [ABSTRACT FROM AUTHOR]

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks (MANETs) from dynamic topologies that pose great challenges because of the mobility of nodes. The main objective was to delve into and refine the application of the Dijkstra's algorithm in this context, a method conventionally esteemed for its efficiency in static networks. Thus, this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra's algorithm, when adapted for dynamic updates, yields a very workable solution to the problem of real-time routing in MANETs. The results indicate that with these changes, Dijkstra's algorithm performs much better computationally and 30% better in routing optimization than Bellman-Ford when working with configurations of sparse networks. The theoretical framework adapted, with the adaptation of the Dijkstra's algorithm for dynamically changing network topologies, is novel in this work and quite different from any traditional application. The adaptation should offer more efficient routing and less computational overhead, most apt in the limited resource environment of MANETs. Thus, from these findings, one may derive a conclusion that the proposed version of Dijkstra's algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods. This paper, therefore, operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness. [ABSTRACT FROM AUTHOR]

This document is a guest editorial for a special issue on network/traffic optimization towards the 6G network. It highlights six research papers that focus on various topics related to network and traffic optimization in the context of 6G. These topics include hotspot performance in vehicular communication, ad-hoc networks (FANETs), cooperative relaying using MIMO-NOMA technology, network resource allocation using machine learning, cyber attacks and countermeasures in VoWi-Fi, and network management. The papers present theoretical analyses, propose novel models and schemes, and discuss practical applications and experiments. The authors express their gratitude to the researchers and reviewers involved in the publication of these papers. [Extracted from the article]

For each vehicle in a trusted clustering model, its movement is analyzed by vehicle network mobility routing protocol with identified speed and position. The fifth paper entitled "Ant colony optimization-induced route optimization for enhancing driving range of electric vehicles" by Gunasekaran Manogaran et al. proposed a fitness-ant colony optimization (FACO)-based route optimization for improving the driving range of electric vehicles (EVs). The second paper entitled "A SDN-based fine-grained measurement and modeling approach to vehicular communication network traffic" by Liuwei Huo et al. proposed a novel accurate and software defined networking (SDN) based fine-grained traffic measurement approach to obtain comprehensive traffic in VCN. [Extracted from the article]

Many applications of Wireless Mobile Communication are used in military, defense etc. however this type of network have many constraints mainly including power constrains, less range of communication & insecure transmission channel which makes it more vulnerable to attacks. such as sinkhole and black hole attack which hampers the communication by attacking on data traffic and communication links on which packets are routed. The attack which operates by falsely claiming a fresh route to destination is a kind of denial of service is known as Sink hole attack. On the other hand black hole attack, intentionally dropped the incoming packets through malicious node in between the intermediately nodes. In this research paper we can examine and investigate the impact of sink hole and black hole attack on the performance of MANET network using DSR protocol in terms of throughput, packet delivery ratio over the network. [ABSTRACT FROM AUTHOR]

With the advent of the Internet of Things (IoT), accomplishing specific tasks in an interconnected network consisting of integrated computational devices has become simple. The paper titled I "Improved perturbation technique privacy-preserving rotation-based condensation algorithm for privacy preserving in big data stream using Internet of Things" i is based on a privacy-preserving rotation-based condensation algorithm consisting of geometric transformation. The paper titled I "LAMSTAR: For IoT-based face recognition system to manage the safety factor in smart cities" i develop an effective and artificial intelligence IoT-based facial expression detection system is implemented to predict and match the face from the database. [Extracted from the article]

Mobile Ad Hoc Networks (MANETs) are dynamic and self-configuring networks characterized by node mobility and decentralized operations. Efficient routing protocols play a crucial role in ensuring reliable communication while optimizing resource usage, particularly energy consumption. This paper presents a comparative performance evaluation of three prominent routing algorithms, such as S-DYMO, M-DYMO, and FB-B-DYMO, focusing on their scalability and energy efficiency in MANET environments. This study utilizes simulation-based experiments to assess the performance metrics of S-DYMO, M-DYMO, and FB-B-DYMO. Key parameters evaluated include packet delivery ratio (PDR), end-to-end delay, routing overhead, and energy consumption under varying network sizes and mobility scenarios. Each algorithm's ability to scale with network size and maintain performance under dynamic conditions is analyzed to understand its suitability for real-world MANET deployments. The results indicate that S-DYMO exhibits robust scalability and efficient energy utilization in small to medium-sized networks, leveraging its proactive route discovery approach. Conversely, M-DYMO demonstrates competitive performance in larger networks due to its reactive route maintenance strategy, which balances energy efficiency with scalability challenges. FB-DYMO, integrating feedbackbased mechanisms, shows promising results in mitigating routing overhead and energy consumption but exhibits sensitivity to network dynamics. The findings provide insights into the trade-offs between scalability and energy consumption inherent in S-DYMO, M-DYMO, and FB-B-DYMO routing algorithms, offering guidance for selecting appropriate protocols based on specific MANET deployment scenarios. Future research directions include enhancing protocol adaptability to dynamic network conditions and optimizing energy-efficient routing strategies tailored for evolving MANET environments. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) can support safety-critical applications such as the safe and fast movement of emergency vehicles while preventing crashes, delays, and congestion involving emergency vehicles. A simulation approach to evaluate ambulance transit using VANET capabilities is presented in this paper for a real-life road network taken in and around the University of Missouri–Kansas City, USA. Three different VANET functional scenarios are compared with a base scenario (SC-1) which depicts the present-day traffic pattern and vehicle behaviors. In the three scenarios, the second one (SC-2) adds vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications along with the present-day traffic pattern; ambulances use VANETs simply to announce their arrival. The third scenario (SC-3) provides functionalities for ambulances to rerouting when they learn about a current or an anticipated road congestion. And the fourth scenario (SC-4) adds vehicle rerouting capabilities, so ambulance routes can be sent to vehicles, and they can avoid the ambulance path. Performance results are presented and evaluated for metrics such as delay, packet drop ratio, the average speed of the ambulance, average vehicle density, and ambulance message interval time. From the simulation results, it was observed that the ambulance transit time reduces by 12.52%, 14.65%, and 18.75% for SC-2, SC-3, and SC-4, respectively, as compared with SC-1, while the average ambulance speed increases by 14.49%, 15.57%, and 20.90% for SC-2, SC-3, and SC-4, respectively, when compared with SC-1. This paper provides substantial evidence that VANET capabilities for emergency vehicles can enhance crash protection and reduce the commute time for emergency response. [ABSTRACT FROM AUTHOR]

This special issue is based on the best papers from 8th International Conference on Ambient Systems, Networks and Technologies (ANT-2017, http://cs-conferences.acadiau.ca/ANT-17/) and the 7th International Conference on Sustainable Energy Information Technology (SEIT 2017, http://cs-conferences.acadiau.ca/seit-17/) held in Madeira, Portugal, from May 16-19, 2017. The algorithm is based on a variety of different data sources such as activity-travel diaries and related constraint information, meteorological conditions, bicycle and public transport supply data, and emissions and air pollutant concentrations data. Another paper is by Al-Ruithe et al. [[14]] entitled " I A systematic literature review of data governance and cloud data governance i ". 14 Al-Ruithe M, Benkhelifa E, Hameed K (2018) A systematic literature review of data governance and cloud data governance. [Extracted from the article]

Vehicular ad hoc networks (VANETs) are the specific class of Mobile ad hoc networks (MANETs). The vehicles displaces at a large speed because of which the network topology is continuously changed. It is a promising base work for the Intelligent Transport System (ITS). There are many challenges to be addressed when employing VANET. The dynamic topology and the complex mobility scheme make the MANET protocol futile for VANET implementation. The aim of this paper is to compare the various concepts used in field of VANET and provide an efficient solution. [ABSTRACT FROM AUTHOR]

MANETs are a type of wireless ad hoc network characterized by a wireless medium. The MANET's inherent characteristics, like dynamic change in topology and lack of central administration, reduce the possibility of provisioning security. Most of the studies have concentrated more on providing security than the computational cost of energy utilization. Neighbor security is proposed in this paper in addition to the existing de facto ANODR protocol for provisioning security in ANODR. The design and implementation of FB-NTT-S-ANODR to minimize energy consumption, thereby enhancing the network lifetime, are suggested. A soft computing technique for optimizing the performance of FB-NTT-S-ANODR is attempted. From experimental results, the proposed FB-NTT-S-ANODR minimizes the total energy consumption by 93.07%. Hence, the proposed method is more suitable for provisioning security and enhancing the network lifetime. [ABSTRACT FROM AUTHOR]

In Wireless Sensor Networks (WSNs), maintaining connectivity is crucial due to their dynamic nature. To address this challenge, this paper proposes an "improved schema," a novel approach aimed at enhancing the robustness and efficiency of Mobile Ad Hoc Networks (MANETs). A core advancement in the "improved schema" is its sophisticated neighbor selection algorithm, which considers factors such as node stability, link quality, and proximity. This algorithm ensures the selection of reliable neighbors, thereby improving overall network stability. Another significant improvement in the "improved schema" is the dynamic transmission range adjustment. By adapting transmission ranges in real-time based on current network conditions, the scheme optimizes communication ranges, enhancing network performance in varying environments. Additionally, the scheme leverages knowledge of network topology for pathfinding. By incorporating awareness of the network structure, the "improved schema" identifies more efficient paths for connectivity restoration, thereby minimizing resource utilization and latency. This study conducted extensive simulations to evaluate the performance of the "improved schema" against established schemes, including the Restoring Connectivity through Inward Motion (RIM), Nearest Neighbour (NN), and Survivability-Aware Connectivity Restoration (SACR) strategies. The results consistently demonstrate that the "improved schema" outperforms existing schemes in terms of connectivity robustness, adaptability to dynamic scenarios, and overall network efficiency. These findings underscore the effectiveness of the "improved schema" in addressing the inherent challenges faced by WSNs and MANETs, making it a promising solution for improving network performance in dynamic environments. [ABSTRACT FROM AUTHOR]

For instance, wireless multimedia sensor networks, mobile wireless sensor networks, wireless underwater sensor networks, wireless underground sensor networks, and wireless sensor-actuator networks are being explored to extend WSNs for supporting rich-media sensing, mobile sensing, underwater/underground sensing, and closed-loop sensing and control. CWSN2012 serves as a forum for sensor network researchers, developers, and users to communicate the productions and experience of sensor network research and applications. The paper " I An adaptive opportunistic network coding mechanism in wireless multimedia sensor networks i " proposed an adaptive opportunistic network coding mechanism (AONC) to improve video communication performance in wireless multimedia sensor networks. [Extracted from the article]

Delay tolerant networks (DTNs) is a network evolved from mobile networks. Differing from the traditional network, which has a stable end‐to‐end transmission path, DTNs are sparse and intermittently connected mobile ad hoc network, which are widely used in harsh environments, such as battlefields, seabed, space communication networks, and so on. In DTNs, intermittent connectivity, partitioned network, long delays and node mobility characteristics make the network fail to communicate frequently, therefore, how to successfully forward the message is of extreme importance. Up to now, almost all the traditional models in DTNs use the store‐carry‐forward method. This paper proposes a novel clustered DTN routing model based on sensing node relationship strength. The routing mechanism takes advantage of the number of other nodes encountered by the nodes in the process of movement and the changes in the number of nodes to calculate the strength of the relationship between nodes, and clusters DTN routing according to the strength of the relationship between nodes. Moreover, the relationship between nodes in a cluster and other clusters is used to transmit messages between clusters, and messages are transmitted within clusters according to the strength of the relationship between nodes. Simulation results show that the routing mechanism not only increases the success rate of message transmission, but also reduces the transmission delay of messages and improves network performance. [ABSTRACT FROM AUTHOR]

This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing. [ABSTRACT FROM AUTHOR]

Mobile Ad Hoc Networks (MANETs) are decentralized networks where mobile nodes communicate through radio waves without fixed infrastructure. However, they are susceptible to security attacks like the black hole attack, where malicious nodes claim optimal routes to intercept packets. This paper focuses on detecting black hole attacks within MANETs using a hybrid routing protocol. Specifically, the Modified-Zone-Based Hierarchical Link State (M-ZHLS) routing protocol is proposed and evaluated against existing protocols using simulations in NS2. The proposed method employs on-demand topology information transmission and utilizes techniques like expanding ring flooding for route discovery. Simulation results demonstrate that M-ZHLS outperforms existing protocols by reducing average delay by 5%, lowering routing overhead by 4%, and increasing delivery ratio by 4.5%. Future work aims to further enhance network performance in real-time environments. [ABSTRACT FROM AUTHOR]

Wireless Mobile Ad Hoc Networks (MANETs) present topologies where nodes act as both hosts and routes, necessitating efficient routing protocols to handle frequent route updates and transmission congestion. This paper proposes a novel routing algorithm, Fuzzy Controller Ad hoc On-demand Distance Vector (FC-AODV), to address these challenges. The FC-AODV algorithm is designed to improve packet delivery ratio, throughput, end-to-end delay, packet loss, remaining energy, and routing overhead compared to the traditional AODVprotocol. Through extensive simulations using NS 2, the proposed algorithm demonstrates superior performance across varying network scenarios. Results indicate an average increase of 12.4% in packet delivery ratio, 10.27% in throughput, and a decrease of 5.37% in end-to-end delay compared to AODV. Additionally, FC-AODV reduces packet loss by 5.57%, increases remaining energy by 6.4%, and decreases routing overhead by 6.37%. Future research directions include applying the FC-AODV concept to satellite networks, exploring the integration of shortest path algorithms, and evaluating FC-AODV in real-time network environments. [ABSTRACT FROM AUTHOR]

The term "MANET," which stands for "Mobile Adhoc Network," refers to an ad hoc wireless network incorporating routing mechanism atop an ad hoc link layer network. These networks consist of wirelessly linked mobile nodes that self- configure and self-heal. Due to frequent changes in network architecture, MANET nodes have the freedom to move. Each node in the network serves as a router, forwarding traffic to specified nodes. Broadcast algorithms in wireless ad hoc networks typically follow two main approaches: static and dynamic. In the static approach, local algorithms proactively determine each node's status based on local topology information and a globally known priority function. This paper reveals that existing local broadcast algorithms based on the static approach fail to achieve a satisfactory approximation factor for the optimum solution to an NP-hard problem. However, it is demonstrated that a constant approximation factor is attainable when relative position information is available. The hybrid broadcast method dynamically determines each node's state "on-the-fly," ensuring complete delivery and maintaining a consistent value approaching the ideal outcome as closely as possible. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a type of mobile ad hoc network that forms a unified wireless communication network between vehicles and roadside nodes. Roadside units (RSUs), as the infrastructure and key component of VANETs, play a critical role in improving the performance of VANETs. Their deployment can effectively improve the communication performance of the network. The goal of the RSU deployment (RSUD) problem is to install as few RSUs as possible on both sides of roads or intersections so that they can cover most areas and achieve better communication performance. This paper proposes a multi-objective optimization model to solve the RSUD problem using the characteristics of RSUDs on urban roads. Our optimized target includes three performance indicators, which are the deployment cost of RSUs, their coverage area, and communications. Since these three indicators cannot achieve consensus, this paper proposes a multi-objective evolutionary algorithm, the NSGA-II Pareto optimal solution, to solve the RSUD problem. The simulation results show the effectiveness of the multi-objective model and method. Finally, we present an experiment featuring RSU deployment that is based on a real traffic environment and uses OpenStreetMap; this experiment proves that our proposed method is practical. [ABSTRACT FROM AUTHOR]

Ad hoc networks cover a variety of paradigms such as mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), vehicular ad hoc networks (VANETs), underwater networks, airborne networks, underground networks, personal area networks, and home networks. In the second paper, "The Time-Free Comparison Model for Fault Diagnosis in Wireless Ad hoc Networks", Jarrah et al. described a new comparison-based model for fault diagnosis in wireless ad hoc networks. B Guest Editorial b An ad hoc network is a wireless system in which network nodes are connected via wireless links and cooperate to self-organize into a network with no need for any infrastructure such as access points or base stations. [Extracted from the article]

Mobile ad hoc Networks researchers need to apply specific parameters in the simulation tools chosen to analyze and discuss their results. The challenge faced by multiple authors is on how to decide on the choice of particular parameters. A wrong choice could lead to a no credible result and a doubtful result by other researchers. A best practice is to follow what other authors are using as input parameters in their paper. This review analyses 72 proceeding papers and articles in different digital libraries: google scholar, IEEE Xplore, Elsevier, Springer, and snowball from 2010-2020. We present the result of our survey in this paper. We recommend the input parameters research should use base on the high utilization. Our review will also help the community in MANET and Internet gateway to improve the credibility of the input parameters. [ABSTRACT FROM AUTHOR]

This document serves as an introduction to a special issue on wireless sensor networks (WSNs), explaining their structure and applications in various sectors. It also discusses the challenges faced by WSNs, such as limited energy and data management. The special issue features ten research papers on advanced WSNs. [Extracted from the article]

Flying Ad hoc Networks have emerged as a promising technology for number of real-time applications. However, the flexible and unstructured characteristics of these networks make them vulnerable to security threats posed by malicious nodes, such as denial of service attacks, node impersonation, and information breaches. Another major issue is the consideration of those nodes being unable to prove their trustworthiness due to factors like hardware or software failure, or by link interruptions, during the processing of detection of false nodes in the network. The existing mechanisms encompassing encryption, authentication, and intrusion detection highlight limitations to secure real-time applications and services due to the high speed of flying nodes and the absence of fixed network structures. To overcome these constraints, this research paper incorporates a novel framework for evaluating and improving the security of network by introducing an innovative cluster-based approach. Moreover, it presents a fuzzy model that dynamically estimates the trust levels of both individual nodes and clusters, by assigning weight to the parameters to address vulnerabilities. Additionally, a trust reconfiguration mechanism is further proposed to address the issue of nodes unable to substantiate their trust by providing them with additional chances based on the collective trust from previous evaluations. Further, the paper incorporates a dynamic reputation system to proficiently identify and separate malicious and selfish nodes from the network. Simulation results indicate a significant improvement in performance metrics, with a considerable reduction in delay and drop ratio by 41.46% and 36.37%, respectively, while the sufficient rise of 54.71% and 46.05% in throughput and coverage, respectively, comparing with the considered state-of-art. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks are self-organizing networks that do not rely on fixed infrastructure. Smart antennas employ advanced beamforming technology, enabling ultra-long-range directional transmission in wireless networks, which leads to lower power consumption and better utilization of spatial resources. The media access control (MAC) protocol design using smart antennas can lead to efficient usage of channel resources. However, during ultra-long-distance transmissions, there may be significant transport delays. In addition, when using the time division multiple access (TDMA) schemes, it can be difficult to manage conflicts arising from adjacent time slot advancement caused by latency compensation in ultra-long-range propagation. Directional transmission and reception can also cause interference between links that reuse the same time slot. This paper proposes a new distributed dynamic TDMA protocol called State Interaction-based Slot Allocation Protocol (SISAP) to address these issues. This protocol is based on slot states and includes TDMA frame structure, slot allocation process, interference self-avoidance strategy, and slot allocation algorithms. According to the simulation results, the MAC layer design scheme suggested in this paper can achieve ultra-long-distance transmission without conflicts. Additionally, it can reduce the interference between links while space multiplexing. Furthermore, the system exhibits remarkable performance in various network aspects, such as throughput and link delay. [ABSTRACT FROM AUTHOR]

Wireless ad hoc/sensor networks (WASN) have seen increased application in three-dimensional (3D) environments, such as underwater and aerial scenarios. However, WASN may be fragmented or unable to connect continuously due to the harsh surrounding environment or high mobility. Therefore, restoring the network connectivity and transmit data in real time is very important. This paper focuses on the critical task of restoring network connectivity in 3D WASN, a complex issue given that existing connectivity restoration algorithms for two-dimensional environments are not directly applicable or become overly complicated in 3D contexts. We present a comprehensive analysis of the current research landscape, summarizing key findings related to various aspects of 3D WASN connectivity restoration. These aspects include the application environment (underwater, in the sky, and recovery disaster), opportunities for restoration (active, passive, and active/passive), implementation strategies (clustering and sleep scheduling), and resource constraints (node deployment and movement control). Our study also proposes a classification of connectivity restoration solutions for 3D WASN, identifying existing gaps and suggesting potential future research directions. By providing specific insights and a structured overview of the field, we aim to contribute to the ongoing development of robust and resilient 3D WASN. [ABSTRACT FROM AUTHOR]

Security aspects play an important role in almost all of the application scenarios given the vulnerabilities inherent in wireless ad hoc networking from the very fact that radio communication takes place (e.g. in tactical applications) to routing, man-in-the-middle and elaborate data injection attacks. Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. It is vital to protect the network from different kinds of security threats. This paper proposes a security solution for manets using a pre-existing routing protocol, ad hoc ondemand vector routing (aodv). Here the improvement is done by the inclusion of fuzzy logic approach. The fuzzy logic will analyse the network and perform the rerouting based on fuzzy decision. It will perform the routing over intrusion safe path. [ABSTRACT FROM AUTHOR]

Security aspects play an important role in almost all of the application scenarios given the vulnerabilities inherent in wireless ad hoc networking from the very fact that radio communication takes place (e.g. in tactical applications) to routing, man-in-the-middle and elaborate data injection attacks. Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. It is vital to protect the network from different kinds of security threats. This paper proposes a security solution for manets using a pre-existing routing protocol, ad hoc on-demand vector routing (aodv). Here the improvement is done by the inclusion of fuzzy logic approach. The fuzzy logic will analyse the network and perform the rerouting based on fuzzy decision. It will perform the routing over intrusion safe path. [ABSTRACT FROM AUTHOR]

Mobile Ad Hoc Networks (MANETs) are dynamic, self-organizing networks that lack a fixed infrastructure, making them highly vulnerable to various security threats. One of the critical aspects in MANETs is the establishment of efficient and secure communication among mobile nodes. Routing protocols play a pivotal role in ensuring reliable data transmission in such environments. This paper presents a comprehensive overview of the challenges and solutions related to achieving secure and efficient communication within MANET routing protocols. The main objective of this paper is to define the path for security and to further improve throughput, routing overhead, end-to-end delay, packet delivery ratio, and at the same time to create an energy-enhanced way with excellent security. Implementation of cryptographic algorithms for the information is done in such a way that it is impossible for attackers to compromise the resources of information sent over the web. This paper proposes a new intrusion detection system called Enhanced Adaptive 3 Acknowledgement (ECC-EA3ACK), using EA3ACK with Elliptical Curve Cryptography (ECC) specially designed for MANETs. In this ECC, there is a two-key encryption technique based on elliptic curve theory that can be used to create faster, smaller, more energy-efficient cryptography. The above-developed on-demand routing protocol achieves better results than the existing model through one of the leading simulators called Network Simulator (NS2), which is used to implement and test the proposed system. The proposed cryptography provides secured transmission, reduces routing overhead, improves packet delivery ratio, throughput, and minimizes delay due to increased remaining energy and improved security. [ABSTRACT FROM AUTHOR]

Over the last few years there has been explosive growth in the use of the Wireless communications from top to bottom i.e. Satellite transmission to home Wireless personal area networks. The primary advantage of a wireless network is the ability of wireless node to communicate with the universe during mobility. Two basic system models of a wireless system are fixed and Mobile Adhoc Network has been developed for the wireless network paradigm. The first model consists of multiple numbers of mobile workstations and relatively fewer but more powerful, having fixed routers. The second model has been proposed to set up a network on-demand basis. When a collection of wireless mobile nodes are capable of communicating with each other without the use of network infrastructure, centralized administration, or centralized control like mobile switching centers or base stations, that set up is called Mobile Adhoc Network. Here each mobile node operates not only as a host but also as a router, forwards packets to other mobile nodes in the network that may not be within direct wireless transmission range of each other. Each node participates in an Adhoc routing protocol (Yadav et al. in Comput Netw 118:15–23, 2017) that allows it to discover multiple paths through the network to any other node. Institute of Electrical and Electronics Engineers 802.11 (IEEE 802.11) [Kaur et al. in Int J Res Advent Technol 5(8), 2017] is a vital part of pervasive networks, which is a special kind of network where users can join and communicate anytime or anywhere on the fly. It is a popular kind of network because its applications cover a variety of areas. A unique communication paradigm is used which is able to run without fixed infrastructure and relies on wireless terminals for routing and transporting services. A number of security and scalability issues arise due to its wireless transmissions and unpredictable topology changes. Open standard, dynamic topology, scattered arrangements, and multi-hop routing are crucial features of IEEE 802.11 networks that make them vulnerable to various kinds of attacks. A Wormhole attack is one of the serious kinds of attack. Thus, security is the most important concern in IEEE 802.11 networks. This paper presents the refurbishment of the routing structure of Ad hoc On-Demand Distance Vectors (AODV) protocol (Ning et al. in Proceedings of the IEEE systems, man and cybernetics society information assurance workshop (IAW), West Point, New York, USA, pp 60–67, 2003). It will be helpful to safeguard IEEE 802.11 networks from Wormhole attacks by preventing Wormhole Attacks. The DAPS technique had been presented in Saini et al. (Int J Res Advent Technol 6(4), 2018) to detect Wormhole Attacks. Further to DAPS technique, a new Wormhole prevention technique has been introduced in this paper called Proactive Prevention Key Solution (PPKS). [ABSTRACT FROM AUTHOR]

By applying the Lyapunov method and autoregressive neural network (ANN), an online caching decision algorithm is further proposed to make caching decisions. In the third paper, "Connectivity Based I k i -Coverage Hole Detection in Wireless Sensor Networks", Yan et al. proposed a connectivity based k-coverage hole detection algorithm and adopted Rips complex in homology theory to model a wireless sensor network (WSN). Four measures are introduced in the system to improve fault tolerance and system efficiency, including a traffic regulation based radiomap (TRRM) establishing method, a full-overlapping clustering strategy, an adaptive feature space (AFS) algorithm, and a praxeological tracking algorithm. [Extracted from the article]

This paper focuses on achieving high-level security in Mobile Adhoc Networks (MANET) by incorporating Blockchain technology-based Intrusion Detection systems (IDS). The existing works on MANET security focus on either security prevention or detection. Thus, the security level attained by the prior works is unable to cope with the increasing attacks. To resolve this main issue, this research paper introduces Lightweight Blockchain assisted Intrusion Detection System (LB-IDS) which jointly prevents and detects the attacks held on mobile networks. Initially, the network nodes are authenticated by a lightweight Blockchain-based Multi-Factor Authentication (LBMFA) scheme. This procedure prevents the malicious nodes entry to the network. Then, data packets are transmitted through the optimal route which is selected by Multi-Objective Strawberry Optimization (MOSO) algorithm. The collected data packets are fed into IDS which classifies the data into normal and malicious packets. For IDS, we proposed Deep Q-Learning (DQL) algorithm which takes actions by learning the environment. As the mitigation step, the Blockchain is updated with the trust value according to the data packet classification. For such continuous monitoring, K-Mode Clustering (KMC) algorithm is proposed. On the whole, the proposed work improves the network security in MANET through Prevention, Detection, and Mitigation. The results of the presented work attains better security level, packet delivery ratio (PDR), energy efficiency, delay, and detection accuracy. [ABSTRACT FROM AUTHOR]

The goal of the paper is to present a Stacked autoencoder approach for enhancing Intrusion Detection Systems (IDSs) in Mobile Ad-Hoc Networks (MANETs). The paper proposes a Stacked autoencoder-based approach for MANET (Stacked AE-IDS) to reduce correlation and model relevant features with high-level representation. This method reproduces the input with a reduced correlation, and the output of the autoencoder is used as the input of the Deep Neural Network (DNN) classifier (DNN-IDS). The proposed Deep Learning-based IDS focuses on Denial of Services (DoS) attacks within labeled datasets, which are available for intrusion detection, and employs the most potential attacks that impact routing services in Mobile Networks. The proposed Stacked AE-IDS method enhances the effectiveness of IDSs in detecting attacks in MANETs by reducing the correlation and modeling high-level representations of relevant features. The focus on DoS attacks and their impact on routing services in Mobile Networks makes the proposed approach particularly relevant for MANET security. The proposed Stacked AE-IDS approach has potential applications in enhancing the security of MANETs by improving the effectiveness of IDSs. This approach can be used to detect different types of attacks, particularly DoS attacks, and their impact on routing services in Mobile Networks. [ABSTRACT FROM AUTHOR]

Internal node power management of the wireless network is becoming the most difficult task in the Mobile Adhoc Network. Power outages on any node in the MANET degrade overall communication network performance. Efficient power management solutions are required for all tiers of the MANET protocol. The Physical layer might keep track of the antenna transmission and reception power strategies, as well as the power management plans for idea nodes and sleep nodes. The MAC layer power management could increase the packet delivery ratio, average delay, average jitter, and network delay metrics. The network layer's power management is supported by the link's lifetime and node mobility. TCP/IP protocols enable reliable packet transmission, which improves the transport layer. This survey paper conducted a thorough survey of the MANET protocol stack. This survey paper conducted a thorough investigation of MANET protocol stack power management in order to identify factors that can be improved to achieve a better power management strategy in MANET nodes. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses several reports published within the issue on topics including controller design for satellite attitude determination, evaluation of mobile ad hoc network (MANET) routing mechanisms, and comparative analysis of routing protocols.

Mobile devices are pervasive in today's world, and the ability to create ad-hoc networks among these devices enables increased connectivity. Peer-to-peer (P2P) Mobile Ad-hoc Network (P2P MANET) offer flexibility and scalability. Devices can join or leave the network seamlessly, and the network can adapt to changing conditions. This makes them suitable for scenarios with varying numbers of devices or where the network topology changes frequently. Moreover, the P2P network is a robust, fault-tolerant, and distributed network for sharing the resources like CPU, memory, files, etc. However, solid mobility, malicious behavior and short wireless transmission range more risk to searching the mobile P2P network resources. In this paper, a novel Vulture-based Deep Belief Model (VbDBM) is designed to enhance the performance of resource search in a mobile P2P network. Also, it will neglect the attacks and errors are presented during the transmission stage. In addition, the VbDBM framework is implemented in the NS-2 tool, and there are nine nodes created for resource search. Initially, the developed technique analyzes the user needs and identifies the neighboring peer of the user location with the help of vulture fitness. At next, the proposed technique provides the resource to the volunteer node (neighboring peer). Finally, the volunteer node offers the resource to the user. The attained performance metrics of developed VbDBM are compared with other existing techniques in terms of search rate, simulation time, data transfer rate, number of Data, and throughput. From the comparison proposed algorithm has improves 350 kbps throughput and 28% search rate respectively. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANETs) offer a decentralized communication solution ideal for infrastructure-less environments like disaster relief zones. However, their inherent lack of central control and dynamic topology make them vulnerable to attacks. This paper examines the impact of various attacks on mobile nodes within two network types: randomly and uniformly distributed stationary networks. Four types of attacks are investigated: delay, dropping, sinkhole (alone), and a combined black hole attack (dropping + sinkhole). The effects of these attacks are compared using the packet delivery ratio, throughput, and end-to-end delay. The evaluation results show that all single attacks negatively impacted network performance, with the random network experiencing the most significant degradation. Interestingly, the combined black hole attack, while more disruptive than any single attack, affected the uniformly distributed network more severely than the random network. [ABSTRACT FROM AUTHOR]

In the cooperative vehicle‐infrastructure system (CVIS), due to its computation limitation, vehicles are difficult to handle computing‐intensive delay‐sensitive tasks, so offload tasks to roadside unit (RSU) become popular. Due to the complexity of vehicles' tasks and tasks generated by different vehicles have different delay constraints, minimize energy consumption of RSUs under task dependence and delay constraints is challenging. This paper defines the task priority queuing criterion for the task priority division problem, proposes a task scheduling strategy for energy‐packet queue length tradeoff (TSET) in CVIS under RSUs distributed task scheduling problem and establishes the vehicle speed state model, task model, data queue model, task computing model and energy consumption model. After Lyapunov optimization theory transformed the optimization model, a knapsack problem was described. The simulation results verify that TSET reduces the average energy consumption of roadside units and ensures the stability of the data queue under task dependence and deadline conditions. [ABSTRACT FROM AUTHOR]

Flying ad hoc network (FANET) is a new technology, which creates a self-organized wireless network containing unmanned aerial vehicles (UAVs). In FANET, routing protocols deal with important challenges due to limited energy, frequent link failures, high mobility of UAVs, and limited communication range of UAVs. Thus, a suitable path is always essential to transmit data between UAVs. In this paper, a local filtering-based energy-aware routing scheme (LFEAR) is proposed for FANETs. LFEAR improves the template of the route request (RREQ) packet by adding three fields, namely the energy, reliable distance, and movement similarity of the relevant route to create stable and energy-efficient paths. In the routing process, LFEAR presents a local filtering construction technique to avoid the broadcasting storm issue. This filter limits the broadcasting range of RREQs in the network. Accordingly, only UAVs inside this local filtered area can rebroadcast RREQs and other UAVs must eliminate these packets. After ending the route discovery process, the destination begins the route selection phase and extracts information about each discovered route, including the number of hops, route energy, reliable distance, and movement similarity. Then, the destination node calculates a score for each path based on the extracted information, selects the route with the highest score, and sends a route reply (RREP) packet to the source node through this route. Finally, the simulation process of LFEAR is performed using the NS2 simulator, and two simulation scenarios, namely change in network density and change in the speed of UAVs, are defined to evaluate network performance. In the first scenario, LFEAR improves energy consumption, packet delivery rate, network lifespan, and delay by 1.33%, 1.77%, 6.74%, and 1.71%, while its routing overhead is about 16.51% more than EARVRT. In the second scenario, LFEAR optimizes energy consumption and network lifetime by 5.55% and 5.67%, respectively. However, its performance in terms of routing overhead, packet delivery rate, and delay is 23%, 2.29%, and 6.67% weaker than EARVRT, respectively. [ABSTRACT FROM AUTHOR]

In statistical process control, accurately estimating in-control (IC) parameters is crucial for effective monitoring. This typically requires a Phase I analysis to obtain estimates before monitoring commences. The traditional "fixed" estimate (FE) approach uses these estimates exclusively, while the "adaptive" estimate (AE) approach updates the estimates with each new observation. Such extreme criteria reflect the traditional bias-variance tradeoff in the framework of the sequential parameter learning schemes. This paper proposes an intermediate update rule that generalizes two ad hoc criteria for monitoring univariate Gaussian data, by giving a lower probability to parameter updates when an out-of-control (OC) situation is likely, therefore updating more frequently when there is no evidence of an OC scenario. The simulation study shows that this approach improves the detection power for small and early shifts, which are commonly regarded as a weakness of control charts based on fully online adaptive estimation. The paper also shows that the proposed method performs similarly to the fully adaptive procedure for larger or later shifts. The proposed method is illustrated by monitoring the sudden increase in ICU counts during the 2020 COVID outbreak in New York. [ABSTRACT FROM AUTHOR]

To mitigate the control overhead of Software-Defined Mobile Ad Hoc Networks (SD-MANETs), this paper proposes a novel approach, termed Software-Defined Greedy Perimeter Stateless Routing (SD-GPSR), which integrates geographical location information. SD-GPSR optimizes routing functions by decentralizing them within the data plane of SD-MANET, utilizing the geographic location information of nodes to enhance routing efficiency. The controller is primarily responsible for providing location services and facilitating partial centralized decision-making. Within the data plane, nodes employ an enhanced distance and angle-based greedy forwarding algorithm, denoted as GPSR_DA, to efficiently forward data. Additionally, to address the issue of routing voids in the data plane, we employ the A* algorithm to compute an optimal routing path that circumvents such voids. Finally, we conducted a comparative analysis with several state-of-the-art approaches. The evaluation experiments demonstrate that SD-GPSR significantly reduces the control overhead of the network. Simultaneously, there is a notable improvement in both end-to-end latency and packet loss rate across the network. [ABSTRACT FROM AUTHOR]

In flying Ad hoc networks (FANETs), traditional geographic routing protocols such as greedy perimeter stateless routing (GPSR) protocol, usually adopts a periodic Hello mechanism and a greedy forwarding mechanism based on maximum advanced distance. However, the traditional periodic Hello mechanism ignores node mobility, network connectivity, and traffic type, thus causing temporary communication blindness (TCB). Additionally, the traditionally geographic routing protocols choose the next-hop node based on the maximum advanced distance. The greedy forwarding mechanism based on maximum advanced distance towards the destination ignores the impact of network dynamics on links, leading to short link lifetime and frequent link breakage. To address these problems, a novel airborne greedy geographic routing (AGGR) protocol for FANETs is proposed in this paper. It includes an adaptive Hello mechanism and a greedy forwarding mechanism based on the relative motion of nodes. In the adaptive Hello mechanism, the Hello period of working nodes is calculated according to the real-time relative characteristic values between the node and its upstream node, and the Hello period of idle nodes adopts a fixed value according to the movement characteristics relative to all neighbor nodes. In the greedy forwarding mechanism based on the relative motion of nodes, in order to adapt to the high dynamic changes of network topology, the time to enter the communication range of the destination is taken as routing criteria to choose the next-hop node. Moreover, the AGGR protocol is compared with the original GPSR in simulation. The results show that it significantly mitigates the TCB problem and gains significant improvement in network performance. [ABSTRACT FROM AUTHOR]

Wireless Ad Hoc Networks consist of devices that are wirelessly connected. Mobile Ad Hoc Networks (MANETs), Internet of Things (IoT), and Vehicular Ad Hoc Networks (VANETs) are the main domains of wireless ad hoc network. Internet is used in wireless ad hoc network. Internet is based on Transmission Control Protocol (TCP)/Internet Protocol (IP) network where clients and servers interact with each other with the help of IP in a pre-defined environment. Internet fetches data from a fixed location. Data redundancy, mobility, and location dependency are the main issues of the IP network paradigm. All these factors result in poor performance of wireless ad hoc networks. The main disadvantage of IP is that, it does not provide in-network caching. Therefore, there is a need to move towards a new network that overcomes these limitations. Named Data Network (NDN) is a network that overcomes these limitations. NDN is a project of Information-centric Network (ICN). NDN provides in-network caching which helps in fast response to user queries. Implementing NDN in wireless ad hoc network provides many benefits such as caching, mobility, scalability, security, and privacy. By considering the certainty, in this survey paper, we present a comprehensive survey on Caching Strategies in NDN-based Wireless Ad Hoc Network. Various caching mechanism-based results are also described. In the last, we also shed light on the challenges and future directions of this promising field to provide a clear understanding of what caching-related problems exist in NDN-based wireless ad hoc networks. [ABSTRACT FROM AUTHOR]

An introduction to the article is presented in which the editor discusses various reports within the issue on topics including the concept of disagreement power, wireless ad hoc networks, and failure detector.

Vehicular Ad-Hoc Networks (VANET) models are derived from Mobile Ad-Hoc Networks that possess an impressive role in the intelligent transportation system today and also in the future. So scientists are always looking for the best theories in hope of grasping the fastest and safest connections between vehicles, to provide traffic and accident news in real time. The high number of nodes is one of the significant features of this network that results in an increase of the number of transmitted packets in the network. Distributed system and high mobility of the nodes are the other most important attributes of Vehicular Ad-Hoc networks. In this paper, we aim to review the studies and improvements of vehicular Ad-Hoc network in the fields of safety and traffic management. In addition, we introduce the most common challenges of this network and gather latest methods for resolving those problems. Multi agent systems will be one of the newest and suitable tools in this system. The main purpose is arranging safe connection between agents. Fixing agreements and removing the disputes are not detachable from functional system. It is like group associations and societies which require human collaborations and cooperation. Development of science resulted in utilization of these systems in various aspects like VANET. Nowadays scientists and researchers are interested to make use of these methods for improving the role of vehicle networks in the field of traffic management, safety and entertainment, we will review them in the following paragraphs. [ABSTRACT FROM AUTHOR]

A mobile ad hoc network (MANET) is an infrastructure-less network where mobile nodes can share information through wireless links without dedicated hardware that handles the network routing. MANETs' nodes create on-the-fly connections with each other to share information, and they frequently join and leave MANET during run time. Therefore, flexibility in MANETs is needed to be able to handle variations in the number of existing network nodes. An effective routing protocol should be used to be able to route data packets within this dynamic network. Lacking centralized infrastructure in MANETs makes it harder to secure communication between network nodes, and this lack of infrastructure makes network nodes vulnerable to harmful attacks. Testbeds might be used to test MANETs under specific conditions, but researchers prefer to use simulators to obtain more flexibility and less cost during MANETs' environment setup and testing. A MANET's environment is dependent on the required scenario, and an appropriate choice of the used simulator that fulfills the researcher's needs is very important. Furthermore, researchers need to define the simulation parameters and the other parameters required by the used routing protocol. In addition, if the MANET's environment handles some conditions where malicious nodes perform network attacks, the parameters affecting the MANET from the attack perspective need to be understood. This paper collects environmental parameters that might be needed to be able to set up the required environment. To be able to evaluate the network's performance under attack, different environmental parameters that evaluate the overall performance are also collected. A survey of the literature contribution is performed based on 50 recent papers. Comparison tables and statistical charts are created to show the literature contribution and the used parameters within the scope of the collected papers of our survey. Results show that the NS-2 simulator is the most popular simulator used in MANETs. [ABSTRACT FROM AUTHOR]

Vehicle Ad hoc Networks (VANETs) have high mobility and a randomized connection structure, resulting in extremely dynamic behavior. Several challenges, such as frequent connection failures, sustainability, multi-hop data transfer, and data loss, affect the effectiveness of Transmission Control Protocols (TCP) on such wireless ad hoc networks. To avoid the problem, in this paper, mobility-aware zone-based routing in VANET is proposed. To achieve this concept, in this paper hybrid optimization algorithm is presented. The hybrid algorithm is a combination of Ant colony optimization (ACO) and artificial bee colony optimization (ABC). The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another. The optimal routing process is used to avoid traffic and link failure. The fitness function is designed based on Link stability and Residual energy. The validation of the proposed algorithm takes solution encoding, fitness calculation, and updating functions. To perform simulation experiments, NS2 simulator software is used. The performance of the proposed approach is analyzed based on different metrics namely, delivery ratio, delay time, throughput, and overhead. The effectiveness of the proposed method compared with different algorithms. Compared to other existing VANET algorithms, the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay. [ABSTRACT FROM AUTHOR]