20,549 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
Developing an Efficient DMCIS with Next-Generation Wireless Networks
The impact of extreme events across the globe is extraordinary which
continues to handicap the advancement of the struggling developing societies
and threatens most of the industrialized countries in the globe. Various fields
of Information and Communication Technology have widely been used for efficient
disaster management; but only to a limited extent though, there is a tremendous
potential for increasing efficiency and effectiveness in coping with disasters
with the utilization of emerging wireless network technologies. Early warning,
response to the particular situation and proper recovery are among the main
focuses of an efficient disaster management system today. Considering these
aspects, in this paper we propose a framework for developing an efficient
Disaster Management Communications and Information System (DMCIS) which is
basically benefited by the exploitation of the emerging wireless network
technologies combined with other networking and data processing technologies.Comment: 6 page
A Secure Lightweight Approach of Node Membership Verification in Dense HDSN
In this paper, we consider a particular type of deployment scenario of a
distributed sensor network (DSN), where sensors of different types and
categories are densely deployed in the same target area. In this network, the
sensors are associated with different groups, based on their functional types
and after deployment they collaborate with one another in the same group for
doing any assigned task for that particular group. We term this sort of DSN as
a heterogeneous distributed sensor network (HDSN). Considering this scenario,
we propose a secure membership verification mechanism using one-way accumulator
(OWA) which ensures that, before collaborating for a particular task, any pair
of nodes in the same deployment group can verify each other-s legitimacy of
membership. Our scheme also supports addition and deletion of members (nodes)
in a particular group in the HDSN. Our analysis shows that, the proposed scheme
could work well in conjunction with other security mechanisms for sensor
networks and is very effective to resist any adversary-s attempt to be included
in a legitimate group in the network.Comment: 6 page
- โฆ