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.

LSTDA: Link Stability and Transmission Delay Aware Routing Mechanism for Flying Ad-Hoc Network (FANET)

The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face challenges in avoiding transmission loss and delay while ensuring stable communication.The proposed protocol introduces a novel link stability with network corridors priority node selection to check and ensure fair communication in the entire network.The protocol uses a Red-Black(R-B)tree to achieve maximum channel utilization and an advanced relay approach.The paper evaluates LSTDA in terms of End-to-End Delay(E2ED),Packet Delivery Ratio(PDR),Network Lifetime(NLT),and Transmission Loss(TL),and compares it with existing methods such as Link Stability Estimation-based Routing(LEPR),Distributed Priority Tree-based Routing(DPTR),and Delay and Link Stability Aware(DLSA)using MATLAB simulations.The results show that LSTDA outperforms the other protocols,with lower average delay,higher average PDR,longer average NLT,and comparable average TL.

A Collaborative Approach for Secured Routing in Mobile Ad-Hoc Network

Mobile computing is the most powerful application for network com-munication and connectivity,given recent breakthroughs in thefield of wireless networks or Mobile Ad-hoc networks(MANETs).There are several obstacles that effective networks confront and the networks must be able to transport data from one system to another with adequate precision.For most applications,a frame-work must ensure that the retrieved data reflects the transmitted data.Before driv-ing to other nodes,if the frame between the two nodes is deformed in the data-link layer,it must be repaired.Most link-layer protocols immediately disregard the frame and enable the high-layer protocols to transmit it down.In other words,because of asset information must be secured from threats,information is a valu-able resource.In MANETs,some applications necessitate the use of a network method for detecting and blocking these assaults.Building a secure intrusion detection system in the network,which provides security to the nodes and route paths in the network,is a major difficulty in MANET.Attacks on the network can jeopardize security issues discovered by the intrusion detection system engine,which are then blocked by the network’s intrusion prevention engine.By bringing the Secure Intrusion Detection System(S-IDS)into the network,a new technique for implementing security goals and preventing attacks will be developed.The Secure Energy Routing(SER)protocol for MANETs is introduced in this study.The protocol addresses the issue of network security by detecting and preventing attacks in the network.The data transmission in the MANET is forwarded using Elliptical Curve Cryptography(ECC)with an objective to improve the level of security.Network Simulator–2 is used to simulate the network and experiments are compared with existing methods.

Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network

Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.

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.

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.

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.

A reliable and high throughput hybrid routing protocol for vehicular ad-hoc network

Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.

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.

Optimization of Route Repair in Mobile Ad-hoc Network

A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a random mobility model, this paper derives the probability equation of the relative distance (RDIS) between any two mobile hosts in an ad-hoc network. Consequently, combining with average equivalent hop distance (AEHD), a host can estimate the routing hops between itself and any destination host each time the RD/RR procedure is triggered, and reduce the flooding area of RD/RR messages. Simulation results show that this optimized route repair (ORR) algorithm can significantly decrease the communication overhead of RR process by about 35%.

Quantitative and qualitative correlation analysis of optimal route discovery for vehicular ad-hoc networks

Vehicular ad-hoc networks （VANETs） are a significant field in the intelligent transportation system （ITS） for improving road security. The interaction among the vehicles is enclosed under VANETs. Many experiments have been performed in the region of VANET improvement. A familiar challenge that occurs is obtaining various constrained quality of service （QoS） metrics. For resolving this issue, this study obtains a cost design for the vehicle routing issue by focusing on the QoS metrics such as collision, travel cost, awareness, and congestion. The awareness of QoS is fuzzified into a price design that comprises the entire cost of routing. As the genetic algorithm （GA） endures from the most significant challenges such as complexity, unassisted issues in mutation, detecting slow convergence, global maxima, multifaceted features under genetic coding, and better fitting, the currently established lion algorithm （LA） is employed. The computation is analyzed by deploying three well-known studies such as cost analysis, convergence analysis, and complexity investigations. A numerical analysis with quantitative outcome has also been studied based on the obtained correlation analysis among various cost functions. It is found that LA performs better than GA with a reduction in complexity and routing cost.

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.

An Efficient Three-Factor Privacy-Preserving Authentication and Key Agreement Protocol for Vehicular Ad-Hoc Network

As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicles need to be authen-ticated before accessing the network.Most existing authentication protocols in VANET adopt the Trusted Authority(TA)with centralized structure which is re-sponsible for the authentication tasks of all vehicles.However,the large-scale network consume a lot of computing resources,which leads to unacceptable de-lay in message transmission in VANET.For reducing the computational cost of TA,an efficient three-factor privacy-preserving authentication and key agreement protocol was proposed in our paper.Different from before,the RoadSide Unit(RSU)no longer acts as an intermediate node but is responsible for assisting user authentication,which lead to the computational cost of TA is very low.Through formal and informal analysis,our protocol demonstrates excellent security.Com-pared with previous studies,our work emerges advan-tages and superiorities in the following aspects:com-putational cost,communication cost,security proper-ties and functions,message loss ratio,and message de-lay.These data and evidence indicate that our protocol is an ideal choice for large-scale VANET.

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.

Performance Analysis under MAC Layer Misbehavior Attack in Mobile Ad-Hoc Networks

This work presents a multi-criteria analysis of the MAC （media access control） layer misbehavior of the IEEE （Institute of Electrical and Electronics Engineers） 802.11 standard, whose principle is to cheat at the protocol to increase the transmission rate by greedy nodes at the expense of the other honest nodes. In fact, IEEE 802.11 forces nodes for access to the channel to wait for a back off interval, randomly selected from a specified range, before initiating a transmission. Greedy nodes may wait for smaller back-off intervals than honest nodes, and then obtaining an unfair assignment. In the first of our works a state of art on the research on IEEE 802.11 MAC layer misbehavior are presented. Then the impact of this misbehavior at the reception is given, and we will generalize this impact on a large scale. An analysis of the correlation between the throughput and the inter-packets time is given. Afterwards, we will define a new metric for measuring the performance and capability of the network.

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.

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.