Abstract
This paper proposes a centralized tree structure based routing protocol. It is based on a greedy heuristic to maximize wireless sensor network lifetime. The proposed heuristic results in greater lifetime has been compared with naive heuristic used earlier in literature. The proposed design uses residual energy for the construction of tree which makes high energy sensor nodes nearer to base station. Rigorously the algorithm is tested using simulation and found that the lifetime is improved significantly compared to the available well known greedy solutions respectively.
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
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Network: A Survey. Comp. Networks J. 38(4), 393–422 (2002)
Mdden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: The Design of an Acquisitional Query Processor for Sensor Networks. In: Proc. ACM SIGMOD 2003, pp. 491–502 (2003)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: Mobile networking for smart dust. In: ACM MobiCom, pp. 271–278 (August 1999)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A worst-case analysis of an MST-based heuristic to construct energy efficient broadcast trees in wireless networks, Technical Report 010 of the Univ. of Rome Tor Vergata (2001)
Gao, J., Zhang, L.: Load Balanced Short Path Routing in Wireless Networks. In: Proc. IEEE INFOCOM (2004)
Kar, I.K., Kodialam, M., Lakshman., T.V., Tassiulas, L.: Routing for Network Capacity Maximization in Energy constrained Ad-hoc Networks. In: Proc. IEEE INFOCOM (2003)
Sankar, A., Liu, Z.: Maximum Lifetime Routing in Wireless Ad-hoc Networks. In: IEEE INFOCOM (2004)
Chang, J.H., Tassiulas, L.: Routing for maximum system lifetime in wireless ad hoc networks. In: 37th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL (September 1999)
Chang, J.H., Tassiulas, L.: Energy conserving routing in wireless ad hoc networks. In: IEEE INFOCOM (March 2000)
Chang, J.H., Tassiulas, L.: Maximum lifetime routing in wireless sensor networks. In: ATIRP Conf., College Park, MD (March 2000)
Chang, J.H., Tassiulas, L.: Maximum lifetime routing in wireless sensor networks. IEEE/ACM Trans. on Network 12(4), 609–619 (2004)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy efficient communication protocol for wireless microsensor networks. In: 33rd Annual Hawaii International Conference on System Sciences, pp. 3005–3014 (2000)
Woo, A., Tong, T., Culler, D.: Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks. In: ACM SenSys (2003)
Luo, J., Hubaux, J.P.: Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks. In: IEEE INFOCOM (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badrinath, G.S., Gupta, P., Das, S.K. (2007). Maximum Lifetime Tree Construction for Wireless Sensor Networks. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-77115-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77112-8
Online ISBN: 978-3-540-77115-9
eBook Packages: Computer ScienceComputer Science (R0)