Evaluation of the LORA-CBF Routing Algorithm with Selective Gateway in an Ad Hoc WiMAX Network

Author(s):  
Alejandro Galaviz-Mosqueda

Vehicular Ad-Hoc Networks (VANETs) are characterized by their high mobility, where wireless links between vehicles unpredictably can change. This mobility makes it very challenging to establish and maintain a communication link in vehicular networks; therefore, networking in these kinds of networks has become a very intense area of study. Consequently, research of ad hoc routing and medium access control strategies has become an intensive part of current study. The research community has expressed considerable interest in introducing WiMAX as medium access technology and geographic strategies for routing algorithms. This work presents an evaluation of the LORA-CBF geographic routing algorithm that permits seamless communication in an ad-hoc WiMAX network.

Author(s):  
Kashif Naseer Qureshi ◽  
Abdul Hanan Abdullah ◽  
Anwar Mirza ◽  
Raja Waseem Anwar

Vehicular ad hoc networks are new and emerging technology and special class of mobile ad hoc networks that provide wireless communication between vehicles without any fixed infrastructure. Geographical routing has appeared as one of the most scalable and competent routing schemes for vehicular networks. A number of strategies have been proposed for forwarding the packets in geographical direction of the destination, where information of direct neighbors is gained through navigational services. Due to dynamically changing topologies and high mobility neighbor information become outdated. To address these common issues in network different types of forwarding strategies have been proposed. In this review paper, we concentrate on beaconless forwarding methods and their forwarding methods in detail.


Author(s):  
Claudia Campolo ◽  
Hector Agustin Cozzetti ◽  
Antonella Molinaro ◽  
Riccardo Maria Scopigno

Peculiarities of the vehicular environment make the design of the Physical (PHY) and Medium Access Control (MAC) layers for Vehicular Ad-hoc Networks (VANETs) very challenging. Technical solutions should carefully cope with (i) quickly changing network topologies caused by vehicles mobility, (ii) short connection lifetimes, (iii) multi-hop vehicle-to-vehicle communications, (iv) hostile environments for radio signal propagation, and (v) heterogeneous nature and quality requirements of various types of applications. The main aim of this chapter is to serve as an introduction for readers interested in vehicular network design, with a special focus on the MAC layer. It includes a detailed description of the major features and operating principles provided by PHY and MAC layers of the IEEE 802.11p and IEEE 1609 standard suites to support Wireless Access in Vehicular Environments (WAVE). The last part of the chapter contains a brief survey of some relevant MAC proposals in the scientific literature that try to cope with the challenges of vehicular networks. Most of them follow the contention-based channel access idea of the standard and propose extensions to the 802.11p MAC layer in order to achieve higher throughput and fairness; others capitalize on a centralized access to achieve deterministic service quality.


Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3622 ◽  
Author(s):  
Jin-Woo Kim ◽  
Jae-Wan Kim ◽  
Dong-Keun Jeon

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.


2013 ◽  
Vol 59 (10) ◽  
pp. 968-975 ◽  
Author(s):  
P. Venkata Krishna ◽  
Sudip Misra ◽  
V. Saritha ◽  
Harshit Agarwal ◽  
Naveen Chilamkurti

Author(s):  
Kayhan Zrar Ghafoor ◽  
Marwan Aziz Mohammed ◽  
Kamalrulnizam Abu Bakar ◽  
Ali Safa Sadiq ◽  
Jaime Lloret

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.


Author(s):  
Gongjun Yan ◽  
Danda B. Rawat ◽  
Bhed Bahadur Bista ◽  
Wu He ◽  
Awny Alnusair

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.


Sign in / Sign up

Export Citation Format

Share Document