Vertex Coloring based Slot Reuse Scheduling for Power Line Communications

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

키워드

Conflict graph; Power line communications; Scheduling; Vertex coloring algorithm
제목
Vertex Coloring based Slot Reuse Scheduling for Power Line Communications
저자
Yoon, Sung-Guk
DOI
10.5370/JEET.2015.10.5.2135
발행일
2015-09
유형
Article
저널명
Journal of Electrical Engineering & Technology
권
10
호
5
페이지
2135 ~ 2141