An efficient broadcast scheduling algorithm for TDMA ad-hoc networks

In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a time division multiple access frame. In order to minimize the system delay, the optimal schedule must be defined as the one that has the minimum frame length and provides the maximum slot utilization. The proposed algorithm is based on the sequential vertex coloring algorithm. Numerical examples and comparisons with the algorithm in previous research have shown that the proposed algorithm can find near-optimal solutions in respect of the system delay.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2002-11
Language
ENG
Citation

COMPUTERS OPERATIONS RESEARCH, v.29, no.13, pp.1793 - 1806

ISSN
0305-0548
DOI
10.1016/S0305-0548(01)00057-0
URI
http://hdl.handle.net/10203/2071
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 757
  • Download : 17
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 42 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0