Abstract
A convergecast is a process in which all the sensor nodes sense data and fuse them to forward to a base station. A correct data gathering requires that there is no data loss or delivery of redundant data. Nodes can form a spanning tree rooted at the sink to perform the convergecast. Leaves of the tree can sense and forward data independently. But for any internal node data can be forwarded to its parent only after receiving data from all its children. It has been observed that a Breadth-First-Search (BFS) tree is a better choice for convergecast under low system load because the depth of any node from the root is always minimum; whereas under higher system load condition a Depth-First-Search (DFS) tree may be a better option as the degree of any node in a DFS tree is lower than that in a BFS tree. Hence per node load is lower in case of a DFS tree than that of a BFS tree. So to meet the requirement of load based adaptation, a dynamic tree switching algorithm has been proposed in this paper. The convergecast application remains transparent of the switching assuring the availability of the system at any instance of time. Also each convergecast message is assured to be delivered correctly to the base station without any loss or redundancy.
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.
Similar content being viewed by others
References
Annamalai, V., Gupta, S.K.S., Schwiebert, L.: On tree-based convergecasting in wireless sensor networks. In: Proceedings of IEEE Wireless Communication and Networking Conference, pp. 1942–1947 (2003)
Chen, H., Mineno, H., Mizuno, T.: Adaptive data aggregation scheme in clustered wireless sensor networks. Comput. Commun. 31, 3579–3585 (2008)
Heinzelman, W.R., Kulik, J., Balakrishnan, H.: Adaptive protocols for information dissemination in wireless sensor networks. In: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom 1999, pp. 174–185. ACM, New York (1999)
Karmakar, S., Gupta, A.: Adaptive broadcast by distributed protocol switching. In: Proceedings of the 2007 ACM Symposium on Applied Computing, pp. 588–589 (2007)
Krishnamachari, B., Estrin, D., Wicker, S.B.: The impact of data aggregation in wireless sensor networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, ICDCSW 2002, pp. 575–578. IEEE Computer Society Press, Washington, DC, USA (2002)
Liu, X., van Renesse, R.: Fast protocol transition in a distributed environment (brief announcement). In: PODC 2000: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, p. 341. ACM, New York (2000)
Liu, X., van Renesse, R., Bickford, M., Kreitz, C., Constable, R.: Protocol switching: Exploiting meta-properties. In: Proceedings 21st International Conference on Distributed Computing Systems Workshops, Mesa, AZ, USA, pp. 37–42 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, S., Karmakar, S. (2011). A Novel Approach for Adaptive Data Gathering in Sensor Networks by Dynamic Spanning Tree Switching. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22714-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-22714-1_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22713-4
Online ISBN: 978-3-642-22714-1
eBook Packages: Computer ScienceComputer Science (R0)