Abstract
Since the communication is a main source of energy consumption in WSN, it is preferably to jointly collect sensor data from different sensor nodes, combine it based on specific variables, and forward combined data to the base station. In a typical data aggregator process, the aggregator nodes perform the data aggregation process. However, aggregator nodes can reside in the region, where the attributes of the aggregator node can change easily. In this paper, we study partitioning-based selection aggregator nodes in the WSNs. We argue that selecting an aggregator node from the region, where the attributes of the aggregator node can change easily is not efficient. Thus, in our method, we first propose to partition the sensor networks into several regions, and select an aggregator node only from those regions that are defined to be unchanged. We further formulate the selection process of an aggregator node as a top-k query problem, where we efficiently solve the problem by using a modified Sort-Filter-Skyline (SFS) algorithm. Through the experiments, we will demonstrate that the proposed method outperforms the existing methods by up to several times.
Keywords
- data aggregation
- aggregator node selection
- top-k
This is a preview of subscription content, access via your institution.
Buying options
Preview
Unable to display preview. Download preview PDF.
References
Pottie, G.J., Kaiser, W.J.: Wireless integrated network sensor. Communications of the ACM 43(5), 51–58 (2000)
Nasridinov, A., Ihm, S.Y., Park, Y.H.: Skyline-Based Aggregator Node Selection in Wireless Sensor Networks. International Journal of Distributed Sensor Networks 2013, 1–7 (2013)
Eggen, S.: Security in wireless sensor networks. Master Thesis, University of Oslo (2008)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of the 9th International Conference on Data Engineering, pp. 717–719 (2003)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI 2002), 131–146 (2002)
Lindsey, S., Raghavendra, C., Sivalingam, K.M.: Data gathering algorithms in sensor networks using energy metrics. IEEE Transactions on Parallel and Distributed Systems 13(9), 924–935 (2002)
Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions onWireless Communications 1(4), 660–670 (2002)
Younis, O., Fahmy, S.: HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing 3(4), 366–379 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nasridinov, A., Jang, W., Park, YH. (2014). Partitioning-Based Selection of Aggregator Nodes in Wireless Sensor Networks. In: Jeong, YS., Park, YH., Hsu, CH., Park, J. (eds) Ubiquitous Information Technologies and Applications. Lecture Notes in Electrical Engineering, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41671-2_96
Download citation
DOI: https://doi.org/10.1007/978-3-642-41671-2_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41670-5
Online ISBN: 978-3-642-41671-2
eBook Packages: EngineeringEngineering (R0)