Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/4728
Title: Hitch Hiker 2.0: a binding model with flexible data aggregation for the Internet-of-Things
Authors: Ramachandran,GS
José Paiva Proença
Daniels,W
Pickavet,M
Staessens,D
Huygens,C
Joosen,W
Hughes,D
Issue Date: 2016
Abstract: Wireless communication plays a critical role in determining the lifetime of Internet-of-Things (IoT) systems. Data aggregation approaches have been widely used to enhance the performance of IoT applications. Such approaches reduce the number of packets that are transmitted by combining multiple packets into one transmission unit, thereby minimising energy consumption, collisions and congestion. However, current data aggregation schemes restrict developers to a specific network structure or cannot handle multi-hop data aggregation. In this paper, we propose Hitch Hiker 2.0, a component binding model that provides support for multi-hop data aggregation. Hitch Hiker uses component meta-data to discover remote component bindings and to construct a multi-hop overlay network within the free payload space of existing traffic flows. Hitch Hiker 2.0 provides end-to-end routing of low-priority traffic while using only a small fraction of the energy of standard communication. This paper extends upon our previous work by incorporating new mechanisms for decentralised route discovery and providing additional application case studies and evaluation. We have developed a prototype implementation of Hitch Hiker for the LooCI component model. Our evaluation shows that Hitch Hiker consumes minimal resources and that using Hitch Hiker to deliver low-priority traffic reduces energy consumption by up to 32 %.
URI: http://repositorio.inesctec.pt/handle/123456789/4728
http://dx.doi.org/10.1186/s13174-016-0047-7
metadata.dc.type: article
Publication
Appears in Collections:HASLab - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00K-FE5.pdf1.23 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.