Abstract
This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicasting and broadcast communication. the algorithm employs edge coloring on a directed graph for transmission scheduling. It is different from previous works that use vertex coloring of a graph for node scheduling, or those that use edge coloring of undirected graphs for link scheduling. the proposed algorithm uses the least number of time slots compared to its counterparts and it avoids both the hidden terminal problem and the exposed terminal problem in both unicast and broadcast communication. ©2007 IEEE.
Recommended Citation
M. X. Cheng and L. Yin, "Transmission Scheduling in Sensor Networks Via Directed Edge Coloring," IEEE International Conference on Communications, pp. 3710 - 3715, article no. 4289282, Institute of Electrical and Electronics Engineers, Dec 2007.
The definitive version is available at https://doi.org/10.1109/ICC.2007.611
Department(s)
Computer Science
Keywords and Phrases
Edge coloring; MAC; Sensor networks; TDMA; Vertex coloring
International Standard Book Number (ISBN)
978-142440353-0
International Standard Serial Number (ISSN)
0536-1486
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Dec 2007
