518 research outputs found
Trade-off between power consumption and delay in wireless packetized systems
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 82-86).This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.In packetized wireless systems, coding allows reliable transmission of multiple packets colliding at a receiver. Thus data may not need to incur delays such as those due to back-off schemes in traditional ALOHA systems. However, there is a trade-off between delay and power consumption. Recent work in this area has considered the case where multiple users are aware of the states of other users' queues. We consider a time-slotted multiple user system with random packet arrivals. The size of the packets and probability of arrival together represent the burstiness of the system. The time slots are considered to be long enough that capacity can be achieved over a single slot in a sense we define. We consider the difference in average power consumption when average delay, in terms of slots, is minimized, with and without knowledge of other users' queues. We also consider the case where average power is minimized without regard for delay. We present and analyze a simple scheme with limited information sharing about queues' states. Our scheme uses a hybrid multiple access/broadcast type code for the case of low queue lengths and a multiple access scheme in the case of large queue lengths. We show how this scheme allows trade-offs between power consumption and delay.by Todd P. Coleman.S.M
Longitudinal Dynamic versus Kinematic Models for Car-Following Control Using Deep Reinforcement Learning
The majority of current studies on autonomous vehicle control via deep
reinforcement learning (DRL) utilize point-mass kinematic models, neglecting
vehicle dynamics which includes acceleration delay and acceleration command
dynamics. The acceleration delay, which results from sensing and actuation
delays, results in delayed execution of the control inputs. The acceleration
command dynamics dictates that the actual vehicle acceleration does not rise up
to the desired command acceleration instantaneously due to dynamics. In this
work, we investigate the feasibility of applying DRL controllers trained using
vehicle kinematic models to more realistic driving control with vehicle
dynamics. We consider a particular longitudinal car-following control, i.e.,
Adaptive Cruise Control (ACC), problem solved via DRL using a point-mass
kinematic model. When such a controller is applied to car following with
vehicle dynamics, we observe significantly degraded car-following performance.
Therefore, we redesign the DRL framework to accommodate the acceleration delay
and acceleration command dynamics by adding the delayed control inputs and the
actual vehicle acceleration to the reinforcement learning environment state,
respectively. The training results show that the redesigned DRL controller
results in near-optimal control performance of car following with vehicle
dynamics considered when compared with dynamic programming solutions.Comment: Accepted to 2019 IEEE Intelligent Transportation Systems Conferenc
Near-collisions and their Impact on Biometric Security
Biometric recognition encompasses two operating modes. The first one is
biometric identification which consists in determining the identity of an
individual based on her biometrics and requires browsing the entire database
(i.e., a 1:N search). The other one is biometric authentication which
corresponds to verifying claimed biometrics of an individual (i.e., a 1:1
search) to authenticate her, or grant her access to some services. The matching
process is based on the similarities between a fresh and an enrolled biometric
template. Considering the case of binary templates, we investigate how a highly
populated database yields near-collisions, impacting the security of both the
operating modes. Insight into the security of binary templates is given by
establishing a lower bound on the size of templates and an upper bound on the
size of a template database depending on security parameters. We provide
efficient algorithms for partitioning a leaked template database in order to
improve the generation of a master-template-set that can impersonates any
enrolled user and possibly some future users. Practical impacts of proposed
algorithms are finally emphasized with experimental studies
Computation Over Gaussian Networks With Orthogonal Components
Function computation of arbitrarily correlated discrete sources over Gaussian
networks with orthogonal components is studied. Two classes of functions are
considered: the arithmetic sum function and the type function. The arithmetic
sum function in this paper is defined as a set of multiple weighted arithmetic
sums, which includes averaging of the sources and estimating each of the
sources as special cases. The type or frequency histogram function counts the
number of occurrences of each argument, which yields many important statistics
such as mean, variance, maximum, minimum, median, and so on. The proposed
computation coding first abstracts Gaussian networks into the corresponding
modulo sum multiple-access channels via nested lattice codes and linear network
coding and then computes the desired function by using linear Slepian-Wolf
source coding. For orthogonal Gaussian networks (with no broadcast and
multiple-access components), the computation capacity is characterized for a
class of networks. For Gaussian networks with multiple-access components (but
no broadcast), an approximate computation capacity is characterized for a class
of networks.Comment: 30 pages, 12 figures, submitted to IEEE Transactions on Information
Theor
- …