Md. Rakibul Haque, Mahmuda Naznin, M. Asaduzzaman, R. Ahmed
{"title":"STP: In-network aggregation through proximity queries in a Sensor Network","authors":"Md. Rakibul Haque, Mahmuda Naznin, M. Asaduzzaman, R. Ahmed","doi":"10.1109/ICCIT.2009.5407297","DOIUrl":null,"url":null,"abstract":"Event detection and notification is a common task in a Wireless Sensor Networks (WSN). Efficient data aggregation and minimization of energy consumption are the great research challenges in WSN. In WSN, aggregated event information is more important than individual event information for energy saving and reliability. Proximity queries or query approximation can be used to reduce the complexity of data aggregation and energy consumption. This paper presents an efficient and scalable hybrid framework for processing spatial and temporal proximity queries in WSN which we call STP. STP builds tree structure with less overhead, and reduces the event propagation cost through proximity queries. STP reduces energy consumption by reducing the number of aggregator nodes, which ultimately increases the network life time. STP eliminates the unnecessary aggregation of events using a tunable temporal proximity threshold. We compare STP's performance with another spatial query processing method and we show that, STP performs better.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"14 7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 12th International Conference on Computers and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT.2009.5407297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Event detection and notification is a common task in a Wireless Sensor Networks (WSN). Efficient data aggregation and minimization of energy consumption are the great research challenges in WSN. In WSN, aggregated event information is more important than individual event information for energy saving and reliability. Proximity queries or query approximation can be used to reduce the complexity of data aggregation and energy consumption. This paper presents an efficient and scalable hybrid framework for processing spatial and temporal proximity queries in WSN which we call STP. STP builds tree structure with less overhead, and reduces the event propagation cost through proximity queries. STP reduces energy consumption by reducing the number of aggregator nodes, which ultimately increases the network life time. STP eliminates the unnecessary aggregation of events using a tunable temporal proximity threshold. We compare STP's performance with another spatial query processing method and we show that, STP performs better.