Decentralized content sharing in mobile ad-hoc networks:A survey

The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.

Multi-Agent Deep Reinforcement Learning for Cross-Layer Scheduling in Mobile Ad-Hoc Networks

Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.

Dynamic Event-Triggered Scheduling and Platooning Control Co-Design for Automated Vehicles Over Vehicular Ad-Hoc Networks

This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.

A Self-Adaptive Back-off Optimization Scheme Based on Beacons Probability Prediction for Vehicle Ad-Hoc Networks

In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion, a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold. Simulations were done to compare the performance of CEB with that of RBEB and BEB, and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.

Power Allocation for Cooperative Communications in Non-Orthogonal Cognitive Radio Vehicular Ad-Hoc Networks

To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to the main system in a controllable range.We propose a three-slot one-way vehicle system model where the mobile vehicle nodes complete information interaction with the assistance of other independent nodes by borrowing the unused radio spectrum with the primary networks.The end-to-end SNR relationship in overlay and underlay cognitive communication system mode are analyzed by using two forwarding protocol,namely,decode-and-forward(DF)protocol and amplify-and-forward(AF)protocol,respectively.The system outage probability is derived and the optimal power allocation factor is obtained via seeking the minimum value of the approximation of system outage probability.The analytical results have been confirmed by means of Monte Carlo simulations.Simulation results show that the proposed system performance in terms of outage under the optimal power allocation is superior to that under the average power allocation,and is also better than that under other power allocation systems.

Collision Avoidance in Mobile Wireless Ad-Hoc Networks with Enhanced MACAW Protocol Suite

Jamming attack is quite serious threat for Mobile networks that collapses all necessary communication infrastructure. Since mobile nodes in Mobile Ad Hoc Networks (MANET) communicate in a multi-hop mode, there is always a possibility for an intruder to launch a jamming attack in order to intercept communication among communication nodes. In this study, a network simulation has been carried out in order to explore and evaluate the possible impacts of jamming attack on MACAW protocol. Ad-hoc network modelling is used to provide communication infrastructure among mobile nodes in order to modelling the simulation scenarios. In simulation model, these nodes have used AODV routing protocol which is designed for MANET while second scenario contains simulated MACAW node models for comparison. On the other hand, this paper is the first study that addresses performance evaluation of MACAW protocol under a constant Jamming Attack. The performance of MACAW protocol is simulated through OPNET Modeler 14.5 software.

Fair rate control for wireless ad-hoc networks with time varying channel capacities

We consider the problem of fair rate control for wireless ad-hoc networks with time varying channel capacities. The interaction between links in wireless ad-hoc networks introduces additional constraints on the flow rate. A primal-dual algorithm that guarantees fair rate control is proved to be trajectory stable. Various fairness indexes are obtained by choosing the specified form of the utility functions, and the numerical results validate the effectiveness of the proposed algorithm.

Cognitive Radio Ad-Hoc Networks: Some New Results on Multi-Channel Hidden Terminal Problem

Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient and intelligent way;studies indicate that opportunistic utilization of the available radio frequency spectrum, without interfering the licensed primary user (PU) could be made. This paper presents some simulation based performance of the Multi-Channel Hidden Terminal (MCHT) problem on CRAHNs;new observations on the effect of the number of channels on certain PU-activity metrics, e.g., delay and throughput, are described.

Dynamic Vehicular Clustering Enhancing Video on Demand Services Over Vehicular Ad-hoc Networks

Nowadays,video streaming applications are becoming one of the tendencies driving vehicular network users.In this work,considering the unpredictable vehicle density,the unexpected acceleration or deceleration of the different vehicles included in the vehicular traffic load,and the limited radio range of the employed communication scheme,we introduce the“Dynamic Vehicular Clustering”(DVC)algorithm as a new scheme for video streaming systems over vehicular ad-hoc networks(VANET).The proposed algorithm takes advantage of the small cells concept and the introduction of wireless backhauls,inspired by the different features and the performance of the Long Term Evolution(LTE)-Advanced network.Vehicles are clustered together to form dynamically ad-hoc sub-networks included in the vehicular network.The goal of our clustering algorithm is to take into account several characteristics,such as the vehicle’s position and acceleration to reduce latency and packet loss.Therefore,each cluster is counted as a small cell containing vehicular nodes and an access point that is elected regarding some particular specifications.Based on the exceptional features of the LTE-Advanced network(small cells and wireless backhauls)the DVC algorithm is a promising scheme for video streaming services over VANET systems.Experiments were carried out with a virtual topology of the VANET network created with four clusters to implement the DVC algorithm.The results were compared with other algorithms such as Virtual Trust-ability Data transmission(VTD),Named Data Networking(NDN),and Socially Aware Security Message Forwarding(SASMF).Our algorithm can effectively improve the transmission rate of data packets at the expense of a slight increase in end-to-end delay and control overhead.

Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad-Hoc Networks

This paper comes up with a SDN Based Vehicle Ad-Hoc On-Demand Routing Protocol(SVAO),which separates the data forwarding layer and network control layer,as in software defined networking(SDN),to enhance data transmission efficiency within vehicle ad-hoc networks(VANETs).The roadside service unit plays the role of local controller and is in charge of selecting vehicles to forward packets within a road segment.All the vehicles state in the road.Correspondingly,a two-level design is used.The global level is distributed and adopts a ranked query scheme to collect vehicle information and determine the road segments along which a message should be forwarded.On the other hand,the local level is in charge of selecting forwarding vehicles in each road segment determined by the global level.We implement two routing algorithms of SVAO,and compare their performance in our simulation.We compare SVAO with popular ad-hoc network routing protocols,including Optimized Link State Routing(OLSR),Dynamic Source Routing(DSR),Destination Sequence Distance Vector(DSDV),and distance-based routing protocol(DB)via simulations.We consider the impact of vehicle density,speed on data transmission rate and average packet delay.The simulation results show that SVAO performs better than the others in large-scale networks or with high vehicle speeds.

Vehicle Positioning Method Based on RFID in Vehicular Ad-Hoc Networks

With the rapid development of vehicular ad hoc network( VANET) technology,VANET applications such as safe driving and emergency rescue demand high position accuracy,but traditional GPS is difficult to meet new accuracy requirements. To overcome this limitation,a new vehicle positioning method based on radio frequency identification( RFID) is proposed. First RFID base stations are divided into three categories using fuzzy technology,and then Chan algorithm is used to calculate three vehicles' positions,which are weighed to acquire vehicles' accurate position. This method can effectively overcome the problem that vehicle positioning accuracy is not high resulting from the factors such as ambient noise and base distribution when Chan algorithm is used. Experimental results show that the performance of the proposed method is superior to Chan algorithm and 2-step algorithm based on averaging method,which can satisfy the requirements of vehicle positioning in VANETs.

Intrusion Detection Systems in Internet of Things and Mobile Ad-Hoc Networks

Internet of Things(IoT)devices work mainly in wireless mediums;requiring different Intrusion Detection System(IDS)kind of solutions to leverage 802.11 header information for intrusion detection.Wireless-specific traffic features with high information gain are primarily found in data link layers rather than application layers in wired networks.This survey investigates some of the complexities and challenges in deploying wireless IDS in terms of data collection methods,IDS techniques,IDS placement strategies,and traffic data analysis techniques.This paper’s main finding highlights the lack of available network traces for training modern machine-learning models against IoT specific intrusions.Specifically,the Knowledge Discovery in Databases(KDD)Cup dataset is reviewed to highlight the design challenges of wireless intrusion detection based on current data attributes and proposed several guidelines to future-proof following traffic capture methods in the wireless network(WN).The paper starts with a review of various intrusion detection techniques,data collection methods and placement methods.The main goal of this paper is to study the design challenges of deploying intrusion detection system in a wireless environment.Intrusion detection system deployment in a wireless environment is not as straightforward as in the wired network environment due to the architectural complexities.So this paper reviews the traditional wired intrusion detection deployment methods and discusses how these techniques could be adopted into the wireless environment and also highlights the design challenges in the wireless environment.The main wireless environments to look into would be Wireless Sensor Networks(WSN),Mobile Ad Hoc Networks(MANET)and IoT as this are the future trends and a lot of attacks have been targeted into these networks.So it is very crucial to design an IDS specifically to target on the wireless networks.

A Two-Step Authentication Framework in Mobile Ad-Hoc Networks

The lack of fixed infrastructure in ad hoc networks causes nodes to rely more heavily on peer nodes for communication.Nevertheless,establishing trust in such a distributed environment is very difficult, since it is not straightforward for a node to determine if its peer nodes can be trusted.An additional concern in such an environment is with whether a peer node is merely relaying a message or if it is the originator of the message.In this paper,we propose an authentication approach for protecting nodes in mobile ad hoc networks.The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using several authentication protocols are analyzed.Protocols based on zero knowledge and challenge response techniques are presented and their performance is evaluated through analysis and simulation.

Tree-Based Revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.

Effective Life and Area Based Data Storing and Deployment in Vehicular Ad-Hoc Networks

In vehicular ad-hoc networks (VANETs), store-carry-forward approach may be used for data sharing, where moving vehicles carry and exchange data when they go by each other. In this approach, storage resource in a vehicle is generally limited. Therefore, attributes of data that have to be stored in vehicles are an important factor in order to efficiently distribute desired data. In VANETs, there are different types of data which depend on the time and location. Such kind of data cannot be deployed adequately to the requesting vehicles only by popularity-based rule. In this paper, we propose a data distribution method that takes into account the effective life and area in addition to popularity of data. Our extensive simulation results demonstrate drastic improvements on acquisition performance of the time and area specific data.

Dynamic Encryption Technology in Ad-hoc Networks

A new dynamic encryption application in ad-hoc networks is proposed. The advantages of this method are its being able to use the previous ciphertext as a seed of a new encryption process, rendering the encryption process effective in all communication process by continuous dynamic key generation together with synchronization, and its capability to cut back on system bandages to a greater extent, which is valuable for the ad-hoc circumstance. In addition, the rationality and effectiveness of this novel encryption method have been verified by the test results.

Throughput Maximizing Frequency and Power Scheduling for Wireless Ad-Hoc Networks in the Low-SINR Regime

We study the problem of frequency and power allocation and scheduling at a time-slotted cognitive ad-hoc wireless network, where cognitive nodes share a number of frequency bands and frequency reuse is allowed. In such a network the throughput maximization problem generally results in a mixed zero-one nonlinear non-convex problem. Interestingly, in the low-SINR regime, the power allocation policy that maximizes the total throughput follows an “on/off” strategy with maximum power usage in the “on” state. In this paper we show that the on/off strategy in the low-SINR regime is also optimal with respect to throughput when scheduling users over time and frequency subject to minimum SINR requirements. We show that these additional constraints will not change the optimum strategy, but may affect the set of “on” or “off” transmitters. Also we present an approach that transforms the mixed zero-one nonlinear problem to an equivalent mixed zero-one linear problem at the expense of extra variables.

Cluster-based Intrusion Detection in Wireless Ad-Hoc Networks

There are inherent vulnerabilities that are not easily preventable in the mobile Ad-Hoc networks.To build a highly secure wireless Ad-Hoc network,intrusion detection and response techniques need to be deployed;The intrusion detection and cluster-based Ad-Hoc networks has been introduced,then,an architecture for better intrusion detection based on cluster using Data Mining in wireless Ad -Hoc networks has been shown.A statistical anomaly detection approach has been used.The anomaly detection and trace analysis have been done locally in each node and possibly through cooperation with clusterhead detection in the network.

Topology Control for Ad-Hoc Networks: A Comprehensive Review for Table Driven and On-Demand Routing Protocols

Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.

Survivability modeling and analysis on 3D mobile ad-hoc networks

Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.