Distributed link scheduling for TDMA mesh networks

IEEE International Conference on Communications

Volumn , Issue , 2007, Pages 3823-3828

  Djukic, Petar ^a   Valaee, Shahrokh ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Bellman ford; Distributed TDMA scheduling; Quality of service

Indexed keywords

AD HOC NETWORKS; BANDWIDTH; COMPUTER SIMULATION; QUALITY OF SERVICE; SCHEDULING; SLOT ANTENNAS; TELECOMMUNICATION LINKS;

AD HOC MESH NETWORKS; BELLMAN-FORD ALGORITHMS; DISTRIBUTED LINK SCHEDULING; LINK SCHEDULING INFORMATION;

TIME DIVISION MULTIPLE ACCESS;

EID: 38549114693     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2007.630     Document Type: Conference Paper

References (15)

1. M. Chee, "The business case for wireless mesh networks," www.no.rtelnetworks.com, December 2003. [Online]. Available: http://www.nortelnetworks.com
2. S. Briedenbach, "Building boom for Wi-Fi networks," http://www.networkworld.com/research/2006/030606- municipal-wi-fi.html, March 2006.
3. "IEEE standard for local and metropolitan area networks part 16: Air interface for fixed broadband wireless access systems," 2004.
4. IEEE, "802.11 TGs MAC enhacement proposal," IEEE, Protocol Proposal IEEE 802.11-05/0575r3, September 2005.
5. P. Djukic and S. Valaee, "Link scheduling for minimum delay in spatial re-use TDMA," in Proceedings of INFOCOM, 2007.
6. R. W. Topor, "Termination detection for distributed computations," Information Processing Letters, vol. 18, no. 1, pp. 33-36, January 1984.
7. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 910-917, September 1988.
8. T. Salonidis and L. Tassiulas, "Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks," in Proceedings of MobiHoc, 2005, pp. 145-156.
9. S. Gandham, M. Dawande, and R. Prakash, "Link scheduling in sensor networks: Distributed edge coloring revisited," in Proceedings of INFOCOM, 2005.
10. J. Shen, I. Nikolaidis, and J. J. Harms, "A DAG-based approach to wireless scheduling," in ICC, 2005, pp. 3142-3148.
11. T. Clausen and P. Jacquet, "Optimized Link State Routing Protocol (OLSR)," RFC 3626 (Experimental), Oct. 2003. [Online]. Available: http://www.ietf.org/rfc/rfc3626.txt
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms. MIT Press, 2001.
13. K. Chandy and J. Misra, "Distributed computation on graphs: Shortest path algorithms," Communications of the ACM, vol. 25, no. 11, pp. 833-827, 1982.
14. D. Bersekas and R. Gallager, Data Networks. Prentice Hall, 1992.
15. A. Vargas, "OMNeT++ Discrete Event Simulation System User Manual," March 2005.