15,919 research outputs found
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
DM-PhyClus: A Bayesian phylogenetic algorithm for infectious disease transmission cluster inference
Background. Conventional phylogenetic clustering approaches rely on arbitrary
cutpoints applied a posteriori to phylogenetic estimates. Although in practice,
Bayesian and bootstrap-based clustering tend to lead to similar estimates, they
often produce conflicting measures of confidence in clusters. The current study
proposes a new Bayesian phylogenetic clustering algorithm, which we refer to as
DM-PhyClus, that identifies sets of sequences resulting from quick transmission
chains, thus yielding easily-interpretable clusters, without using any ad hoc
distance or confidence requirement. Results. Simulations reveal that DM-PhyClus
can outperform conventional clustering methods, as well as the Gap procedure, a
pure distance-based algorithm, in terms of mean cluster recovery. We apply
DM-PhyClus to a sample of real HIV-1 sequences, producing a set of clusters
whose inference is in line with the conclusions of a previous thorough
analysis. Conclusions. DM-PhyClus, by eliminating the need for cutpoints and
producing sensible inference for cluster configurations, can facilitate
transmission cluster detection. Future efforts to reduce incidence of
infectious diseases, like HIV-1, will need reliable estimates of transmission
clusters. It follows that algorithms like DM-PhyClus could serve to better
inform public health strategies
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central
processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the goal is to design a minimum cost network to carry this demand.
Potential links exist between any pair of terminals and between the central processor and the terminals.
Each potential link can be included in the design at a given cost.The CMST problem is to design a
minimum-cost network connecting the terminals with the central processor so that the flow on any arc of the network is at most Q. A biased random-keygenetic algorithm(BRKGA)is a metaheuristic for combinatorial optimization which evolves a population of random vectors that encode solutions to the combinatorial optimization problem.This paper explores several solution encodings as well as different
strategies for some steps of the algorithm and finally proposes a BRKGA heuristic for the CMST problem.
Computational experiments are presented showing the effectivenes sof the approach:Seven newbest-
known solutions are presented for the set of benchmark instances used in the experiments.Peer ReviewedPostprint (author’s final draft
- …