Efficient In-Network Processing for a Hardware-Heterogeneous IoT
Title | Efficient In-Network Processing for a Hardware-Heterogeneous IoT |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Kolcun, Roman, Boyle, David, McCann, Julie A. |
Conference Name | Proceedings of the 6th International Conference on the Internet of Things |
Date Published | November 2016 |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-4814-0 |
Keywords | composability, CPS, distributed algorithm, heterogeneous networks, Heterogeneous WSN, In-network Processing, Internet of Things, Metrics, network accountability, pubcrawl, Resiliency, Wireless sensor networks |
Abstract | As the number of small, battery-operated, wireless-enabled devices deployed in various applications of Internet of Things (IoT), Wireless Sensor Networks (WSN), and Cyber-physical Systems (CPS) is rapidly increasing, so is the number of data streams that must be processed. In cases where data do not need to be archived, centrally processed, or federated, in-network data processing is becoming more common. For this purpose, various platforms like DRAGON, Innet, and CJF were proposed. However, these platforms assume that all nodes in the network are the same, i.e. the network is homogeneous. As Moore's law still applies, nodes are becoming smaller, more powerful, and more energy efficient each year; which will continue for the foreseeable future. Therefore, we can expect that as sensor networks are extended and updated, hardware heterogeneity will soon be common in networks - the same trend as can be seen in cloud computing infrastructures. This heterogeneity introduces new challenges in terms of choosing an in-network data processing node, as not only its location, but also its capabilities, must be considered. This paper introduces a new methodology to tackle this challenge, comprising three new algorithms - Request, Traverse, and Mixed - for efficiently locating an in-network data processing node, while taking into account not only position within the network but also hardware capabilities. The proposed algorithms are evaluated against a naive approach and achieve up to 90% reduction in network traffic during long-term data processing, while spending a similar amount time in the discovery phase. |
URL | https://dl.acm.org/doi/10.1145/2991561.2991568 |
DOI | 10.1145/2991561.2991568 |
Citation Key | kolcun_efficient_2016 |