CP-TDMA: Coloring- and probability-based TDMA scheduling for wireless ad hoc networks

IEICE Transactions on Communications

Volumn E91-B, Issue 1, 2008, Pages 322-326

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

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Edge coloring; Explicit conflict; Implicit conflict; Probability theory; TDMA scheduling; Wireless ad hoc networks

Indexed keywords

AD HOC NETWORKS; PROBABILITY; SCHEDULING; WIRELESS AD HOC NETWORKS;

EDGE COLORING; EXPLICIT CONFLICT; IMPLICIT CONFLICT; PROBABILITY THEORY; TDMA SCHEDULING;

TIME DIVISION MULTIPLE ACCESS;

EID: 58349121440     PISSN: 09168516     EISSN: 17451345     Source Type: Journal    
DOI: 10.1093/ietcom/e91-b.1.322     Document Type: Article

References (12)

1. P. Gupta and P.R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 910-917, 2000.
2. X. Zhang, J. Hong, L. Zhang, X. Shan, and V.O. K. Li, "CC-TDMA: Coloring- and Coding-based multi-channel TDMA scheduling for wireless ad hoc networks," Proc. IEEE WCNC, pp. 133-137, Hong Kong, China, 2007.
3. R. Diestel, Graph Theory, Springer, New York, 2005.
4. A. Panconesi and A. Srinivasan, "Improved distributed algorithms for coloring and network decomposition problems," Proc. ACM Symposium on Theory of Computing, pp. 581-592, 1992.
5. A. Panconesi and A. Srinivasan, "Randomized distributed edge coloring," SIAM J. Comput., vol. 26, no. 2, pp. 350-368, 1997.
6. D.A. Grable and A. Panconesi, "Nearly optimal distributed edge colouring in O (log log n) rounds," Proc. ACM/SIAM Symposium on Discrete Algorithms, pp. 278-285, 1997.
7. S. Gandham, M. Dawande, and R. Prakash, "Link scheduling in sensor networks: Distributed edge coloring revisited," Proc. IEEE INFOCOM, vol. 4, pp. 2492-2501, 2005.
8. J. Misra and D. Gries, "A constructive proof of Vizing's theorem," Inf. Process. Lett., vol. 41, pp. 131-133, 1992.
9. M.V. Marathe, A. Panconesi, and L.D. Risinger JR, "An experimental study of a simple, distributed edge-coloring algorithm," ACM J. Experimental Algorithmics, vol. 9, no. 1.3, pp. 1-22, 2004.
10. G. Zhou, T. He, S. Krishnamurthy, and J.A. Stankovic, "Impact of radio irregularity on wireless sensor networks," Proc. ACM International Conference on Mobile Systems, Applications, and Services, pp. 125-138, 2004.
11. A. Raniwala and T. Chiueh, "Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network," Proc. IEEE Infocom, vol. 3, pp. 2223-2234, 2005.
12. I. Rhee, A. Warrier, J. Min, and L. Xu, "DRAND: Distributed randomized TDMA scheduling for wireless ad-hoc networks," Proc. ACM MobiHOC, pp. 190-201, 2006.