26,109 research outputs found
Secure and privacy-aware proxy mobile IPv6 protocol for vehicle-to-grid networks
Vehicle-to-Grid (V2G) networks have emerged as a new communication paradigm between Electric Vehicles (EVs) and the Smart Grid (SG). In order to ensure seamless communications between mobile EVs and the electric vehicle supply equipment, the support of ubiquitous and transparent mobile IP communications is essential in V2G networks. However, enabling mobile IP communications raises real concerns about the possibility of tracking the locations of connected EVs through their mobile IP addresses. In this paper, we employ certificate-less public key cryptography in synergy with the restrictive partially blind signature technique to construct a secure and privacy-aware proxy mobile IPv6 (SP-PMIPv6) protocol for V2G networks. SP-PMIPv6 achieves low authentication latency while protecting the identity and location privacy of the mobile EV. We evaluate the SP-PMIPv6 protocol in terms of its authentication overhead and the information-theoretic uncertainty derived by the mutual information metric to show the high level of achieved anonymity
Geometric entanglement from matrix product state representations
An efficient scheme to compute the geometric entanglement per lattice site
for quantum many-body systems on a periodic finite-size chain is proposed in
the context of a tensor network algorithm based on the matrix product state
representations. It is systematically tested for three prototypical critical
quantum spin chains, which belong to the same Ising universality class. The
simulation results lend strong support to the previous claim [Q.-Q. Shi, R.
Or\'{u}s, J. O. Fj{\ae}restad, and H.-Q. Zhou, New J. Phys \textbf{12}, 025008
(2010); J.-M. St\'{e}phan, G. Misguich, and F. Alet, Phys. Rev. B \textbf{82},
180406R (2010)] that the leading finite-size correction to the geometric
entanglement per lattice site is universal, with its remarkable connection to
the celebrated Affleck-Ludwig boundary entropy corresponding to a conformally
invariant boundary condition.Comment: 4+ pages, 3 figure
Understanding the internet topology evolution dynamics
The internet structure is extremely complex. The Positive-Feedback Preference
(PFP) model is a recently introduced internet topology generator. The model
uses two generic algorithms to replicate the evolution dynamics observed on the
internet historic data. The phenomenological model was originally designed to
match only two topology properties of the internet, i.e. the rich-club
connectivity and the exact form of degree distribution. Whereas numerical
evaluation has shown that the PFP model accurately reproduces a large set of
other nontrivial characteristics as well. This paper aims to investigate why
and how this generative model captures so many diverse properties of the
internet. Based on comprehensive simulation results, the paper presents a
detailed analysis on the exact origin of each of the topology properties
produced by the model. This work reveals how network evolution mechanisms
control the obtained topology properties and it also provides insights on
correlations between various structural characteristics of complex networks.Comment: 15 figure
Model Predictive Control for Smart Grids with Multiple Electric-Vehicle Charging Stations
Next-generation power grids will likely enable concurrent service for
residences and plug-in electric vehicles (PEVs). While the residence power
demand profile is known and thus can be considered inelastic, the PEVs' power
demand is only known after random PEVs' arrivals. PEV charging scheduling aims
at minimizing the potential impact of the massive integration of PEVs into
power grids to save service costs to customers while power control aims at
minimizing the cost of power generation subject to operating constraints and
meeting demand. The present paper develops a model predictive control (MPC)-
based approach to address the joint PEV charging scheduling and power control
to minimize both PEV charging cost and energy generation cost in meeting both
residence and PEV power demands. Unlike in related works, no assumptions are
made about the probability distribution of PEVs' arrivals, the known PEVs'
future demand, or the unlimited charging capacity of PEVs. The proposed
approach is shown to achieve a globally optimal solution. Numerical results for
IEEE benchmark power grids serving Tesla Model S PEVs show the merit of this
approach
Segmental Spatiotemporal CNNs for Fine-grained Action Segmentation
Joint segmentation and classification of fine-grained actions is important
for applications of human-robot interaction, video surveillance, and human
skill evaluation. However, despite substantial recent progress in large-scale
action classification, the performance of state-of-the-art fine-grained action
recognition approaches remains low. We propose a model for action segmentation
which combines low-level spatiotemporal features with a high-level segmental
classifier. Our spatiotemporal CNN is comprised of a spatial component that
uses convolutional filters to capture information about objects and their
relationships, and a temporal component that uses large 1D convolutional
filters to capture information about how object relationships change across
time. These features are used in tandem with a semi-Markov model that models
transitions from one action to another. We introduce an efficient constrained
segmental inference algorithm for this model that is orders of magnitude faster
than the current approach. We highlight the effectiveness of our Segmental
Spatiotemporal CNN on cooking and surgical action datasets for which we observe
substantially improved performance relative to recent baseline methods.Comment: Updated from the ECCV 2016 version. We fixed an important
mathematical error and made the section on segmental inference cleare
Situation-Aware QoS Routing Algorithm for Vehicular Ad hoc Networks
A wide range of services has been developed for Vehicular Ad hoc Networks (VANETs) ranging from safety to infotainment applications. An essential requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Besides, routing reliability needs to be paid special attention as communication links frequently break in VANETs. In this paper, we propose employing the Situational Awareness (SA) concept and an Ant Colony System (ACS) based algorithm to develop a Situation-Aware Multi-constrained QoS (SAMQ) routing algorithm for VANETs. SAMQ aims to compute feasible routes between the communicating vehicles subject to multiple QoS constraints and pick the best computed route, if such a route exists. To mitigate the risks inherited from selecting the best computed route that may turn out to fail at any moment, SAMQ utilises the SA levels and ACS mechanisms to prepare certain countermeasures with the aim of assuring a reliable data transmission. Simulation results demonstrate that SAMQ is capable of achieving a reliable data transmission as compared to the existing QoS routing algorithms even when the network topology is highly dynamic
- …