Search

Live video streaming has become one of the main multimedia trends in networks in recent years. Providing Quality of Service (QoS) during live transmissions is challenging due to the stringent requirements for low latency and minimal interruptions. This scenario has led to a high dependence on cloud services, implying a widespread usage of Internet connections, which constrains contexts in which an Internet connection is not available. Thus, alternatives such as Mobile Ad Hoc Networks (MANETs) emerge as potential communication techniques. These networks operate autonomously with mobile devices serving as nodes, without the need for coordinating centralized components. However, these characteristics lead to challenges to live video streaming, such as dynamic node topologies or periods of disconnection. Considering these constraints, this paper investigates the application of Artificial Intelligence (AI)-based classification techniques to provide adaptive streaming in MANETs. For this, a software-driven architecture is proposed to route stream in offline MANETs, predicting the stability of individual links and compressing video frames accordingly. The proposal is implemented and assessed in a laboratory context, in which the model performance and QoS metrics are analyzed. As a result, the model is implemented in a decision forest algorithm, which provides 95.9% accuracy. Also, the obtained latency values become assumable for video streaming, manifesting a reliable response for routing and node movements. [ABSTRACT FROM AUTHOR]

Mobile Ad Hoc Network consists of group of nodes in specific region. Every node has to rely on subsequent nodes to send the packets[10]. Certain nodes deny to forward packets. Vineyard is the only tree where pruning is done for the growth. In other type of trees pruning is not done. Pruning is to cut the dead branches. To cut or lop superfluous or undesired twigs, branches or roots from like trim. During the pruning season things are made ready. Dead wood is removed; unproductive sucker growth is tossed in to the fire. Similarly in Mobile Ad hoc Networks if any node is selfish node not synchronizing with other nodes and not responding to passing the packets through it. The leader has to remove the deadly node called selfish node like pruning. The most extensible application of Geographical addressing is via a Geocast protocol[11], where nodes selectively rebroadcast packets based on regional consensus guidelines. Classy excommunication heuristics harvest extensible Geographic flooding that outplays deputy geo addressing methodologies. However, previous Geocast Routing applications, while effective, fall into two categories. Methodologies based on flooding are in extensible due to the high load they attain. Extensible approaches, on the other hand, have exertion in complex environments, lacking sufficient intelligence about the necessary directionality of packet flow[14]. The present paper defines a contemporary Vineyard Geocast Routing heuristic, which both significantly improves on reliability of prevailing extensible Geocast Routings and yet also remains extensible as design complexity increases. [ABSTRACT FROM AUTHOR]

Nowadays, Mobile Ad hoc Network (MANET) gains more attraction due to its seamless and dynamic use. The existing methods in MANET are plagued by some weaknesses, like higher computation time, undermining their real-time responsiveness. Whereas, lower accuracy in intrusion detection compromises the reliability of these systems, potentially leading to missed threats posing a challenge for effective security measures in dynamic MANET environments. To mitigate these weaknesses, an Auto Metric Graph Neural Network optimized with Woodpecker Mating Algorithm is proposed in this paper for detecting Network Layer Attack in MANET (AGNN-WMA-DNLA-MANET). Initially, the data are gathered from CIC-IDS 2019 dataset. The gathered data undergoes pre-processing to eliminate redundancy and missing values replacement using the Local Least Squares method. Afterward, the preprocessing output is fed to AGNN for classification, which classifies the attack as active, passive, or normal. Then, Woodpecker Mating Algorithm (WMA) is proposed to optimize the AGNN weight parameters to ensure the accurate classification. The proposed technique is executed in NS2 tool. The metrics, like accuracy, false positive rate (FPR) and attack detection rate (ADR), computation time, and RoC is analyzed. The proposed AGNN-WMA-DNLA-MANET approach provides 14.68%, 7.142%, and 4.65% higher accuracy for active attack, 15.19%, 2.77%, and 9.85% higher accuracy for passive attack and 38.18%, 12.02%, and 7.59% better accuracy for normal compared with existing methods, such as Dependable intrusion detection scheme under deep convolutional neural network (DCNN-MANET), deep learning-based intrusion detection scheme for MANET (AE-DNN-MANET), and Benchmarking of machine learning for anomaly based intrusion detection scheme (ML-MANET), respectively. [ABSTRACT FROM AUTHOR]

Mobile Ad Hoc Networks (MANETs) are self-organizing, self-configuring, and infrastructure-less networks for performing multi-hop communication. The source mobile node can transmit the information to any other destination node, but it has limitations with energy consumption and battery lifetime. Since it appeals to a huge environment, there is a probability of obstacle present. Thus, the network requires finding the obstacles to evade performance degradation and also enhance the routing efficiency. To achieve this, an obstacle-aware efficient routing using a heuristic-based deep learning model is proposed in this paper. Firstly, the nodes in the MANET are employed for initiating the transmission. Further, it is needed to be predicted whether the node is malicious or not. Consequently, the prediction for link connection between the nodes is achieved by the Optimized Bi-directional Long-Short Term Memory (OBi-LSTM), where the hyperparameters are tuned by the Adaptive Horse Herd Optimization (AHHO) algorithm. Secondly, once the links are secured from the obstacle, it is undergone for routing purpose. Routing is generally used to transmit data or packets from one place to another. To attain better routing, various objective constraints like delay, distance, path availability, transmission power, and several interferences are used for deriving a multi-objective function, in which the optimal path is obtained through the AHHO algorithm. Finally, the simulation results of the proposed model ensure to yield efficient multipath routing by accurately identifying the intruder present in the network. Thus, the proposed model aims to reduce the objectives like delay, distance, and power consumption. [ABSTRACT FROM AUTHOR]

Contemporary airborne radio networks are usually implemented using omnidirectional antennas. Unfortunately, such networks suffer from disadvantages such as easy detection by hostile aircraft and potential information leakage. In this paper, we present a novel mobile ad hoc network (MANET) routing protocol based on directional antennas and situation awareness data that utilizes adaptive multihop routing to avoid sending information in directions where hostile nodes are present. Our protocol is implemented in the OMNEST simulator and evaluated using two realistic flight scenarios involving 8 and 24 aircraft, respectively. The results show that our protocol has significantly fewer leaked packets than comparative protocols, but at a slightly higher cost in terms of longer packet lifetime. [ABSTRACT FROM AUTHOR]

In this paper, we explore the throughput–delay tradeoff in a mobile ad hoc network (MANET) operating under the practical reference point group mobility model and also a general setting of node moving speed. In particular, we consider a MANET with unit area and n nodes being divided evenly into \Theta(n^{\alpha}) groups, \alpha\in[0,1] , where the center of each group moves according to a random direction model with speed of no more than \upsilon\in[0,1] . We determine the regions of per-node throughput and average delay and their tradeoffs that can be achieved (in order sense) in such a network. For the regime of \upsilon=0, we first prove that the per-node throughput capacity is and then develop a routing scheme to achieve this capacity, resulting in an average delay of \Theta(\max\n^1/2,n^1-\alpha\) for any \alpha\in[0,1]. Regarding the regime of \upsilon>0, we prove that the per-node throughput capacity can be improved to \Theta(1) , which is achievable by adopting a new routing scheme with an average delay of \Theta(\max\n^1-\alpha,n^\alpha/2/\upsilon\) for \upsilon=o(1) and $\Theta(n)$ for $\upsilon=\Theta(1) $. The results in this paper help us to have a deep understanding on the fundamental performance scaling laws and also enable an efficient throughput–delay tradeoff to be achieved in MANETs with correlated mobility. [ABSTRACT FROM PUBLISHER]

ABSTRACT This paper develops a framework to simulate and evaluate pricing policies of spacecraft trading commodities, such as data routing, in a federated satellite network. Federated satellite systems allow the reallocation of underutilized assets, enabling their use as services between owners and third parties. The paper, by means of game theory, focuses on sealed-bid reverse auction pricing schemes, benchmarks first-price and second-price auction strategies, and evaluates the associated trade-offs in terms of performance and cost, and losses in Pareto efficiency introduced by system-level operation constraints. The analysis considers an application case study for federated satellite systems operating in Low Earth Orbit for commercial purposes. Satellite federations are a novel paradigm envisioning on-orbit opportunistic sharing of resources through an ad hoc mobile satellite network. The architecture creates the basis for the realization of a commercial cloud computing environment in orbit, with spacecraft establishing communications links between each other leveraging on system design margins. The results of the case study in space provide new insights on the design of federated satellites and their operations while characterizing emergent behaviors and efficient trade-offs on the Pareto front of the cost-performance curve. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANETs) are self-configuring networks of wireless nodes, i.e., mobile devices. Since communications in MANETs occur via wireless channels, it is of significance to secure communications among wireless and mobile nodes. Group key management, as a widely used method for securing group communications, has potentially been used in MANETs for years. Most recently, a secure receiver-unrestricted group key management scheme for MANETs has been proposed, which is used to establish a secure channel among a group of wireless nodes without a trusted dealer, which has some advantages such as eliminating the certificate management problem and receiver restriction. However, a formal security analysis of this scheme is still lacking. Therefore, in this paper, we propose the complete security proof to demonstrate that the scheme satisfies the essential security properties including authentication, message confidentiality, known-key security and dynamic secrecy. We also give a brief discussion about the efficiency of the scheme. [ABSTRACT FROM AUTHOR]

Publish/subscribe is a mature communication paradigm to route and deliver events from publishers to interested subscribers. Initially conceived for large scale systems, e.g., the Internet, it has been used more recently in new scenarios, e.g., wireless sensor networks and the Internet of Things (IoT), where mobility and dynamicity are the norm. The loose-coupling and asynchronicity of publish/subscribe makes it an interesting choice for IoT scenarios, i.e., each node in an IoT network can choose a different role depending on its location, capabilities, etc. This paper presents MFT-PubSub, a fully mobile and fault tolerant content-based publish/subscribe protocol. Our proposal is a purely reactive solution for mobility in a publish/subscribe system without any kind of limits on the mobility patterns of the nodes. A wireless ad hoc network is created without the need of any previous connections or knowledge on the nodes. Handling the mobility, be it physical or logical, of both clients and brokers. We prove the validity of our solution by experimentation, and compare it with AODV, a routing protocol for mobile ad hoc networking. The simulations show an improvement on message delivery rate over previously used protocols. [ABSTRACT FROM AUTHOR]

In modern warfare, achieving strikes against military targets commonly involves utilizing methods such as fire coverage and missile precision guidance. While effective, fire coverage requires significant ammunition support, and missiles can be costly. Therefore, an intelligent strike solution can be an effective way to address these challenges. The inter-cannonball wireless communication network provides a solid foundation for inter-cannonball networking and joint strikes. The synergy improves the strike's range and precision, ensuring own safety and destroying the enemy's core with success. In this paper, the reliability of inter-cannonball group communication is studied. The vast array of activities and short striking distance of cannonballs make wireless networking between cannonballs a technological challenge. For this unique communication environment, the network of cannonballs is discussed, the self-organizing structure model of the network is proposed, the corresponding node topology is established, the protocol framework of inter-cannonball communication is presented, and the simulation parameters of the communication network are set. On this premise, discrete event simulation is performed by using the OPNET program to validate the impact of failure rate and node movement speed on the inter-cannonball network communication reliability. And the main performance indices of the inter-cannonball communication system are derived. The simulation results indicate that it can maintain basic communication stability, with wireless LAN delays of less than 100 ms, even when the node failure rate reaches 20%. The simulation verification method, on the other hand, overcomes the limitations of the real environment, optimizes the design phase, reduces research costs, and accelerates the development of intelligent cannonballs. [ABSTRACT FROM AUTHOR]

Summary: One of the infrastructure‐free networks is mobile ad hoc networks (MANETs) that are built with limited battery life using wireless mobile devices. This restricted battery capability in MANETs creates the necessity of considering the energy‐awareness constraint in designing them. As routing protocols, the major aim of MANETs is to create the energy awareness in the network; it improves the network's lifetime through effectively utilizing the available restricted energy. Moreover, it creates some limitations like the mobility constraint, wireless link's sensitivity to environmental impacts, and restricted transmission range and residual energy of nodes that causes rapid modifications in the network topology and frequent link failure. By taking those problems, this paper plans to develop a new multipath routing protocol, where the hybrid optimization algorithm with the integration of cuckoo search optimization (CSO) and butterfly optimization algorithm (BOA) is proposed and named sensory modality‐based cuckoo search butterfly optimization (SM‐CSBO) for determining the optimal path between the source and destination. The main goal is to select the path with better link quality and more stable links to guarantee reliable data transmission. The multi‐objective function is considered with the factors regarding distance, normalized energy, packet delivery ratio, and control overhead to develop an effective routing protocol in MANET. The proposed model of SM‐CSBO algorithm has superior than 5.8%, 30.4%, 36.7%, and 39.3%, correspondingly maximized than PSO, SFO, CSO, and SFO algorithms while considering the number of nodes as 150. The simulation outcomes proved that it enhances network performance when compared with the other traditional protocols. [ABSTRACT FROM AUTHOR]

As Vehicular Ad hoc Network (VANET) features random topology and accommodates freely connected nodes, it is important that the cooperation among the nodes exists. This paper proposes a trust model called Implicit Web of Trust in VANET (IWOT-V) to reason out the trustworthiness of vehicles. Such that untrusted nodes can be identified and avoided when we make a decision regarding whom to follow or cooperate with. Furthermore, the performance of Cooperative Intelligent Transport System (C-ITS) applications improves. The idea of IWOT-V is mainly inspired by web page ranking algorithms such as PageRank. Although there does not exist explicit link structure in VANET because of random topology and dynamic connections, social trust relationship among vehicles exists and an implicit web of trust can be derived. To accomplish the derivation, two algorithms are presented, i.e., BayesTrust and VehicleRank. They are responsible for deriving the local and global trust relationships, respectively. The simulation results show that IWOT-V can accurately identify trusted and untrusted nodes if enough local trust information is collected. The performance of IWOT-V affected by five threat models is demonstrated, and the related discussions are also given. [ABSTRACT FROM AUTHOR]

In this paper, we consider a scenario where nodes in a MANET disseminate data chunks using rateless codes. Any node is able to successfully decode any chunk by collecting enough coded blocks from several other nodes without any coordination. We consider the problem of identifying malicious nodes that launch a pollution attack by deliberately modifying the payload of coded blocks before transmitting. It follows that the original chunk can only be obtained if there are no malicious nodes among the chunk providers. In this paper we propose SIEVE, a fully distributed technique to infer the identity of malicious nodes. A node creates what we termed a check whenever a chunk is decoded; a check is a pair composed of the set of other nodes that provided coded blocks used to decode the chunk (the chunk uploaders) and a flag indicating whether the chunk is corrupted or not. SIEVE exploits rateless codes to detect chunk integrity and belief propagation to infer the identity of malicious nodes. In particular, every node autonomously constructs its own bipartite graph (a.k.a. factor graph in the literature) whose vertexes are checks and nodes, respectively. Then, it periodically runs the belief propagation algorithm on its factor graph to infer the probability of other nodes being malicious. We show by running detailed simulations using ns-3 that SIEVE is very accurate and robust under several attack scenarios and deceiving actions. We discuss how the topological properties of the factor graph impacts SIEVE performance and show that nodes speed in the MANET plays a role on the identification accuracy. Furthermore, an interesting trade-off between coding efficiency and SIEVE accuracy, completeness, and reactivity is discovered. We also show that SIEVE is efficient requiring low computational, memory, and communication resources. [ABSTRACT FROM AUTHOR]

Owing to the explosive growth of requirements of rapid emergency communication response and accurate observation services, airborne communication networks (ACNs) have received much attention from both industry and academia. ACNs are subject to heterogeneous networks that are engineered to utilize satellites, high-altitude platforms (HAPs), and low-altitude platforms (LAPs) to build communication access platforms. Compared to terrestrial wireless networks, ACNs are characterized by frequently changed network topologies and more vulnerable communication connections. Furthermore, ACNs have the demand for the seamless integration of heterogeneous networks such that the network quality-of-service (QoS) can be improved. Thus, designing mechanisms and protocols for ACNs poses many challenges. To solve these challenges, extensive research has been conducted. The objective of this special issue is to disseminate the contributions in the field of ACNs. To present this special issue with the necessary background and offer an overall view of this field, three key areas of ACNs are covered. Specifically, this paper covers LAP-based communication networks, HAP-based communication networks, and integrated ACNs. For each area, this paper addresses the particular issues and reviews major mechanisms. This paper also points out future research directions and challenges. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANET) have been subject of an active research for the last decade. As opposed to the wired networks, MANETs have dynamic topology, limited resources, limited bandwidth and are usually deployed in emergency scenarios outside, where landscape plays important role. MANETs are susceptible to insider and outsider attacks and bring new security challenges which were not present in the wired networks due to the individual nodes of MANETs acting like full-fledged routers. Security of the MANETs usually focuses on some key aspect of the networks, i.e. securing routing protocol, IPS (Intrusion Prevention System), trust infrastructure or secured data transfer. Current published works focused on the security lack top-down approach which would go in depth and tried to cover as much of the network as possible. This work deals with the design of a novel approach to secure MANETs by introducing several security mechanisms at the same time to create novel Security Architecture for these networks. In this paper we introduce Architecture comprised of PKI (Public Key Infrastructure), secured routing protocol, firewall and IPS. Tying all those aspects together creates viable security system for MANETs achieving level of security we are aiming for. Part of the paper are performance measurements of the deployed solution. [ABSTRACT FROM AUTHOR]

Wireless ad hoc networks use mobile devices to deliver services supported by high-speed network connections and high-speed data transmissions in real time. These devices (network nodes) typically act as the network infrastructure to forward data to other nodes from a source to the destination. However, several constraints (e.g., processor, energy consumption, and bandwidth) affect the overall network performance. Cooperation strategies have been considered as a solution to such network limitations and constraints. Recent studies have presented cooperation mechanisms as a solution to unstable network infrastructures where mobile nodes cooperate with each other, forwarding data and performing all the networking functionalities. This paper presents a comprehensive review of the state of the art on cooperation strategies and algorithms for mobile ad hoc networks and delay-tolerant networks. These challenged networks frequently comprise situations where traditional Internet protocols fail to effectively provide desired or expected communication. This paper focuses on cooperation incentive-based approaches for network architectures that support mobile devices and are challenged by mobility constraints such as battery and storage capacity, broadcast constraints, interferences, disconnections, noises, limited bandwidths, and network delays. The surveyed approaches' merits and weaknesses are discussed, and open issues are identified. Finally, conclusions are detailed. [ABSTRACT FROM PUBLISHER]

Summary: Opportunistic ad hoc networks (OppNets) are characterized by intermittent and infrastructure‐less connectivity among mobile nodes with limited internode communication and buffer space. Without persistent end‐to‐end routing information, replication‐based routing techniques are often used to distribute duplicate messages in OppNets, which unfortunately leads to enormous costs of transmission, storage, and energy resources. Prior replication‐based routing schemes were mainly based on several premises, for example, the availability of global network knowledge, unlimited bandwidth capacity, and homogeneous contact patterns. In this paper, we propose a quota‐based routing scheme with finite buffer management, named QRBP, regardless of these weak premises. The QRBP scheme comprises two essential functions. First, only a portion of nodes with higher mobility are delegated to carry a certain quota of message replicas and disseminate those messages to nodes with lower mobility. The message traffic can be evenly diverted to relay nodes, which reduces the transmission overhead in the network. Second, nodes can manipulate message scheduling and dropping to improve the successful delivery rate according to heuristic strategies based on several measures of the quota value, remaining time‐to‐live, and contact rate with the destination. Furthermore, our study conducts extensive simulations under both synthetic and real mobility scenarios. In terms of transmission overhead ratio and successful delivery rate, the QRBP scheme performs better than Epidemic, Spray and Wait, and Temporal Closeness and Centrality‐Based (TCCB) routing schemes, as well as common buffer management policies like Drop Oldest, Drop Newest, Drop Random, and Space‐Time Drop. [ABSTRACT FROM AUTHOR]

Elements in massive narrowband Internet of Things (NB-IoT) for 5G networks suffer severely from packet drops due to queue overflow. Active Queue Management (AQM) techniques help in maintaining queue length by dropping packets early, based on certain defined parameters. In this paper, we have proposed an AQM technique, called Aggressive Random Early Detection (AgRED) which, in comparison to previously used Random Early Detection (RED) and exponential RED technique, improves the overall end-to-end delay, throughput, and packet delivery ratio of the massive NB-IoT 5G network while using UDP. This improvement has been achieved due to a sigmoid function used by the AgRED technique, which aggressively and randomly drops the incoming packets preventing them from filling the queue. Because of the incorporation of the AgRED technique, the queue at different nodes will remain available throughout the operation of the network and the probability of delivering the packets will increase. We have analyzed and compared the performance of our proposed AgRED technique and have found that the performance gain for the proposed technique is higher than other techniques (RED and exponential RED) and passive queue management techniques (drop-tail and drop-head). The improvement in results is most significant in congested network deployment scenarios and provides improvements in massive Machine Type Communication, while also supporting ultra-low latency and reliable communication for 5G applications. [ABSTRACT FROM AUTHOR]

Security in vehicular ad hoc network (VANET) is one of the major challenging topics and the secure key interchange between two legitimate vehicles is an important issue. The multi-environment of VANET has been exploited to extract the secret key and employed security services in VANET. However, it offered more excellence randomness owed to fading, noise multi-path, and velocity difference. Some of the factors like Bit-rate, complication and memory requests are reduced by using a process known as quantization. This paper proposes a new quantization method to extract the secret key for vehicular communications that uses a lossy quantizer in combination with information reconciliation and privacy amplification. Our work focuses on the quantization phase for the secret generation procedure. The comprehensive simulations display the propose method increases the zone and number of the quantization levels to utilize the maximum number of measurements to reduce reasonably the wasted measurements. [ABSTRACT FROM AUTHOR]

Integration of Mobile Ad hoc NETworks (MANETs) with the Internet has been paid immense attention in the field of heterogeneous networks. In MANET some intermediate nodes called Internet Gateways (IGs) are responsible for sending the data traffic of source nodes towards the fixed nodes in the Internet. The key issue considered while selecting IG nodes is its optimised throughput with the reduced delay in resource constraint mobile nodes. In this paper, a genetic algorithm inspired Delay Sensitive Gateway Selection (DSGS) scheme is proposed considering the issue of network delay by minimising the total distance travelled by the source nodes to the gateway. The performance of the proposed GA-based DSGS scheme is studied using a comparative approach. The simulation results demonstrate that the proposed scheme significantly outperforms the conventional schemes and is capable of achieving higher network throughput while minimising the end-to-end delay. [ABSTRACT FROM AUTHOR]

Drones have attracted extensive attention for their environmental, civil, and military applications. Because of their low cost and flexibility in deployment, drones with communication capabilities are expected to play key important roles in Fifth Generation (5G), Sixth Generation (6G) mobile networks, and beyond. 6G and 5G are intended to be a full-coverage network capable of providing ubiquitous connections for space, air, ground, and underwater applications. Drones can provide airborne communication in a variety of cases, including as Aerial Base Stations (ABSs) for ground users, relays to link isolated nodes, and mobile users in wireless networks. However, variables such as the drone's free-space propagation behavior at high altitudes and its exposure to antenna sidelobes can contribute to radio environment alterations. These differences may render existing mobility models and techniques as inefficient for connected drone applications. Therefore, drone connections may experience significant issues due to limited power, packet loss, high network congestion, and/or high movement speeds. More issues, such as frequent handovers, may emerge due to erroneous transmissions from limited coverage areas in drone networks. Therefore, the deployments of drones in future mobile networks, including 5G and 6G networks, will face a critical technical issue related to mobility and handover processes due to the main differences in drones' characterizations. Therefore, drone networks require more efficient mobility and handover techniques to continuously maintain stable and reliable connection. More advanced mobility techniques and system reconfiguration are essential, in addition to an alternative framework to handle data transmission. This paper reviews numerous studies on handover management for connected drones in mobile communication networks. The work contributes to providing a more focused review of drone networks, mobility management for drones, and related works in the literature. The main challenges facing the implementation of connected drones are highlighted, especially those related to mobility management, in more detail. The analysis and discussion of this study indicates that, by adopting intelligent handover schemes that utilizing machine learning, deep learning, and automatic robust processes, the handover problems and related issues can be reduced significantly as compared to traditional techniques. [ABSTRACT FROM AUTHOR]