3,721 research outputs found
A Geometric Approach to Slot Alignment in Wireless Sensor Networks
Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially when clocks are allowed to drift for longer time to reduce clock synchronization overhead. Recently, a new class of lightweight protocols for statistical estimation in wireless sensor networks have been proposed. This new class requires very short transmission durations (jam signals), thus the traditional approach of using guard times would impose significant overhead. We propose a new, more efficient algorithm to align slots. Based on geometrical properties of space, we prove that our approach bounds the slot duration by only a constant factor of what is needed. Furthermore, we show by simulation that this bound is loose and an even smaller slot duration is required, making our approach even more efficient.National Science Foundation (CNS Cybertrust Award 0524477, CNS ITR Award 0205294, EIA RI Award 0202067
Self-Synchronization in Duty-cycled Internet of Things (IoT) Applications
In recent years, the networks of low-power devices have gained popularity.
Typically these devices are wireless and interact to form large networks such
as the Machine to Machine (M2M) networks, Internet of Things (IoT), Wearable
Computing, and Wireless Sensor Networks. The collaboration among these devices
is a key to achieving the full potential of these networks. A major problem in
this field is to guarantee robust communication between elements while keeping
the whole network energy efficient. In this paper, we introduce an extended and
improved emergent broadcast slot (EBS) scheme, which facilitates collaboration
for robust communication and is energy efficient. In the EBS, nodes
communication unit remains in sleeping mode and are awake just to communicate.
The EBS scheme is fully decentralized, that is, nodes coordinate their wake-up
window in partially overlapped manner within each duty-cycle to avoid message
collisions. We show the theoretical convergence behavior of the scheme, which
is confirmed through real test-bed experimentation.Comment: 12 Pages, 11 Figures, Journa
Modeling self-sustained activity cascades in socio-technical networks
The ability to understand and eventually predict the emergence of information
and activation cascades in social networks is core to complex socio-technical
systems research. However, the complexity of social interactions makes this a
challenging enterprise. Previous works on cascade models assume that the
emergence of this collective phenomenon is related to the activity observed in
the local neighborhood of individuals, but do not consider what determines the
willingness to spread information in a time-varying process. Here we present a
mechanistic model that accounts for the temporal evolution of the individual
state in a simplified setup. We model the activity of the individuals as a
complex network of interacting integrate-and-fire oscillators. The model
reproduces the statistical characteristics of the cascades in real systems, and
provides a framework to study time-evolution of cascades in a state-dependent
activity scenario.Comment: 5 pages, 3 figure
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
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL
Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating traffic with arbitrary patterns.
We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmaps and Bloom filters to represent and propagate this information in a space-efficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state-of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task
Values-Based Network Leadership in an Interconnected World
This paper describes values-based network leadership conceptually aligned to systems science, principles of networks, moral and ethical development, and connectivism. Values-based network leadership places importance on a leader\u27s repertoire of skills for stewarding a culture of purpose and calling among distributed teams in a globally interconnected world. Values-based network leadership is applicable for any leader needing to align interdependent effort by networks of teams operating across virtual and physical environments to achieve a collective purpose. An open-learning ecosystem is also described to help leaders address the development of strengths associated with building trust and relationships across networks of teams, aligned under a higher purpose and calling, possessing moral fiber, resilient in the face of complexity, reflectively competent to adapt as interconnected efforts evolve and change within multicultural environments, and able to figure out new ways to do something never done before
Fast Desynchronization For Decentralized Multichannel Medium Access Control
Distributed desynchronization algorithms are key to wireless sensor networks
as they allow for medium access control in a decentralized manner. In this
paper, we view desynchronization primitives as iterative methods that solve
optimization problems. In particular, by formalizing a well established
desynchronization algorithm as a gradient descent method, we establish novel
upper bounds on the number of iterations required to reach convergence.
Moreover, by using Nesterov's accelerated gradient method, we propose a novel
desynchronization primitive that provides for faster convergence to the steady
state. Importantly, we propose a novel algorithm that leads to decentralized
time-synchronous multichannel TDMA coordination by formulating this task as an
optimization problem. Our simulations and experiments on a densely-connected
IEEE 802.15.4-based wireless sensor network demonstrate that our scheme
provides for faster convergence to the steady state, robustness to hidden
nodes, higher network throughput and comparable power dissipation with respect
to the recently standardized IEEE 802.15.4e-2012 time-synchronized channel
hopping (TSCH) scheme.Comment: to appear in IEEE Transactions on Communication
- …