A distributed TDMA slot assignment algorithm for wireless sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3121, Issue , 2004, Pages 45-58

  Herman, Ted ^a   Tixeuil, Sébastien ^b  

^a UNIVERSITY OF IOWA   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; SENSOR NODES; TIME DIVISION MULTIPLE ACCESS; TOPOLOGY;

DISTRIBUTED TDMA; DYNAMIC TOPOLOGIES; LOCAL CONVERGENCE; MEDIA ACCESS; NODE FAILURE; POWER REQUIREMENT; TIME DIVISION; TRANSIENT FAULTS;

WIRELESS SENSOR NETWORKS;

EID: 35048842771     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27820-7_6     Document Type: Article

References (24)

1. D. Bertsekas, R. Gallager. Data Networks, Prentice-Hall, 1987.
2. H. L. Bodlaender, T. Kloks, R. B. Tan, J. van Leeuwen. Approximations for λ-coloring of graphs. University of Utrecht, Department of Computer Science, Technical Report 2000-25, 2000 (25 pages).
3. D. E. Culler, J. Hill, P. Buonadonna, R. Szewczyk, A. Woo. A network-centric approach to embedded software for tiny devices. In Proceedings of Embedded Software, First International Workshop EMSOFT 2001, Springer LNCS 2211, pp. 114-130, 2001.
4. S Dolev and T Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 3(4), 1997.
5. S. Ghosh, M. H. Karaata. A self-stabilizing algorithm for coloring planar graphs. Distributed Computing 7:55-59, 1993.
6. M. Gradinariu, C. Johnen. Self-stabilizing neighborhood unique naming under unfair scheduler. In Euro-Par'01 Parallel Processing, Proceedings, Springer LNCS 2150, 2001, pp. 458-465.
7. M. Gradinariu, S. Tixeuil. Self-stabilizing vertex coloration of arbitrary graphs. In 4th International Conference On Principles Of Distributed Systems, OPODIS'2000, 2000, pp. 55-70.
8. M. Haenggi, X. Liu. Fundamental throughput limits in Rayleigh fading sensor networks, in submission, 2003.
9. T Herman, S Tixeuil A distributed TDMA slot assignment algorithm for wireless sensor networks. Technical Report, University of Iowa Department of Computer Science, 2004. CoRR Archive Number cs.DC/0405042.
10. J. Kahn, R. Katz, and K. Pister. Next century challenges: mobile networking for "smart dust". In Proceedings of the Fifth Annual International Conference on Mobile Computing and Networking (MOBICOM '99), 1999.
11. S. O. Krumke, M. V. Marathe, S. S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7(6 2001):575-584.
12. F. Kuhn, R. Wattenhofer. 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.
13. S. S. Kulkarni, U. Arumugam. Collision-free communication in sensor networks. In Proceedings of Self-Stabilizing Systems, 6th International Symposium, Springer LNCS 2704, 2003, pp. 17-31.
14. S. S. Kulkarni and U. Arumugam. Transformations for Write-All-With- Collision Model. In Proceedings of the 7th International Conference on Principles of Distributed Systems (OPODIS), Springer LNCS, 12/03. (Martinique, French West Indies, France).
15. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 15:1036-1053, 1986.
16. M. Mizuno, M. Nesterenko. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Information Processing Letters 66 (6 1998):285-290.
17. S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5(2 1999):81-94.
18. S. Ramanathan, E. L. Lloyd. Scheduling algorithms for multi-hop radio networks. IEEE/ACM Transactions on Networking, 1(2 1993): 166-177.
19. S. Shukla, D. Rosenkrantz, and S. Ravi. Developing self-stabilizing coloring algorithms via systematic randomization. In Proceedings of the International Workshop on Parallel Processing, pages 668-673, Bangalore, India, 1994. Tata-McGrawhill, New Delhi.
20. S. Shukla, D. Rosenkrantz, and S. Ravi. Observations on self-stabilizing graph algorithms for anonymous networks. In Proceedings of the Second Workshop on Self-stabilizing Systems (WSS'95), pages 7.1-7.15, 1995.
21. S. Sur and P. K. Srimani. A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences, 69:219-227, 1993.
22. G. Tel. Introduction to Distributed Algorithms, Cambridge University Press, 1994.
23. A. Woo, D. Culler. 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.
24. F. Zhao, L. Guibas (Editors). Proceedings of Information Processing in Sensor Networks, Second International Workshop, IPSN 2003, Springer LNCS 2634. April, 2003.