Abstract
In wireless sensor networks, data aggregation is performed to eliminate redundant data transmission and to enhance the network life time. The existing data aggregation techniques rarely consider the different types of applications like critical and non-critical. Also they are generally energy aware in nature but not delay aware. To minimize the delay and energy consumption in the data aggregation, this paper proposes an adaptive data aggregation technique. We consider three types of application data namely critical, bursty and regular. When the data type is critical, a shortest path with minimum delay is constructed and the critical data is transmitted directly towards the sink. In case of bursty data, the structure free data aggregation technique is used and it gets fractional aggregation. For regular data, an energy efficient aggregation tree is constructed. By simulation results, we show that the proposed technique significantly reduces the end-to-end delay, energy consumption and overhead.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nithyanandan, L., Sivarajesh, G., Dananjayan, P.: Modified GPSR Protocol for Wireless Sensor Networks. Int. J. of Computer and Electrical Engineering 2 (2010)
Huang, Q., Liu, X., Guo, C.: Reliable Aggregation Routing for Wireless Sensor Networks based on Game Theory. InTech (2010)
Maraiya, K., Kant, K., Gupta, N.: Wireless Sensor Network: A Review on Data Aggregation. Int. J. of Scientific & Engineering Research 2 (2011)
Lindsey, S., Raghavendra, C., Sivalingam, K.M.: Data Gathering in Sensor Networks using the Energy Metric. In: International Symposium on Parallel and Distributed Processing (2001)
Macedo, M., Grilo, A., Nunes, M.: Distributed Latency-Energy Minimization and interference avoidance in TDMA Wireless Sensor Networks. Computer Networks, 569–582 (2009)
Gargano, L., Rescigno, A.A.: Collision-free path coloring with application to minimum-delay gathering in sensor Networks. Discrete Applied Mathematics 157(8), 1858–1872 (2009)
Jie, Z., Shu-jie, G., Yu-gui, Q.V., Bao-hua, Z.: Energy equalizing routing for fast data gathering in Wireless Sensor Networks. J. of China Universities of Posts and Telecommunications 14(4) (2007)
Xu, X., Wang, X., Mao, X., Li, X., Tang, S.: A Delay Efficient Algorithm for Data Aggregation in Multi-hop Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems 22, 163–175 (2010)
Thomas, H., Charles, E., Ronald, L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge
Fan, K., Liu, S., Sinha, P.: Structure-Free Data Aggregation in Sensor Networks. IEEE Transactions on Mobile Computing 6(8) (2007)
Du, D., Hu, X.: Steiner Tree problem in computer communications networks. World Scientific Publishing Co. Pte. Ltd., Singapore
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sivaranjani, S., Radhakrishnan, S., Thangaraj, C. (2013). Adaptive Delay and Energy Aware Data Aggregation Technique in Wireless Sensor Networks. In: Das, V.V., Chaba, Y. (eds) Mobile Communication and Power Engineering. AIM 2012. Communications in Computer and Information Science, vol 296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35864-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-35864-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35863-0
Online ISBN: 978-3-642-35864-7
eBook Packages: Computer ScienceComputer Science (R0)