4,795 research outputs found
Dissimilarity metric based on local neighboring information and genetic programming for data dissemination in vehicular ad hoc networks (VANETs)
This paper presents a novel dissimilarity metric based on local neighboring information
and a genetic programming approach for efficient data dissemination in Vehicular Ad Hoc Networks
(VANETs). The primary aim of the dissimilarity metric is to replace the Euclidean distance in
probabilistic data dissemination schemes, which use the relative Euclidean distance among vehicles
to determine the retransmission probability. The novel dissimilarity metric is obtained by applying a
metaheuristic genetic programming approach, which provides a formula that maximizes the Pearson
Correlation Coefficient between the novel dissimilarity metric and the Euclidean metric in several
representative VANET scenarios. Findings show that the obtained dissimilarity metric correlates with
the Euclidean distance up to 8.9% better than classical dissimilarity metrics. Moreover, the obtained
dissimilarity metric is evaluated when used in well-known data dissemination schemes, such as
p-persistence, polynomial and irresponsible algorithm. The obtained dissimilarity metric achieves
significant improvements in terms of reachability in comparison with the classical dissimilarity
metrics and the Euclidean metric-based schemes in the studied VANET urban scenarios
A Stable Fountain Code Mechanism for Peer-to-Peer Content Distribution
Most peer-to-peer content distribution systems require the peers to privilege
the welfare of the overall system over greedily maximizing their own utility.
When downloading a file broken up into multiple pieces, peers are often asked
to pass on some possible download opportunities of common pieces in order to
favor rare pieces. This is to avoid the missing piece syndrome, which throttles
the download rate of the peer-to-peer system to that of downloading the file
straight from the server. In other situations, peers are asked to stay in the
system even though they have collected all the file's pieces and have an
incentive to leave right away.
We propose a mechanism which allows peers to act greedily and yet stabilizes
the peer-to-peer content sharing system. Our mechanism combines a fountain code
at the server to generate innovative new pieces, and a prioritization for the
server to deliver pieces only to new peers. While by itself, neither the
fountain code nor the prioritization of new peers alone stabilizes the system,
we demonstrate that their combination does, through both analytical and
numerical evaluation.Comment: accepted to IEEE INFOCOM 2014, 9 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
- …