An Evaluation of Pseudonym Changes for Vehicular Networks in Large-Scale, Realistic Traffic Scenarios

2018 ◽  
Vol 19 (10) ◽  
pp. 3400-3405 ◽  
Author(s):  
David Forster ◽  
Hans Lohr ◽  
Anne Gratz ◽  
Jonathan Petit ◽  
Frank Kargl
Keyword(s):  
Large Scale ◽  
Vehicular Networks

scholarly journals Joint optimization of network selection and task offloading for vehicular edge computing

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Lujie Tang ◽  
Bing Tang ◽  
Li Zhang ◽  
Feiyan Guo ◽  
Haiwu He
Keyword(s):  
Large Scale ◽  
Vehicular Networks ◽  
Access Point ◽  
Edge Computing ◽  
Network Selection ◽  
Network Access ◽  
Task Execution ◽  
Point Selection ◽  
Vehicle Movement ◽  
Task Offloading

AbstractTaking the mobile edge computing paradigm as an effective supplement to the vehicular networks can enable vehicles to obtain network resources and computing capability nearby, and meet the current large-scale increase in vehicular service requirements. However, the congestion of wireless networks and insufficient computing resources of edge servers caused by the strong mobility of vehicles and the offloading of a large number of tasks make it difficult to provide users with good quality of service. In existing work, the influence of network access point selection on task execution latency was often not considered. In this paper, a pre-allocation algorithm for vehicle tasks is proposed to solve the problem of service interruption caused by vehicle movement and the limited edge coverage. Then, a system model is utilized to comprehensively consider the vehicle movement characteristics, access point resource utilization, and edge server workloads, so as to characterize the overall latency of vehicle task offloading execution. Furthermore, an adaptive task offloading strategy for automatic and efficient network selection, task offloading decisions in vehicular edge computing is implemented. Experimental results show that the proposed method significantly improves the overall task execution performance and reduces the time overhead of task offloading.

scholarly journals Accurate Real-Time Traffic Speed Estimation Using Infrastructure-Free Vehicular Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-19 ◽  
Author(s):  
Zongjian He ◽  
Buyang Cao ◽  
Yan Liu
Keyword(s):  
Real Time ◽  
Large Scale ◽  
Vehicular Networks ◽  
Route Planning ◽  
Speed Estimation ◽  
Traffic Condition ◽  
Real Time Traffic ◽  
Traffic Trace ◽  
Traffic Speed ◽  
Traffic Speed Estimation

Real-time traffic speed is indispensable for many ITS applications, such as traffic-aware route planning and eco-driving advisory system. Existing traffic speed estimation solutions assume vehicles travel along roads using constant speed. However, this assumption does not hold due to traffic dynamicity and can potentially lead to inaccurate estimation in real world. In this paper, we propose a novel in-network traffic speed estimation approach using infrastructure-free vehicular networks. The proposed solution utilizes macroscopic traffic flow model to estimate the traffic condition. The selected model only relies on vehicle density, which is less likely to be affected by the traffic dynamicity. In addition, we also demonstrate an application of the proposed solution in real-time route planning applications. Extensive evaluations using both traffic trace based large scale simulation and testbed based implementation have been performed. The results show that our solution outperforms some existing ones in terms of accuracy and efficiency in traffic-aware route planning applications.

Large Scale Cognitive Wireless Networks

2013 ◽  
pp. 26-52
Author(s):  
Liang Song ◽  
Petros Spachos ◽  
Dimitrios Hatzinakos
Keyword(s):  
Energy Efficiency ◽  
Wireless Networks ◽  
Cognitive Radio ◽  
Data Aggregation ◽  
Network Architecture ◽  
Large Scale ◽  
Vehicular Networks ◽  
Network Resource ◽  
Cognitive Wireless Networks ◽  
Definition Of

Cognitive radio has been proposed to have spectrum agility (or opportunistic spectrum access). In this chapter, the authors introduce the extended network architecture of cognitive radio network, which accesses not only spectrum resource but also wireless stations (networking nodes) and high-level application data opportunistically: the large-scale cognitive wireless networks. The developed network architecture is based upon a re-definition of wireless linkage: as functional abstraction of proximity communications among wireless stations. The operation spectrum and participating stations of such abstract wireless links are opportunistically decided based on their instantaneous availability. It is able to maximize wireless network resource utilization and achieve much higher performance in large-scale wireless networks, where the networking environment can change fast (usually in millisecond level) in terms of spectrum and wireless station availability. The authors further introduce opportunistic routing and opportunistic data aggregation under the developed network architecture, which results in an implementation of cognitive unicast and cognitive data-aggregation wireless-link modules. In both works, it is shown that network performance and energy efficiency can improve with network scale (such as including station density). The applications of large-scale cognitive wireless networks are further discussed in new (and smart) beyond-3G wireless infrastructures, including for example real-time wireless sensor networks, indoor/underground wireless tracking networks, broadband wireless networks, smart grid and utility networks, smart vehicular networks, and emergency networks. In all such applications, the cognitive wireless networks can provide the most cost-effective wireless bandwidth and the best energy efficiency.

scholarly journals Multi-Hop Dynamic Map Data Propagation Algorithm for Clustered Vehicular Networks

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1728
Author(s):  
Odilbek Urmonov ◽  
HyungWon Kim
Keyword(s):  
Large Scale ◽  
Vehicular Networks ◽  
Dynamic Environment ◽  
Driving Safety ◽  
Local Dynamic ◽  
Vehicular Communication ◽  
Data Propagation ◽  
Dynamic Map ◽  
Map Data ◽  
Transmission Windows

To ensure the driving safety in vehicular network, it is necessary to construct a local dynamic map (LDM) for an extended range. Using the standard vehicular communication protocols, however, vehicles can construct the LDM for only one-hop range. Constructing large-scale LDM is highly challenging because vehicles randomly change their position. This paper proposes a dynamic map propagation (DMP) method, which builds a large aggregated LDM data using a multi-hop communication. To reduce the data overhead, we introduce an efficient clustering method based on a half-circle of the forwarder’s wireless range. The DMP elects one forwarder per cluster, which constructs LDM and forwards it to a neighbor cluster. The inter-cluster interference is minimized by allocating a different transmit window to each cluster. DMP copes with a dynamic environment by frequently re-electing the forwarders and their associated transmission windows. Simulation results reveal that DMP enhances the forwarders’ reception ratio by 20%, while extending LDM dissemination range by 29% over a previous work.

scholarly journals Spectrum Sensing for Cognitive Vehicular Networks over Composite Fading

2011 ◽  
Vol 2011 ◽  
pp. 1-9 ◽  
Author(s):  
Haroon Rasheed ◽  
Nandana Rajatheva
Keyword(s):  
Cognitive Radio ◽  
Spectrum Sensing ◽  
Large Scale ◽  
Vehicular Networks ◽  
Multipath Fading ◽  
Energy Detection ◽  
Shadow Fading ◽  
Radio System ◽  
Composite Fading ◽  
Hidden Terminal

Recent advancement in vehicular wireless applications is also a major contributing factor in spectrum scarcity. Cognitive radio system is a mechanism which allows unlicensed cognitive users (CUs) to utilize idle unused bands. Fast and reliable detection of primary legacy user is the key component of cognitive radio networks. However, hidden terminal and low SNR problems due to shadow fading put fundamental limit to the sensing performance and practical entailments in design of the cognitive vehicular networks. Extensive modeling is being carried out to specify varying channel characteristics, particularly multipath fading and shadowing. Energy detection-(ED-) based spectrum sensing is a viable choice for many vehicle-to-vehicle (V2V) and vehicle to-road-side infrastructure (V2I) communications. This paper examines the performance of spectrum sensing using ED over Gamma-shadowed Nakagami-m composite fading channel to cater for both small-and-large scale fading. The results highlight the notable impact of shadowing spread and fading severity on detection performance. The relevant simulation results are presented to support our analytical results for average detection probability. Furthermore, these results are investigated and compared to other compound and classical channels.

scholarly journals Hybrid Position-Based and DTN Forwarding for Vehicular Sensor Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 186146 ◽  
Author(s):  
Fan Li ◽  
Lei Zhao ◽  
Xiumei Fan ◽  
Yu Wang
Keyword(s):  
Sensor Networks ◽  
Routing Protocols ◽  
Large Scale ◽  
Vehicular Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Ad Hoc Routing ◽  
Efficient Data ◽  
Set Up

Efficient data delivery in vehicular sensor networks is still a challenging research issue. Position-based routing protocols have been proven to be more suitable for dynamic vehicular networks or large-scale mobile sensor networks than traditional ad hoc routing protocols. However, position-based routing assumes that intermediate nodes can always be found to set up an end-to-end connection between the source and the destination; otherwise, it suffers from network partitions which are very common in vehicular networks and leads to poor performances. This paper addresses data delivery challenge in the possible intermittently connected vehicular sensor networks by combining position-based forwarding strategy with store-carry-forward routing scheme from delay tolerant networks. The proposed routing method makes use of vehicle driving direction to determine whether holding or forwarding the packet. Experimental results show that the proposed mechanism outperforms existing position-based solutions in terms of packet delivery ratio.

Sign in / Sign up

Export Citation Format

Share Document