CC-TDMA: Coloring- and coding-based multi-channel TDMA scheduling for wireless ad hoc networks

IEEE Wireless Communications and Networking Conference, WCNC

Volumn , Issue , 2007, Pages 133-137

  Zhang, Xuedan ^a   Hong, Jun ^a   Zhang, Lin ^a   Shan, Xiuming ^a   Li, Victor O K ^b  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; COMPUTER SIMULATION; SCHEDULING ALGORITHMS; SIGNAL ENCODING; TELECOMMUNICATION LINKS;

ALGEBRAIC CODING THEORY; EDGE-COLORING ALGORITHMS; WIRELESS LINKS;

TIME DIVISION MULTIPLE ACCESS;

EID: 36349031707     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2007.30     Document Type: Conference Paper

References (12)

1. R. Diestel. Graph theory. Springer, New York, 2005.
2. A. Panconesi and A. Srinivasan, "Improved Distributed Algorithms for Coloring and Network Decomposition Problems," In Proc. of ACM Symposium on Theory of Computing, 1992, pp. 581-592.
3. A. Panconesi and A. Srinivasan, "Randomized Distributed Edge Coloring," SIAM Journal on Computing, 26(2):350-368, 1997.
4. D. A. Grable and A. Panconesi, "Nearly optimal distributed edge colouring in O(log log n) rounds," In Proc. of ACM/SIAM Symposium on Discrete Algorithms, 1997, pp. 278-285.
5. S. Gandham, M. Dawande and R. Prakash, "Link scheduling in sensor networks: Distributed edge coloring revisited," In Proc. of IEEE INFOCOM, 2005, vol. 4, pp. 2492-2501.
6. J. Misra and D. Gries, "A Constructive Proof of Vizing's Theorem," Information Processing Letters, 41:131-133, 1992.
7. M. V. Marathe, A. Panconesi and L. D. Risinger JR, "An experimental study of a simple, distributed edge-coloring algorithm," A CM Journal of Experimental Algorithmics, vol. 9, No. 1.3, pp. 1-22, 2004.
8. G. Zhou, T. He, S. Krishnamurthy, and J. A. Stankovic, "Impact of radio irregularity on wireless sensor networks," In Proc. of ACM International Conference on Mobile Systems, Applications, and Services, 2004, pp. 125-138.
9. I. Chlamtac and A. Farago, "Making transmission schedules immune to topology changes in multi-hop packet radio networks," IEEE/ACM Transactions on Networking, vol. 2, No. 1, pp. 23-29, Feb. 1994.
10. J. H. Ju and V. O. K. Li, "An optimal topology-transparent scheduling method in multi-hop packet radio networks," IEEE/ACM Transactions on Networking, vol. 6, No. 3, pp. 298-306, Jun. 1998.
11. C. H. Rentel and T. Kunz, "MAC coding for QoS guarantees in multihop mobile wireless networks," In Proc. of ACM International Workshop on Quality of Service. & Security in Wireless and Mobile Networks, 2005, pp. 39-46.
12. J. H. Ju and V. O. K. Li, "TDMA Scheduling Design of Multihop Packet Radio Networks Based on Latin Squares", IEEE Journal on Selected Areas in Communications, vol. 17, iss. 8, pp. 1345-1352, Aug. 1999.