4,541 research outputs found
Socially-Aware Distributed Hash Tables for Decentralized Online Social Networks
Many decentralized online social networks (DOSNs) have been proposed due to
an increase in awareness related to privacy and scalability issues in
centralized social networks. Such decentralized networks transfer processing
and storage functionalities from the service providers towards the end users.
DOSNs require individualistic implementation for services, (i.e., search,
information dissemination, storage, and publish/subscribe). However, many of
these services mostly perform social queries, where OSN users are interested in
accessing information of their friends. In our work, we design a socially-aware
distributed hash table (DHTs) for efficient implementation of DOSNs. In
particular, we propose a gossip-based algorithm to place users in a DHT, while
maximizing the social awareness among them. Through a set of experiments, we
show that our approach reduces the lookup latency by almost 30% and improves
the reliability of the communication by nearly 10% via trusted contacts.Comment: 10 pages, p2p 2015 conferenc
A Resource Intensive Traffic-Aware Scheme for Cluster-based Energy Conservation in Wireless Devices
Wireless traffic that is destined for a certain device in a network, can be
exploited in order to minimize the availability and delay trade-offs, and
mitigate the Energy consumption. The Energy Conservation (EC) mechanism can be
node-centric by considering the traversed nodal traffic in order to prolong the
network lifetime. This work describes a quantitative traffic-based approach
where a clustered Sleep-Proxy mechanism takes place in order to enable each
node to sleep according to the time duration of the active traffic that each
node expects and experiences. Sleep-proxies within the clusters are created
according to pairwise active-time comparison, where each node expects during
the active periods, a requested traffic. For resource availability and recovery
purposes, the caching mechanism takes place in case where the node for which
the traffic is destined is not available. The proposed scheme uses Role-based
nodes which are assigned to manipulate the traffic in a cluster, through the
time-oriented backward difference traffic evaluation scheme. Simulation study
is carried out for the proposed backward estimation scheme and the
effectiveness of the end-to-end EC mechanism taking into account a number of
metrics and measures for the effects while incrementing the sleep time duration
under the proposed framework. Comparative simulation results show that the
proposed scheme could be applied to infrastructure-less systems, providing
energy-efficient resource exchange with significant minimization in the power
consumption of each device.Comment: 6 pages, 8 figures, To appear in the proceedings of IEEE 14th
International Conference on High Performance Computing and Communications
(HPCC-2012) of the Third International Workshop on Wireless Networks and
Multimedia (WNM-2012), 25-27 June 2012, Liverpool, U
Fundamental Limits of Caching in Wireless D2D Networks
We consider a wireless Device-to-Device (D2D) network where communication is
restricted to be single-hop. Users make arbitrary requests from a finite
library of files and have pre-cached information on their devices, subject to a
per-node storage capacity constraint. A similar problem has already been
considered in an ``infrastructure'' setting, where all users receive a common
multicast (coded) message from a single omniscient server (e.g., a base station
having all the files in the library) through a shared bottleneck link. In this
work, we consider a D2D ``infrastructure-less'' version of the problem. We
propose a caching strategy based on deterministic assignment of subpackets of
the library files, and a coded delivery strategy where the users send linearly
coded messages to each other in order to collectively satisfy their demands. We
also consider a random caching strategy, which is more suitable to a fully
decentralized implementation. Under certain conditions, both approaches can
achieve the information theoretic outer bound within a constant multiplicative
factor. In our previous work, we showed that a caching D2D wireless network
with one-hop communication, random caching, and uncoded delivery, achieves the
same throughput scaling law of the infrastructure-based coded multicasting
scheme, in the regime of large number of users and files in the library. This
shows that the spatial reuse gain of the D2D network is order-equivalent to the
coded multicasting gain of single base station transmission. It is therefore
natural to ask whether these two gains are cumulative, i.e.,if a D2D network
with both local communication (spatial reuse) and coded multicasting can
provide an improved scaling law. Somewhat counterintuitively, we show that
these gains do not cumulate (in terms of throughput scaling law).Comment: 45 pages, 5 figures, Submitted to IEEE Transactions on Information
Theory, This is the extended version of the conference (ITW) paper
arXiv:1304.585
- …