Abstract
Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule transmission in slots to avoid collision, however these methods often lack scalability when implemented in ad hoc networks subject to node failures and dynamic topology. This paper reports a distributed algorithm for TDMA slot assignment that is self-stabilizing to transient faults and dynamic topology change. The expected local convergence time is O(1) for any size network satisfying a constant bound on the size of a node neighborhood.
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
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)
Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for λ- coloring of graphs. University of Utrecht, Department of Computer Science, Technical Report 2000-25 (2000 ) (25 pages)
Culler, D.E., Hill, J., Buonadonna, P., Szewczyk, R., Woo, A.: A network-centric approach to embedded software for tiny devices. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 114–130. Springer, Heidelberg (2001)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 3(4) (1997)
Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing 7, 55–59 (1993)
Gradinariu, M., Johnen, C.: Self-stabilizing neighborhood unique naming under unfair scheduler. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 458–465. Springer, Heidelberg (2001)
Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloration of arbitrary graphs. In: 4th International Conference On Principles Of DIstributed Systems, OPODIS 2000, pp. 55–70 (2000)
Haenggi, M., Liu, X.: Fundamental throughput limits in Rayleigh fading sensor networks (2003) (in submission)
Herman, T.,Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. Technical Report, University of Iowa Department of Computer Science, CoRR Archive Number cs.DC/0405042 (2004)
Kahn, J., Katz, R., Pister, K.: Next century challenges: mobile networking for ”smart dust”. In: Proceedings of the Fifth Annual International Conference on Mobile Computing and Networking, MOBICOM 1999 (1999)
Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7(6), 575–584 (2001)
Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 25–32 (2003)
Kulkarni, S.S., Arumugam, U.: Collision-free communication in sensor networks. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 17–31. Springer, Heidelberg (2003)
Kulkarni, S.S., Arumugam, U.: Transformations for Write-All-With-Collision Model. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol. 3144, pp. 184–197. Springer, Heidelberg (2004)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 15, 1036–1053 (1986)
Mizuno, M., Nesterenko, M.: A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Information Processing Letters 66(6), 285–290 (1998)
Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5(2), 81–94 (1999)
Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hop radio networks. IEEE/ACM Transactions on Networking 1(2), 166–177 (1993)
Shukla, S., Rosenkrantz, D., Ravi, S.: Developing self-stabilizing coloring algorithms via systematic randomization. In: Proceedings of the International Workshop on Parallel Processing, Bangalore, India, pp. 668–673. Tata-McGrawhill, New Delhi (1994)
Shukla, S., Rosenkrantz, D., Ravi, S.: Observations on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of the Second Workshop on Self-stabilizing Systems (WSS 1995), pp. 71–715 (1995)
Sur, S., Srimani, P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences 69, 219–227 (1993)
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)
Woo, A., Culler, D.: A transmission control scheme for media access in sensor networks. In: Proceedings of the Seventh International Conference on Mobile Computing and Networking (Mobicom 2001), pp. 221–235 (2001)
F. Zhao, L. Guibas (Editors). Proceedings of Information Processing in Sensor Networks, Second International Workshop, IPSN 2003, Springer LNCS 2634. April, 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
Herman, T., Tixeuil, S. (2004). A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2004. Lecture Notes in Computer Science, vol 3121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27820-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-27820-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22476-1
Online ISBN: 978-3-540-27820-7
eBook Packages: Springer Book Archive