Author:
Mo Shangfeng,Chen Hong,Li Yinglong
Abstract
Abstract
A large-scale wireless sensor networks (WSNs) can be deployed for top-k querying applications. There are many top-k querying algorithms which are based on traditional routing approaches. In this article, we proposed a clustering-based routing for top-k querying (CRTQ) in WSNs to save the energy consumption and extend the network lifetime. The proposed scheme consists of two parts: one is the cluster formation algorithm; another part is the inter-cluster choosing the relay cluster head algorithm. Moreover, we adopt a corresponding dynamic clustering algorithm. Our experimental result shows that CRTQ substantially outperforms the existing tree-based approaches and clustering-based approaches in terms of both energy consumption and network lifetime.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Signal Processing
Reference20 articles.
1. Institute of Electrical and Electronics Engineers Inc: Ten emerging technologies that will change your world. IEEE Eng Manag Rev 2004, 32: 20-30.
2. Raghavendra CS, Sivalingam KM, Zhati T: Wireless Sensor Networks. Kluwer Academic Publish-ers; 2004:185-252.
3. Wu M, Xu J, Tang X, Lee W-C: Top-k monitoring in wireless sensor networks. IEEE Trans Knowl Data Eng 2007, 19(7):962-976.
4. Cho Y, Son J, Chung YD: POT: an efficient top-k monitoring method for spatially correlated sensor readings. 5th International Workshop on Data Management for Sensor Networks, DMSN'08, in Conjunction with the 34th International Conference on Very Large Data Bases 2008, 8-13.
5. Yeo MH, Seong DO, Yoo JS: PRIM: priority-based top-k monitoring in wireless sensor networks. International Symposium on Computer Science and Its Applications, Proceeding, CSA 2008 2008, 326-331.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献