CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks

@article{Zhang2008CPTDMACA,
  title={CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks},
  author={Xuedan Zhang and Jun Hong and Lin Zhang and Xiuming Shan and Victor O. K. Li},
  journal={IEICE Transactions},
  year={2008},
  volume={91-B},
  pages={322-326}
}
This paper addresses the issue of transmission scheduling in wireless ad hoc networks. We propose a Time Division Multiple Access (TDMA) scheduling scheme based on edge coloring and probabilistic assignment, called CP-TDMA. We categorize the conflicts suffered by wireless links into two types: explicit conflicts and implicit conflicts, and utilize two different strategies to deal with them. Explicit conflicts are avoided completely by a simple distributed edge-coloring algorithm ƒÊ-M, and… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
6 Extracted Citations
12 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 12 references

X

  • X. Zhang, J. Hong, L. Zhang
  • Shan, and V.O.K. Li, •gCC-TDMA: Coloring- and…
  • 2007
1 Excerpt

and L

  • I. Rhee, A. Warrier, J. Min
  • Xu, •gDRAND: Distributed randomized TDMA…
  • 2006
1 Excerpt

Graph Theory

  • R. Diestel
  • Springer, New York
  • 2005
1 Excerpt

and R

  • S. Gandham, M. Dawande
  • Prakash, •gLink scheduling in sensor networks…
  • 2005
1 Excerpt

S

  • G. Zhou, T. He
  • Krishnamurthy, and J.A. Stankovic, •gImpact of…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…