35,520 research outputs found
Gossip Algorithms for Distributed Signal Processing
Gossip algorithms are attractive for in-network processing in sensor networks
because they do not require any specialized routing, there is no bottleneck or
single point of failure, and they are robust to unreliable wireless network
conditions. Recently, there has been a surge of activity in the computer
science, control, signal processing, and information theory communities,
developing faster and more robust gossip algorithms and deriving theoretical
performance guarantees. This article presents an overview of recent work in the
area. We describe convergence rate results, which are related to the number of
transmitted messages and thus the amount of energy consumed in the network for
gossiping. We discuss issues related to gossiping over wireless links,
including the effects of quantization and noise, and we illustrate the use of
gossip algorithms for canonical signal processing tasks including distributed
estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
An OFDM Signal Identification Method for Wireless Communications Systems
Distinction of OFDM signals from single carrier signals is highly important
for adaptive receiver algorithms and signal identification applications. OFDM
signals exhibit Gaussian characteristics in time domain and fourth order
cumulants of Gaussian distributed signals vanish in contrary to the cumulants
of other signals. Thus fourth order cumulants can be utilized for OFDM signal
identification. In this paper, first, formulations of the estimates of the
fourth order cumulants for OFDM signals are provided. Then it is shown these
estimates are affected significantly from the wireless channel impairments,
frequency offset, phase offset and sampling mismatch. To overcome these
problems, a general chi-square constant false alarm rate Gaussianity test which
employs estimates of cumulants and their covariances is adapted to the specific
case of wireless OFDM signals. Estimation of the covariance matrix of the
fourth order cumulants are greatly simplified peculiar to the OFDM signals. A
measurement setup is developed to analyze the performance of the identification
method and for comparison purposes. A parametric measurement analysis is
provided depending on modulation order, signal to noise ratio, number of
symbols, and degree of freedom of the underlying test. The proposed method
outperforms statistical tests which are based on fixed thresholds or empirical
values, while a priori information requirement and complexity of the proposed
method are lower than the coherent identification techniques
- …