Differential successive relaying scheme for fast and reliable data delivery in vehicular ad hoc networks

et al. 2019

Electronics

Relay technology application becomes prevalent nowadays, as it can effectively extend the communication distance, especially for vehicular networks with a limited communication range. Combined with vehicular cloud (VC), transmission efficiency can be improved by offloading partial data. Hence, designing a vehicle relay algorithm and implementation embedded vehicle device is critical. In this paper, VC is considered to deal with the complexity computation in our proposed system model. Without a loss of generality, an end-to-end vehicle communication with one assisted vehicle is analyzed firstly on a transmission link based on VC. Here, the signal-to-noise ratio (SNR) on the receiving end and link outage probability is obtained to enhance the link reliability. The VC computing helps us further simplify computational complexity. Subsequently, an embedded vehicle-enabled device is designed to achieve the optimal path relay selection in realistic vehicular environments. In the functional device framework, we display an optimal path relay selection algorithm according to the link quality. Finally, the performance of the transmission link on the outage probability related with SNR is verified in the simulation results. Meanwhile, the effect of the relay gain is also analyzed. The application of a vehicle-enabled embedded device could improve the performance of vehicular networks.

Section: Optimal Path Selection Algorithmmentioning

confidence: 99%

Analysis and Design of Functional Device for Vehicular Cloud Computing

Sha

et al. 2019

Electronics

“…Various protocols are proposed to improve the transmission reliability by repeatedly multicasting messages or selecting the farthest node to relay messages. [15][16][17] However, repeated multicast cannot completely guarantee the transmission reliability but degrades the resource utilization.…”

Section: Related Workmentioning

confidence: 99%

Distributed relay selection with network coding for data dissemination in vehicular ad hoc networks

International Journal of Distributed Sensor Networks

Yin

2017

Data dissemination in vehicular ad hoc networks has been an interesting research topic since rising applications can be run and served based on the success and efficiency of data dissemination in vehicular ad hoc networks. However, the volatile vehicle density, the highly dynamic topologies, and the packet lossy nature of the vehicular wireless communications pose real challenges for vehicular ad hoc networks to achieve high-speed content downloading and efficient resource utilization. In this work, we design a collision-free distributed relay selection method, by jointly considering the geographical locations, channel conditions, moving velocities, and packets receiving statuses of vehicles, to combat the mobility and lossy channel property of vehicular ad hoc networks. Moreover, we adopt the instantly decodable network coding for the selected relay vehicle to retransmit packets which were lost in the original transmission, resulting significant improvements in both network throughput and transmission delay. Simulation results show that the proposed strategy effectively reduces the delay of data dissemination in highway scenarios and improves the downloading rate, as well as the resource utilization of wireless channels.

“…In conventional infrastructure-based vehicular communication networks, information are transmitted to every vehicle by base stations (BSs) deployed alongside the road. While in VANETs, two vehicles can communicate with one another directly as long as the Euclidean distance between two vehicles is less than a threshold, the communication range of a vehicle, defined as r 0 in this paper [1]. Due to the mobility of vehicles, the topology of a VANET is changing over time [2], so the clusters of vehicles are splitting and merging over time, where a cluster is a maximal set of vehicles in which there is at least one hop between each pair of vehicles.…”

Section: Introductionmentioning

confidence: 99%

Energy saving of base stations sleep scheduling for multi-hop vehicular networks

Xiong

2016 IEEE International Conference on Communications (ICC)

Jiang

et al. 2016

This paper investigates the energy saving of base station (BS) deployed in a 1-D multi-hop vehicular network with sleep scheduling strategy. We consider cooperative BS scheduling strategy where BSs can switch between sleep and active modes to reduce the average energy consumption utilizing the information of vehicular speeds and locations. Assuming a Poisson distribution of vehicles, we derive an appropriate probability distribution function of distance between two adjacent cluster heads, where a cluster is a maximal set of vehicles in which every two adjacent vehicles can communicate directly when theirEuclidean distance is less than or equal to a threshold, known as the communication range of vehicles. Furthermore, the expected value of the sojourn time in the sleep mode and energy saving are obtained. The numerical results show that the sleep scheduling strategy significantly reduces the energy consumption of the base stations. 1