Data Aggregation for group communication in Machine-to-Machine environments

Autores: André Riker, Eduardo Cerqueira, Marilia Curado, Edmundo Monteiro

Áreas: M2M

Abstract: The energy resources of Machine-to-Machine (M2M) devices need to last as much as possible. Data aggregation is a suitable solution to prolong the network lifetime, since it allows the devices to reduce the amount of data traffic. In M2M systems, the M2M platform and the Constrained Application Protocol (CoAP) enable multiple entities to send concurrent data-requests to the same capillary network. For example, in a Smart Metering scenario, there are devices measuring the electricity consumption of an entire building. The supplier company requests all devices to send the data updates every 1800 seconds (i.e., 30 minutes). On the other hand, a resident requests his/her devices to communicate every 600 seconds (i.e., 10 minutes). These concurrent data-requests create heterogeneous groups over the same capillary network, since each group might be able to execute different in-network functions and to have a unique temporal-frequency of communication. However, the traditional data aggregation solutions designed for periodic monitoring assume the execution of a single static data-request during all network lifetime. This makes the traditional data aggregation solutions not suitable for M2M environments. To fill this gap, this paper presents Data Aggregation for Multiple Groups (DAMiG), which is designed to provide Data Aggregation for heterogeneous and concurrent sets of CoAP data-requests. DAMiG explores the group communication periodicity to perform internal and external-group traffic aggregation. To achieve that, DAMiG computes a suitable aggregation structure and applies statistical and merger aggregation functions along the path. DAMiG is able to reduce the energy consumption in scenarios with single or several concurrent CoAP data-requests. Moreover, the selection of internal and external-group paths takes into account the residual energy of the nodes, avoiding the paths with low residual energy.