scholarly journals Modelling and Simulating Large Scale Vehicular Networks for Smart Context-aware Telematic Applications

10.5772/7660 ◽  
2010 ◽  
Author(s):  
Ansar-Ul-Haque Yasar ◽  
Davy Preuveneers ◽  
Yolande Berbers
Keyword(s):  
Large Scale ◽  
Vehicular Networks ◽  
Context Aware

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.

Context-aware Adaptive Surgery

2021 ◽  
Vol 5 (3) ◽  
pp. 1-22
Author(s):  
Hongli Wang ◽  
Bin Guo ◽  
Jiaqi Liu ◽  
Sicong Liu ◽  
Yungang Wu ◽  
...  
Keyword(s):  
Real Time ◽  
Large Scale ◽  
Resource Constraints ◽  
Search Algorithm ◽  
Search Time ◽  
State Graph ◽  
Context Aware ◽  
Optimal Partition ◽  
Research Attention ◽  
Neighbor Effect

Deep Neural Networks (DNNs) have made massive progress in many fields and deploying DNNs on end devices has become an emerging trend to make intelligence closer to users. However, it is challenging to deploy large-scale and computation-intensive DNNs on resource-constrained end devices due to their small size and lightweight. To this end, model partition, which aims to partition DNNs into multiple parts to realize the collaborative computing of multiple devices, has received extensive research attention. To find the optimal partition, most existing approaches need to run from scratch under given resource constraints. However, they ignore that resources of devices (e.g., storage, battery power), and performance requirements (e.g., inference latency), are often continuously changing, making the optimal partition solution change constantly during processing. Therefore, it is very important to reduce the tuning latency of model partition to realize the real-time adaption under the changing processing context. To address these problems, we propose the Context-aware Adaptive Surgery (CAS) framework to actively perceive the changing processing context, and adaptively find the appropriate partition solution in real-time. Specifically, we construct the partition state graph to comprehensively model different partition solutions of DNNs by import context resources. Then "the neighbor effect" is proposed, which provides the heuristic rule for the search process. When the processing context changes, CAS adopts the runtime search algorithm, Graph-based Adaptive DNN Surgery (GADS), to quickly find the appropriate partition that satisfies resource constraints under the guidance of the neighbor effect. The experimental results show that CAS realizes adaptively rapid tuning of the model partition solutions in 10ms scale even for large DNNs (2.25x to 221.7x search time improvement than the state-of-the-art researches), and the total inference latency still keeps the same level with baselines.

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

Context-aware personalized path inference from large-scale GPS snippets

2018 ◽  
Vol 91 ◽  
pp. 78-88 ◽  
Author(s):  
Hongtao Wang ◽  
Hongmei Wang ◽  
Feng Yi ◽  
Hui Wen ◽  
Gang Li ◽  
...  
Keyword(s):  
Large Scale ◽  
Context Aware

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.

Context-aware Distance Measures for Dynamic Networks

2022 ◽  
Vol 16 (1) ◽  
pp. 1-34
Author(s):  
Yiji Zhao ◽  
Youfang Lin ◽  
Zhihao Wu ◽  
Yang Wang ◽  
Haomin Wen
Keyword(s):  
Large Scale ◽  
Dynamic Networks ◽  
Distance Measures ◽  
General Definition ◽  
Mathematical Representation ◽  
Network Clustering ◽  
Context Aware ◽  
Network Distance ◽  
Practical Applications ◽  
Spectral Distance

Dynamic networks are widely used in the social, physical, and biological sciences as a concise mathematical representation of the evolving interactions in dynamic complex systems. Measuring distances between network snapshots is important for analyzing and understanding evolution processes of dynamic systems. To the best of our knowledge, however, existing network distance measures are designed for static networks. Therefore, when measuring the distance between any two snapshots in dynamic networks, valuable context structure information existing in other snapshots is ignored. To guide the construction of context-aware distance measures, we propose a context-aware distance paradigm, which introduces context information to enrich the connotation of the general definition of network distance measures. A Context-aware Spectral Distance (CSD) is then given as an instance of the paradigm by constructing a context-aware spectral representation to replace the core component of traditional Spectral Distance (SD). In a node-aligned dynamic network, the context effectively helps CSD gain mainly advantages over SD as follows: (1) CSD is not affected by isospectral problems; (2) CSD satisfies all the requirements of a metric, while SD cannot; and (3) CSD is computationally efficient. In order to process large-scale networks, we develop a kCSD that computes top- k eigenvalues to further reduce the computational complexity of CSD. Although kCSD is a pseudo-metric, it retains most of the advantages of CSD. Experimental results in two practical applications, i.e., event detection and network clustering in dynamic networks, show that our context-aware spectral distance performs better than traditional spectral distance in terms of accuracy, stability, and computational efficiency. In addition, context-aware spectral distance outperforms other baseline methods.

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 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
Sign in / Sign up

Export Citation Format

Share Document