Dragon: Data discovery and collection architecture for distributed IoT

Wireless Low-powered Sensing Systems (WLSS) are becoming more prevalent, taking the form of Wireless Sensor/Actuator Networks, Internet of Things, Phones etc. As node and network capabilities of such systems improve, there is more motivation to push computation into the network as it saves energy, prolongs system lifetime, and enables timely responses to events or control activities. Another advantage of such edge-processing is that these networks can become autonomous in the sense that users can directly query the network via any node in the network and are not required to connect to gateways or retrieve data via long range communications. Dragon is a scheme that efficiently identifies nodes that can reply to user requests based on static criteria that either describes that node or its data and provides the ability to near-optimally route queries or actuation control messages to those nodes. Dragon is scalable and agile as it does not require any central point orchestrating the search. In this paper we demonstrate significant performance improvements compared with state-of-the-art approaches in terms of numbers of messages required (up to 93% less) and its ability to scale to 100s of nodes.

[1]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[2]  Luca Mottola,et al.  Building virtual sensors and actuators over logical neighborhoods , 2006, MidSens '06.

[3]  David E. Culler,et al.  Design of an application-cooperative management system for wireless sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..

[4]  Anis Koubaa,et al.  RPL in a nutshell: A survey , 2012, Comput. Networks.

[5]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[6]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[7]  Deborah Estrin,et al.  DIFS: a distributed index for features in sensor networks , 2003, Ad Hoc Networks.

[8]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

[9]  William D. Tajibnapis,et al.  A correctness proof of a topology information maintenance protocol for a distributed computer network , 1977, CACM.

[10]  Sudipto Guha,et al.  Dynamic join optimization in multi-hop wireless sensor networks , 2010, Proc. VLDB Endow..

[11]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[12]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[13]  Sudipto Guha,et al.  A substrate for in-network sensor data integration , 2008, DMSN '08.

[14]  Hyunchul Kang,et al.  In-Network Processing of Joins in Wireless Sensor Networks , 2013, Sensors.

[15]  Klemens Böhm,et al.  Towards Efficient Processing of General-Purpose Joins in Sensor Networks , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[16]  Konrad Iwanicki,et al.  On hierarchical routing in wireless sensor networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.