3,595 research outputs found
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
Bootstrapping opportunistic networks using social roles
Opportunistic routing protocols can enable message delivery in disconnected networks of mobile devices. To conserve energy in mobile environments, such routing protocols must minimise unnecessary message-forwarding. This paper presents an opportunistic routing protocol that leverages social role information. We compute node roles from a social network graph to identify nodes with similar contact relationships, and use these roles to determine routing decisions. By using pre-existing social network information, such as online social network friends, to determine roles, we show that our protocol can bootstrap a new opportunistic network without the delay incurred by encounter-history-based routing protocols such as SimbetTS. Simulations with four real-world datasets show improved performance over SimbetTS, with performance approaching Epidemic routing in some scenarios.Postprin
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling
Traditionally, routing in wireless sensor networks consists of
two steps: First, the routing protocol selects a next hop,
and, second, the MAC protocol waits for the intended destination
to wake up and receive the data. This design makes
it difficult to adapt to link dynamics and introduces delays
while waiting for the next hop to wake up.
In this paper we introduce ORW, a practical opportunistic
routing scheme for wireless sensor networks. In a dutycycled
setting, packets are addressed to sets of potential receivers
and forwarded by the neighbor that wakes up first
and successfully receives the packet. This reduces delay and
energy consumption by utilizing all neighbors as potential
forwarders. Furthermore, this increases resilience to wireless
link dynamics by exploiting spatial diversity. Our results
show that ORW reduces radio duty-cycles on average
by 50% (up to 90% on individual nodes) and delays by 30%
to 90% when compared to the state of the art
Social-aware Forwarding in Opportunistic Wireless Networks: Content Awareness or Obliviousness?
With the current host-based Internet architecture, networking faces
limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm
mitigates such problems by releasing the need to have an end-to-end transport
session established during the life time of the data transfer. Moreover, the
ICN concept solves the mismatch between the Internet architecture and the way
users would like to use it: currently a user needs to know the topological
location of the hosts involved in the communication when he/she just wants to
get the data, independently of its location. Most of the research efforts aim
to come up with a stable ICN architecture in fixed networks, with few examples
in ad-hoc and vehicular networks. However, the Internet is becoming more
pervasive with powerful personal mobile devices that allow users to form
dynamic networks in which content may be exchanged at all times and with low
cost. Such pervasive wireless networks suffer with different levels of
disruption given user mobility, physical obstacles, lack of cooperation,
intermittent connectivity, among others. This paper discusses the combination
of content knowledge (e.g., type and interested parties) and social awareness
within opportunistic networking as to drive the deployment of ICN solutions in
disruptive networking scenarios. With this goal in mind, we go over few
examples of social-aware content-based opportunistic networking proposals that
consider social awareness to allow content dissemination independently of the
level of network disruption. To show how much content knowledge can improve
social-based solutions, we illustrate by means of simulation some
content-oblivious/oriented proposals in scenarios based on synthetic mobility
patterns and real human traces.Comment: 7 pages, 6 figure
- …