Please use this identifier to cite or link to this item:
|Title:||Information quality aware routing in event-driven sensor networks||Authors:||Tan, H.-X.
|Issue Date:||2010||Citation:||Tan, H.-X., Chan, M.-C., Xiao, W., Kong, P.-Y., Tham, C.-K. (2010). Information quality aware routing in event-driven sensor networks. Proceedings - IEEE INFOCOM. ScholarBank@NUS Repository. https://doi.org/10.1109/INFCOM.2010.5461989||Abstract:||Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree problem in graphs, which incurs high overheads as it requires knowledge of the entire network topology and individual IQ contributions of each activated sensor node. We tackle these issues by proposing: (i) a topology-aware histogram-based aggregation structure that encapsulates the cost of including the IQ contribution of each activated node in a compact and efficient way; and (ii) a greedy heuristic to approximate and prune a least-cost aggregation routing path. We show that the performance of our IQ-aware routing protocol is: (i) bounded by a distance-based aggregation tree that collects data from all the activated nodes; and (ii) comparable to another IQ-aware routing protocol that uses an exhaustive brute-force search to approximate and prune the least-cost aggregation tree. ©2010 IEEE.||Source Title:||Proceedings - IEEE INFOCOM||URI:||http://scholarbank.nus.edu.sg/handle/10635/41505||ISBN:||9781424458363||ISSN:||0743166X||DOI:||10.1109/INFCOM.2010.5461989|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 12, 2021
WEB OF SCIENCETM
checked on Apr 12, 2021
checked on Apr 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.