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

Xuedan ZHANG; Jun HONG; Lin ZHANG; Xiuming SHAN; Victor O. K. LI

doi:10.1093/ietcom/e91-b.1.322

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

Xuedan ZHANG, Jun HONG, Lin ZHANG, Xiuming SHAN, Victor O. K. LI

Full Text Views

0

Share
Cite this

Summary :

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 implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work.

Publication: IEICE TRANSACTIONS on Communications Vol.E91-B No.1 pp.322-326

Publication Date: 2008/01/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e91-b.1.322

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Xuedan ZHANG, Jun HONG, Lin ZHANG, Xiuming SHAN, Victor O. K. LI, "CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks" in IEICE TRANSACTIONS on Communications, vol. E91-B, no. 1, pp. 322-326, January 2008, doi: 10.1093/ietcom/e91-b.1.322.
Abstract: 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 implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.1.322/_p

Copy

@ARTICLE{e91-b_1_322,
author={Xuedan ZHANG, Jun HONG, Lin ZHANG, Xiuming SHAN, Victor O. K. LI, },
journal={IEICE TRANSACTIONS on Communications},
title={CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks},
year={2008},
volume={E91-B},
number={1},
pages={322-326},
abstract={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 implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work.},
keywords={},
doi={10.1093/ietcom/e91-b.1.322},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 322
EP - 326
AU - Xuedan ZHANG
AU - Jun HONG
AU - Lin ZHANG
AU - Xiuming SHAN
AU - Victor O. K. LI
PY - 2008
DO - 10.1093/ietcom/e91-b.1.322
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2008
AB - 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 implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work.
ER -