Deep learning optimizes vehicular communication zones for efficient data dissemination.
problem Overdimensioning and inefficient communication in vehicular floating content.
method Deep learning is used to select optimal broadcasting areas (Anchor Zones) for efficient message dissemination.
result The proposed method achieves an accuracy of 89.7% in predicting optimal Anchor Zones, saving up to 27% of resources.
An active learning approach reduces AoI violation in vehicular networks.
problem Dynamic nature of vehicular networks makes resource allocation challenging.
method Gaussian process regression (GPR) for online decentralized active learning.
result Significant improvement in AoI violation probability with at least 50% reduction.
New ML models improve VVLC channel characterization for vehicular OWC.
problem Inaccurate channel models for VVLC due to mobility effects.
method Machine learning (ML) models incorporating ambient light, turbulence, and reflection effects.
result ML models predict VVLC channel loss and CFR more accurately than existing methods.
A new approach uses deep learning to manage vehicular content efficiently.
problem Managing content replication and caching in vehicular networks efficiently.
method Data-driven, centralized approach using a Convolutional Neural Network (CNN).
result Effective strategies derived to modulate FC operation in space and adapt to mobility changes.
This paper uses deep reinforcement learning to optimize UAV-assisted vehicular networks.
problem Optimizing UAV-assisted vehicular networks for efficient communication in smart cities.
method Formulated a Markov decision process (MDP) problem and solved it using deep deterministic policy gradient (DDPG) method.
result Proposed solutions maximize total throughput per unit energy and encourage UAV mobility.
DQN optimizes traffic light control policies in ITSs.
problem Challenges in scalable real-time actuation mechanisms for smart traffic management.
method Exploration of Deep Q-Networks (DQN) for traffic light control policies.
result DQN algorithms produce intelligent behavior, such as greenwave patterns.
This paper tackles security challenges in CAVs using ML, proposing defenses against adversarial attacks.
problem Security threats posed by adversarial machine learning in CAVs.
method An in-depth analysis of ML pipeline in CAVs, identifying security issues and proposing defenses.
result Proposes solutions to defend against adversarial attacks in CAVs.
In this paper, a novel joint transmit power and resource allocation approach for enabling ultra-reliable low-latency communication (URLLC) in vehicular networks is proposed. The objective is to minimize the network-wide power consumption of vehicular users (VUEs) while ensuring high reliability in terms of probabilisti…
As wireless networks evolve towards high mobility and providing better support for connected vehicles, a number of new challenges arise due to the resulting high dynamics in vehicular environments and thus motive rethinking of traditional wireless design methodologies. Future intelligent vehicles, which are at the hear…
Recent advances in smart cities applications enforce security threads such as node replication attacks. Such attack is take place when the attacker plants a replicated network node within the network. Vehicular Ad hoc networks are connecting sensors that have limited resources and required the response time to be as lo…
This research optimizes handover between fog nodes in vehicular IoT using machine learning.
problem Smooth transition of device connections and offloaded tasks between fog nodes in vehicular IoT.
method Proposes a three-layer feed-forward neural network and a dual stacked RNN with LSTM cells to predict fog nodes and minimize service interruption.
result Achieved 99.2% accuracy in predicting fog nodes with a test set.
Existing inefficient traffic light control causes numerous problems, such as long delay and waste of energy. To improve efficiency, taking real-time traffic information as an input and dynamically adjusting the traffic light duration accordingly is a must. In terms of how to dynamically adjust traffic signals' duration…
Paper proposes a deep learning strategy for efficient FC management.
problem Inaccurate and conservative FC dimensioning approaches in realistic settings.
method Uses a Convolutional Neural Network (CNN) to dynamically modulate FC resources.
result Achieves a maximum rejection rate of 3% and 37.5% resource savings.
The paper classifies vehicle shapes and colors using deep neural networks.
problem Vehicle reidentification and classification challenges.
method Used deeper neural networks for classification accuracy.
result Good classification accuracy on make/model and color.
Study provides guidelines for smartphone-based transportation mode detection.
problem Developing a reliable transportation mode detection system using smartphone sensors.
method Detailed dataset construction, sensor relevance analysis, and unknown user detection.
result Demonstrated the feasibility and effectiveness of smartphone-based TMD.
Deep neural networks infer downlink CSI from uplink CSI without feedback.
problem Efficient allocation of wireless resources in FDD systems requires accurate DL-CSI.
method Used convolutional neural networks and GANs to infer DL-CSI from UL-CSI.
result Deep learning can accurately predict DL-CSI from UL-CSI for various environments.
Intelligent transportation systems (ITSs) will be a major component of tomorrow's smart cities. However, realizing the true potential of ITSs requires ultra-low latency and reliable data analytics solutions that can combine, in real-time, a heterogeneous mix of data stemming from the ITS network and its environment. Su…
An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…
We introduce the first unified theory for target tracking using Multiple Hypothesis Tracking, Topological Data Analysis, and machine learning. Our string of innovations are 1) robust topological features are used to encode behavioral information, 2) statistical models are fitted to distributions over these topological …
Estimates spectral risk measures from i.i.d. samples.
problem Estimating spectral risk measures from limited data.
method Numerical integration method for SRM estimation.
result Estimate concentrates exponentially for bounded support distributions.
Predict real-time crash risks during hurricane evacuations using connected vehicle data.
problem Mitigate crash risks during hurricane evacuations by predicting high-risk locations.
method Used connected vehicle data to predict crash risks in real-time, considering weather and traffic features.
result Gaussian Process Boosting and Extreme Gradient Boosting models performed best, with recall of 0.91.
Develops a neural network for precise vehicle trajectory prediction.
problem Improving situational awareness in vehicular networks for safety applications.
method Two-layer neural network predicting vehicle parameters and trajectory points.
result Significantly improved prediction accuracy compared to existing methods.
Framework classifies urban congestion into recurrent and non-recurrent types.
problem Classifying urban congestion into recurrent and non-recurrent types.
method Real-time distributed classification using VANET on a heterogeneous urban road network.
result Predictive accuracy of 89.17% for the boosting technique.
Survey of RL algorithms for dynamic environments.
problem Handling changing operating conditions in RL.
method Survey of algorithms developed for non-stationary environments.
result Methods to adapt to varying operating conditions.
Collision avoidance is a critical task in many applications, such as ADAS (advanced driver-assistance systems), industrial automation and robotics. In an industrial automation setting, certain areas should be off limits to an automated vehicle for protection of people and high-valued assets. These areas can be quaranti…
A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.
problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.
We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…
Community detection improves stock market portfolio optimization.
problem Improving portfolio optimization in financial markets.
method Community detection in correlation-based networks of worldwide stock markets.
result Portfolios constructed using community detection outperform traditional methods.
We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…
Proposes a deep reinforcement learning model for efficient variable speed limits control.
problem Improving traffic flow, safety, and emissions on freeways with varying speed limits.
method Uses a novel actor-critic architecture for deep reinforcement learning to manage dynamic speed limits.
result The proposed method enhances efficiency, safety, and emissions compared to traditional control methods.
Study exact community detection in k-community Gaussian mixtures with different intensities.
problem Community detection in k-community Gaussian mixtures with varying intensities.
method Explicitly find the threshold for exact recovery of maximum likelihood estimation.
result Threshold for exact recovery of maximum likelihood estimation is identified.
The paper introduces a method for detecting principal communities and embedding vertices.
problem Detecting and embedding vertices in graphs with community structure.
method Principal graph encoder embedding method that detects principal communities and produces vertex embeddings.
result The method successfully detects principal communities and produces accurate vertex embeddings.
Improved distributed learning with reduced communication costs.
problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT), improving significantly on full communication. vGraph learns community membership and node representation jointly.
problem Independent study of community detection and node representation learning limits graph analysis.
method vGraph is a probabilistic generative model that learns community membership and node representation collaboratively.
result vGraph outperforms many baselines in both community detection and node representation learning.
Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…
Study compares community detection methods in various networks.
problem Determine which community detection method is best for specific network types.
method Comprehensive empirical analysis of multiple methods on diverse network categories.
result Identifies different types of communities produced by various methods.
New GNN model detects overlapping communities better than existing methods.
problem Detecting overlapping communities in graphs.
method Graph Neural Network (GNN) for overlapping community detection.
result The proposed GNN model outperforms existing baselines significantly.
MACC learns communication protocols by adapting counterfactual reasoning.
problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.
TMSCD detects multi-scale communities in temporal networks automatically.
problem Discovering multi-scale communities in large, evolving networks.
method Spectral multilayer formulation of MM method with automatic parameter selection.
result Automatic detection of multi-scale communities without manual parameter selection.
A novel framework for adaptive multi-agent communication in reinforcement learning.
problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.
Survey on community detection methods and their theoretical properties.
problem Consistent estimation of community labels in networks.
method Various community detection methods and their theoretical properties.
result Review of community detection methods and their theoretical properties.
A framework for multi-agent communication over noisy channels in reinforcement learning.
problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.
A new method reduces communication in distributed learning by skipping less informative gradient updates.
problem Efficient communication in distributed machine learning.
method Quantizes and skips less informative gradients to reduce communication overhead.
result Proves linear convergence rate similar to gradient descent with significant communication savings.
New metrics needed for better understanding emergent communication in multi-agent systems.
problem Current metrics for emergent communication are insufficient for complex environments.
method Training deep reinforcement learning agents in simple games to analyze communication effectiveness.
result Messages in emergent communication can be misleading and do not always impact the environment.
GRADE models evolving graph dynamics by learning node and community representations.
problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.
Paper studies fundamental limits of communication in distributed learning.
problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.
New algorithm reduces communication traffic in decentralized learning.
problem Communication bottleneck in decentralized learning for low-bandwidth workers.
method Sparsification and adaptive peer selection to reduce communication traffic.
result Significant reduction in communication traffic compared to existing methods.
Study recovers community structure from coarse graph measurements.
problem Community recovery from low-resolution graph measurements.
method Formalized coarsening process of graph measurements, developed conditions for perfect recovery.
result Simple and closed-form asymptotic conditions for perfect recovery of coarse graph communities.