82,345 research outputs found
Asymptotic Loss in Privacy due to Dependency in Gaussian Traces
The rapid growth of the Internet of Things (IoT) necessitates employing
privacy-preserving techniques to protect users' sensitive information. Even
when user traces are anonymized, statistical matching can be employed to infer
sensitive information. In our previous work, we have established the privacy
requirements for the case that the user traces are instantiations of discrete
random variables and the adversary knows only the structure of the dependency
graph, i.e., whether each pair of users is connected. In this paper, we
consider the case where data traces are instantiations of Gaussian random
variables and the adversary knows not only the structure of the graph but also
the pairwise correlation coefficients. We establish the requirements on
anonymization to thwart such statistical matching, which demonstrate the
significant degree to which knowledge of the pairwise correlation coefficients
further significantly aids the adversary in breaking user anonymity.Comment: IEEE Wireless Communications and Networking Conferenc
Slashdot, open news and informated media: exploring the intersection of imagined futures and web publishing technology
"In this essay, my interest is in how imagined media futures are implicated in the work of producing novel web publishing technology. I explore the issue through an account of the emergence of Slashdot, the tech news and discussion site that by 1999 had implemented a number of recommendation features now associated with social media and web 2.0 platforms. Specifically, I aim to understand the connection between the development of Slashdot’s influential content-management system (CMS) - an elaborate publishing infrastructure called “Slash” that allowed editors to choose reader submissions for publication and automatically distributed the work of moderating the comments sections among trusted users - and two distinct visions of a web-enabled transformation of media production.
Evolving SDN for Low-Power IoT Networks
Software Defined Networking (SDN) offers a flexible and scalable architecture
that abstracts decision making away from individual devices and provides a
programmable network platform. However, implementing a centralized SDN
architecture within the constraints of a low-power wireless network faces
considerable challenges. Not only is controller traffic subject to jitter due
to unreliable links and network contention, but the overhead generated by SDN
can severely affect the performance of other traffic. This paper addresses the
challenge of bringing high-overhead SDN architecture to IEEE 802.15.4 networks.
We explore how traditional SDN needs to evolve in order to overcome the
constraints of low-power wireless networks, and discuss protocol and
architectural optimizations necessary to reduce SDN control overhead - the main
barrier to successful implementation. We argue that interoperability with the
existing protocol stack is necessary to provide a platform for controller
discovery and coexistence with legacy networks. We consequently introduce
{\mu}SDN, a lightweight SDN framework for Contiki, with both IPv6 and
underlying routing protocol interoperability, as well as optimizing a number of
elements within the SDN architecture to reduce control overhead to practical
levels. We evaluate {\mu}SDN in terms of latency, energy, and packet delivery.
Through this evaluation we show how the cost of SDN control overhead (both
bootstrapping and management) can be reduced to a point where comparable
performance and scalability is achieved against an IEEE 802.15.4-2012 RPL-based
network. Additionally, we demonstrate {\mu}SDN through simulation: providing a
use-case where the SDN configurability can be used to provide Quality of
Service (QoS) for critical network flows experiencing interference, and we
achieve considerable reductions in delay and jitter in comparison to a scenario
without SDN
Distributed workload control for federated service discovery
The diffusion of the internet paradigm in each aspect of human life continuously fosters the widespread of new technologies and related services. In the Future Internet scenario, where 5G telecommunication facilities will interact with the internet of things world, analyzing in real time big amounts of data to feed a potential infinite set of services belonging to different administrative domains, the role of a federated service discovery will become crucial. In this paper the authors propose a distributed workload control algorithm to handle efficiently the service discovery requests, with the aim of minimizing the overall latencies experienced by the requesting user agents. The authors propose an algorithm based on the Wardrop equilibrium, which is a gametheoretical concept, applied to the federated service discovery domain. The proposed solution has been implemented and its performance has been assessed adopting different network topologies and metrics. An open source simulation environment has been created allowing other researchers to test the proposed solution
- …