6,753 research outputs found
A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods
The interference imposes a significant negative impact on the performance of
wireless networks. With the continuous deployment of larger and more
sophisticated wireless networks, reducing interference in such networks is
quickly being focused upon as a problem in today's world. In this paper we
analyze the interference reduction problem from a graph theoretical viewpoint.
A graph coloring methods are exploited to model the interference reduction
problem. However, additional constraints to graph coloring scenarios that
account for various networking conditions result in additional complexity to
standard graph coloring. This paper reviews a variety of algorithmic solutions
for specific network topologies.Comment: 10 pages, 5 figure
The Cost of Global Broadcast in Dynamic Radio Networks
We study the single-message broadcast problem in dynamic radio networks. We
show that the time complexity of the problem depends on the amount of stability
and connectivity of the dynamic network topology and on the adaptiveness of the
adversary providing the dynamic topology. More formally, we model communication
using the standard graph-based radio network model. To model the dynamic
network, we use a generalization of the synchronous dynamic graph model
introduced in [Kuhn et al., STOC 2010]. For integer parameters and
, we call a dynamic graph -interval -connected if for every
interval of consecutive rounds, there exists a -vertex-connected stable
subgraph. Further, for an integer parameter , we say that the
adversary providing the dynamic network is -oblivious if for constructing
the graph of some round , the adversary has access to all the randomness
(and states) of the algorithm up to round .
As our main result, we show that for any , any , and any
, for a -oblivious adversary, there is a distributed
algorithm to broadcast a single message in time
. We further show that even for large interval -connectivity,
efficient broadcast is not possible for the usual adaptive adversaries. For a
-oblivious adversary, we show that even for any (for any constant ) and for any , global broadcast in -interval -connected networks requires at least
time. Further, for a oblivious adversary,
broadcast cannot be solved in -interval -connected networks as long as
.Comment: 17 pages, conference version appeared in OPODIS 201
Securing personal distributed environments
The Personal Distributed Environment (PDE) is a new concept being developed by Mobile VCE allowing future mobile users flexible access to their information and services. Unlike traditional mobile communications, the PDE user no longer needs to establish his or her personal communication link solely through one subscribing network but rather a diversity of disparate devices and access technologies whenever and wherever he or she requires. Depending on the servicesâ availability and coverage in the location, the PDE communication configuration could be, for instance, via a mobile radio system and a wireless ad hoc network or a digital broadcast system and a fixed telephone network. This new form of communication configuration inherently imposes newer and higher security challenges relating to identity and authorising issues especially when the number of involved entities, accessible network nodes and service providers, builds up. These also include the issue of how the subscribed service and the userâs personal information can be securely and seamlessly handed over via multiple networks, all of which can be changing dynamically. Without such security, users and operators will not be prepared to trust their information to other networks
HoPP: Robust and Resilient Publish-Subscribe for an Information-Centric Internet of Things
This paper revisits NDN deployment in the IoT with a special focus on the
interaction of sensors and actuators. Such scenarios require high
responsiveness and limited control state at the constrained nodes. We argue
that the NDN request-response pattern which prevents data push is vital for IoT
networks. We contribute HoP-and-Pull (HoPP), a robust publish-subscribe scheme
for typical IoT scenarios that targets IoT networks consisting of hundreds of
resource constrained devices at intermittent connectivity. Our approach limits
the FIB tables to a minimum and naturally supports mobility, temporary network
partitioning, data aggregation and near real-time reactivity. We experimentally
evaluate the protocol in a real-world deployment using the IoT-Lab testbed with
varying numbers of constrained devices, each wirelessly interconnected via IEEE
802.15.4 LowPANs. Implementations are built on CCN-lite with RIOT and support
experiments using various single- and multi-hop scenarios
- âŠ