Transmission scheduling in sensor networks via directed edge coloring

Maggie Cheng, Li Yin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Scopus citations

Abstract

This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast 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.

Original languageEnglish (US)
Title of host publication2007 IEEE International Conference on Communications, ICC'07
Pages3710-3715
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: Jun 24 2007Jun 28 2007

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2007 IEEE International Conference on Communications, ICC'07
Country/TerritoryUnited Kingdom
CityGlasgow, Scotland
Period6/24/076/28/07

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Keywords

  • Edge coloring
  • MAC
  • Sensor networks
  • TDMA
  • Vertex coloring

Fingerprint

Dive into the research topics of 'Transmission scheduling in sensor networks via directed edge coloring'. Together they form a unique fingerprint.

Cite this