Please use this identifier to cite or link to this item:
Title: Event aggregation with different latency constraints and aggregation functions in wireless sensor networks
Authors: Zhu, W
Cao, J 
Xu, Y
Raychoudhury, V
Issue Date: 2011
Source: IEEE International Conference on Communications, 2011, 5962930 How to cite?
Abstract: Event aggregation in WSNs is a process of combining several low-level events into a high-level event to eliminate redundant information to be transmitted and thus save energy. Existing works on event aggregation consider either latency constraint or aggregation function, but not both. Moreover, existing works only consider optimal aggregation for single high-level event, but many applications are composed of multiple high-level events. This paper studies the problem of aggregating multiple high-level events in WSNs with different latency constraints and aggregation functions. We propose relation matrix to define aggregation function, which describes the similarity among limited number of primitive events rather than the growing number of high-level events. Based on it, we propose an event aggregation algorithm jointly considering the two issues for single high-level event. This algorithm supports partial aggregation which is more general than fully aggregation. Through selection the optimal base events, the work is extended to multiple high-level events and consider the practical reliable constraint. The simulation results show that our algorithm outperforms existing approaches and saves significant amount of energy (up to 35% in our system).
Description: 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, 5-9 June 2011
ISBN: 9781612842332
ISSN: 0536-1486
DOI: 10.1109/icc.2011.5962930
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 12, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



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