Using Game Theory to Motivate Trust in Ad Hoc Vehicular Networks

2019 ◽  
pp. 61-84 ◽  
Author(s):  
Josephina Antoniou
Keyword(s):  
Game Theory ◽  
Vehicular Networks ◽  
Ad Hoc

scholarly journals Evolutionary Game Theory-Based Collaborative Sensing Model in Emergency CRAHNs

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Sasirekha GVK ◽  
Jyotsna Bapat
Keyword(s):  
Game Theory ◽  
Cognitive Radio ◽  
Spectrum Sensing ◽  
Evolutionary Game Theory ◽  
Ad Hoc ◽  
Evolutionary Game ◽  
Autonomous Systems ◽  
Simulation Models ◽  
Signal To Noise ◽  
Collaborative Spectrum Sensing

Game theory has been a tool of choice for modeling dynamic interactions between autonomous systems. Cognitive radio ad hoc networks (CRAHNs) constituted of autonomous wireless nodes are a natural fit for game theory-based modeling. The game theory-based model is particularly suitable for “collaborative spectrum sensing” where each cognitive radio senses the spectrum and shares the results with other nodes such that the targeted sensing accuracy is achieved. Spectrum sensing in CRAHNs, especially when used in emergency scenarios such as disaster management and military applications, needs to be not only accurate and resource efficient, but also adaptive to the changing number of users as well as signal-to-noise ratios. In addition, spectrum sensing mechanism must also be proactive, fair, and tolerant to security attacks. Existing work in collaborative spectrum sensing has mostly been confined to resource efficiency in static systems using request-based reactive sensing resulting in high latencies. In this paper, evolutionary game theory (EGT) is used to model the behavior of the emergency CRAHNS, providing an efficient model for collaborative spectrum sensing. The resulting implementation model is adaptive to the changes in its environment such as signal-to-noise ratio and number of users in the network. The analytical and simulation models presented validate the system design and the desired performance.

scholarly journals A Cooperative Communication Protocol for QoS Provisioning in IEEE 802.11p/Wave Vehicular Networks

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3622 ◽  
Author(s):  
Jin-Woo Kim ◽  
Jae-Wan Kim ◽  
Dong-Keun Jeon
Keyword(s):  
Cooperative Communication ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Communication Protocol ◽  
Ieee 802.11P ◽  
The Road ◽  
Free Data ◽  
On The Road ◽  
Hoc Networks

Vehicular ad hoc networks (VANETs) provide information and entertainment to drivers for safe and enjoyable driving. Wireless Access in Vehicular Environments (WAVE) is designed for VANETs to provide services efficiently. In particular, infotainment services are crucial to leverage market penetration and deployment costs of the WAVE standard. However, a low presence of infrastructure results in a shadow zone on the road and a link disconnection. The link disconnection is an obstacle to providing safety and infotainment services and becomes an obstacle to the deployment of the WAVE standard. In this paper, we propose a cooperative communication protocol to reduce performance degradation due to frequent link disconnection in the road environment. The proposed protocol provides contention-free data delivery by the coordination of roadside units (RSUs) and can provide the network QoS. The proposed protocol is shown to enhance throughput and delay through the simulation.

Vehicular Cloud Computing

2014 ◽  
pp. 262-274 ◽  
Author(s):  
Kayhan Zrar Ghafoor ◽  
Marwan Aziz Mohammed ◽  
Kamalrulnizam Abu Bakar ◽  
Ali Safa Sadiq ◽  
Jaime Lloret
Keyword(s):  
Cloud Computing ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Vehicular Cloud Computing ◽  
Vehicular Cloud ◽  
Performance Improvements ◽  
Potential Applications ◽  
Research Outcome ◽  
Hoc Networks

Recently, Vehicular Ad Hoc Networks (VANET) have attracted the attention of research communities, leading car manufacturers, and governments due to their potential applications and specific characteristics. Their research outcome was started with awareness between vehicles for collision avoidance and Internet access and then expanded to vehicular multimedia communications. Moreover, vehicles’ high computation, communication, and storage resources set a ground for vehicular networks to deploy these applications in the near future. Nevertheless, on-board resources in vehicles are mostly underutilized. Vehicular Cloud Computing (VCC) is developed to utilize the VANET resources efficiently and provide subscribers safe infotainment services. In this chapter, the authors perform a survey of state-of-the-art vehicular cloud computing as well as the existing techniques that utilize cloud computing for performance improvements in VANET. The authors then classify the VCC based on the applications, service types, and vehicular cloud organization. They present the detail for each VCC application and formation. Lastly, the authors discuss the open issues and research directions related to VANET cloud computing.

Privacy Protection in Vehicular Ad-Hoc Networks

2014 ◽  
pp. 295-332
Author(s):  
Gongjun Yan ◽  
Danda B. Rawat ◽  
Bhed Bahadur Bista ◽  
Wu He ◽  
Awny Alnusair
Keyword(s):  
Privacy Protection ◽  
Capacity Planning ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Geographic Area ◽  
Time Varying ◽  
Detailed Simulation ◽  
A Cell ◽  
Hoc Networks

The first main contribution of this chapter is to take a non-trivial step towards providing a robust and scalable solution to privacy protection in vehicular networks. To promote scalability and robustness the authors employ two strategies. First, they view vehicular networks as consisting of non-overlapping subnetworks, each local to a geographic area referred to as a cell. Each cell has a server that maintains a list of pseudonyms that are valid for use in the cell. Each pseudonym has two components: the cell’s ID and a random number as host ID. Instead of issuing pseudonyms to vehicles proactively (as virtually all existing schemes do) the authors issue pseudonyms only to those vehicles that request them. This strategy is suggested by the fact that, in a typical scenario, only a fraction of the vehicles in an area will engage in communication with other vehicles and/or with the infrastructure and, therefore, do not need pseudonyms. The second main contribution is to model analytically the time-varying request for pseudonyms in a given cell. This is important for capacity planning purposes since it allows system managers to predict, by taking into account the time-varying attributes of the traffic, the probability that a given number of pseudonyms will be required at a certain time as well as the expected number of pseudonyms in use in a cell at a certain time. Empirical results obtained by detailed simulation confirm the accuracy of the authors’ analytical predictions.

Geographical Zone based Cluster Head for Routing in Sparse Vehicular Networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1910
Author(s):  
R Brendha ◽  
V Sinthu Janita Prakash
Keyword(s):  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Algorithm Design ◽  
Cluster Head ◽  
Communication Overhead ◽  
Node Density ◽  
Urban Network ◽  
Sparse Network

Vehicular ad hoc network is a wireless communication technology that is used to provide safety and comfort transport on the roads. Routing algorithm design is one of the main challenging issues in VANET. This paper presents a Geographical Zone Based Cluster Head algorithm for Vehicular Ad hoc Networks (VANETs) to reduce the communication overhead generated by the Control Packets (CP). Depending on the area, the network can be sparsely or fully connected. The Geographical Zone Based Cluster Head Routing in Sparse network (GZCHRS) algorithm can endure network partition due to low node density in the sparse network and high node density in the urban network. This paper inspects the issues of VANETs in sparse networks. In this algorithm, the routing decision is based on vehicular density, velocity and link lifetime. The simulation results display that under rural network conditions, the Geographical Zone Based Cluster Head Routing algorithm performs well when compared to Light Weight Intersection based Traffic Aware Routing (LITAR) and Intersection-based Connectivity Aware Routing (ICAR).  

scholarly journals Context-aware Gossip in Ad hoc Vehicular Networks

2019 ◽  
Vol 160 ◽  
pp. 157-164
Author(s):  
Ahmad Bennakhi ◽  
Abdulhusain Ben Nakhi ◽  
Abdullah Marafi
Keyword(s):  
Vehicular Networks ◽  
Ad Hoc ◽  
Context Aware

Mitigate DoS and DDoS Attack in Mobile Ad Hoc Networks

2011 ◽  
Vol 3 (1) ◽  
pp. 14-36 ◽  
Author(s):  
Antonis Michalas ◽  
Nikos Komninos ◽  
Neeli R. Prasad
Keyword(s):  
Game Theory ◽  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Ddos Attacks ◽  
Dos Attacks ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Cryptographic Puzzles

This paper proposes a technique to defeat Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks in Ad Hoc Networks. The technique is divided into two main parts and with game theory and cryptographic puzzles. Introduced first is a new client puzzle to prevent DoS attacks in such networks. The second part presents a multiplayer game that takes place between the nodes of an ad hoc network and based on fundamental principles of game theory. By combining computational problems with puzzles, improvement occurs in the efficiency and latency of the communicating nodes and resistance in DoS and DDoS attacks. Experimental results show the effectiveness of the approach for devices with limited resources and for environments like ad hoc networks where nodes must exchange information quickly.

Model of Intrusion Detection Based on the Game Theory

2013 ◽  
Vol 347-350 ◽  
pp. 3971-3974 ◽  
Author(s):  
Heng Xiao ◽  
Cao Fang Long
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Network Security ◽  
Intrusion Detection ◽  
Working Group ◽  
Ad Hoc ◽  
Game Model ◽  
The Game Theory ◽  
Network Application ◽  
Stage Game

With the development of network application, network security is facing greater pressure. Based on the characteristics of intrusion detection in the wireless network of the Ad hoc working group, the article introduces the game theory, proposes a game model of network security, concluds the Nash equilibrium in the stage game, repeats game, the pareto Nash equilibrium, more attack both income and payment, so that they get the best choice.

scholarly journals Sharing with Caution: Managing Parking Spaces in Vehicular Networks

2013 ◽  
Vol 9 (1) ◽  
pp. 69-98 ◽  
Author(s):  
Thierry Delot ◽  
Sergio Ilarri ◽  
Sylvain Lecomte ◽  
Nicolas Cenerario
Keyword(s):  
Ad Hoc Network ◽  
Vehicular Networks ◽  
Ad Hoc ◽  
Vehicular Ad Hoc Network ◽  
Parking Space

By exchanging events in a vehicular ad hoc network (VANET), drivers can receive interesting information while driving. For example, they can be informed of available parking spaces in their vicinity. A suitable protocol is needed to disseminate the events efficiently within the area where they are relevant. Moreover, in such a competitive context where each vehicle may be interested in a resource, it is crucial not to communicate that resource to each driver in the vicinity. Otherwise, those drivers would waste time trying to reach a parking space and only one of them would be fulfilled, which would lead to a poor satisfaction in the system.

Sign in / Sign up

Export Citation Format

Share Document