Abstract
The sensor nodes in sensor networks are limited in power, computational capacities, and memory. In order to fulfill these limitations an appropriate strategy is needed. Data aggregation is one of the power saving strategies in sensor networks, combining the data that comes from many sensor nodes into a set of the meaningful information. This paper proposes a new data aggregation algorithm named DAUCH (Data Aggregation algorithm Using DAG rooted at the Cluster Head) for clustering distributed nodes in sensor networks, combining the random cluster head election technique in LEACH with DAG in TORA. The proposed algorithm outperforms LEACH due to the less transmission power. Our simulation reveals that approximately a 4% improvement is accomplished comparing to the number of nodes alive with LEACH.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An Application-Specific Protocol Architecture for Wireless Micro sensor Networks. IEEE Transactions On Wireless Communications 1(4) (October 2002)
Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, April 1997, vol. 3, pp. 1405–1413 (1997)
Krishnamachari, B., Estrin, D., Wicker, S.: Modelling Data- Centric Routing in Wireless Sensor Networks. IEEE INFOCOM (2002)
Johnson, D.B., Maltz, D.A., Broch, J.: DSR:The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks. In: Perkins, C.E. (ed.) Ad Hoc Networking,  ch.5, pp. 139–172. Addison-Wesley, Reading (2001)
Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA 1999. Second IEEE Workshop, February 1999, pp. 90–100 (1999)
Scott Corson, M., Ephremides, A.: A distributed routing algorithm for mobile wireless networks. Wireless Networks archive 1(1), 61–81 (1995)
Rappaport, T.: Wireless Communications:Principles and Practice. Prentice-Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, SJ., Lee, CJ., Cho, YZ., Kim, SU. (2004). A New Data Aggregation Algorithm for Clustering Distributed Nodes in Sensor Networks. In: Freire, M.M., Chemouil, P., Lorenz, P., Gravey, A. (eds) Universal Multiservice Networks. ECUMN 2004. Lecture Notes in Computer Science, vol 3262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30197-4_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-30197-4_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23551-4
Online ISBN: 978-3-540-30197-4
eBook Packages: Springer Book Archive