Abstract
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishable power resources, both path length and path energy cost are important metrics affecting sensor lifetime. In this paper, we model the formation of length and energy constrained paths using a game theoretic paradigm. The Nash equilibrium of our routing game corresponds to the optimal length-energy-constrained (LEC) path. We show that this path can be computed in polynomial time in sensor networks operating under a geographic routing regime. We then define a simpler team version of this routing game and propose a distributed nearly-stateless energy efficient inter-cluster routing protocol that finds optimal routes. This protocol balances energy consumption across the network by periodically determining a new optimal path consistent with associated energy distributions. Simulation results testify to the effectiveness of the protocol in producing a longer network lifetime.
This work was supported in part by NSF grants IIS-0329738, IIS-0312632 and DARPA/AFRL grant # F30602-02-1-0198.
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
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Sensor Networks. In: Mobile Computing, Kluwer, Dordrecht (1996)
Perkins, C., Royer, E.: Ad Hoc On Demand Distance Vector Routing. In: Proc. of 2nd IEEE Wksp Mobile Comp. Sys. and Applications (February 1999)
Chang, J., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: IEEE INFOCOM 2000 (March 2000)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM 2000), Boston, Massachusetts (August 2000)
Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proc. ACM/IEEE MobiCom (August 2000)
Park, S., Savvides, A., Srivastava, M.B.: SensorSim: A Simulation Framework for Sensor Networks. In: Boston, M.A. (ed.) Proceedings of MSWiM 2000, Boston, MA, August 11 (2000)
Yu, Y., Govindan, R., Estrin, D.: Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks. UCLA Computer Science Department Technical Report UCLA/CSDTR-01-0023 (May 2001)
Handy, M.J., Haase, M., Timmermann, D.: Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection. In: 4th IEEE International Conference on Mobile and Wireless Communications Networks, Stockholm (2002)
Shah, R.C., Rabaey, J.M.: Energy Aware Routing For Low Energy Ad Hoc Sensor Networks. In: Proc. IEEE WCNC 2002 (March 2002)
Kannan, R., Ray, L., Kalidindi, R., Iyengar, S.S.: Threshold-Energy Constrained Routing Protocol for Wireless Sensor Networks. Sensor Letters 1 (December 2003)
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
Kannan, R., Ray, L., Kalidindi, R., Iyengar, S.S. (2004). Max-Min Length-Energy-Constrained Routing in Wireless Sensor Networks. In: Karl, H., Wolisz, A., Willig, A. (eds) Wireless Sensor Networks. EWSN 2004. Lecture Notes in Computer Science, vol 2920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24606-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24606-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20825-9
Online ISBN: 978-3-540-24606-0
eBook Packages: Springer Book Archive