Advanced SearchSearch Tips
Vertex Coloring based Slot Reuse Scheduling for Power Line Communications
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Vertex Coloring based Slot Reuse Scheduling for Power Line Communications
Yoon, Sung-Guk;
  PDF(new window)
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;
 Cited by
S. Galli, A. Scaglione, and Z.Wang, “For the Grid and through the Grid: The Role of Power Line Communications in the Smart Grid,” Proc. IEEE, vol.99, no. 6, pp. 998-1027, Jun. 2011. crossref(new window)

A. Sendin, I. Berganza, A. Arzuaga, A. Pulkkinen, and I. Kim, “Performance Results from 100,000+ PRIME Smart Meters Deployment in Spain,” in Proceedings of IEEE SmartGridComm 2012, Tainan,Taiwan, Nov. 2012.

A. Sendin, J. Simon, I. Urrutia, and I. Berganza, “PLC Deployment and Architecture for Smart Grid Applications in Iberdrola,” in Proceedings of IEEE ISPLC 2014, Glasgow, United Kingdom, Mar.-Apr.2014.

S.-G. Yoon, and S. Bahk, “Adaptive Rate Control and Contention Window Size Adjustment for Power Line Communication,” IEEE Trans. Power Del., vol. 26, no. 2, pp. 809-816, Apr. 2011. crossref(new window)

S. Galli, Y. Masuda, and Y. Urabe, “Time Reuse Algorithms: A Novel Approach to Solving the Issue of Scalability in Dense Power Line Networks,” in Proceedings of IEEE ISPLC 2009, Dresden, Germany, Mar.-Apr. 2009.

L. P. Do and R. Lehnert, “A Channel Allocation Protocol for Providing Fairness Between Users in Multi-Cell PLC Networks,” in Proceedings of IEEE ISPLC 2011, Udine, Italy, Apr. 2011.

L.P. Do and R. Lehnert, “Dynamic Resource Allocation Protocol for Large PLC Networks,” in Proceedings of IEEE ISPLC 2012, Beijing, China, Mar. 2012.

S.S.W. Lee, K.-Y. Li, C.-S. Wu, J.-Y. Pan, and C.-Y. Chuang, “Optimal Bandwidth Guaranteed Routing and Time Slot Assignment for Broadband PLC Access Networks,” in Proceedings of IEEE ISPLC 2012, Beijing, China, Mar. 2012.

A.M. Sarafi, A.C. Voulkidis, and P.G. Cottis, “Optimal TDMA Scheduling in Tree-Based Power-Line Communication Networks,” IEEE Trans. Power Del., vol.29, no. 5, pp. 2189-2196, Oct. 2014.

J. A. Bondy and U. Murthy, Graph Theory with Applications. New York: Elsevier, 1976.

F.T. Leighton, “A Graph Coloring Algorithm for Large Scheduling Problems,” J. Res. Bur. Stand., vol.84, no. 6, pp. 489-506, 1979. crossref(new window)

B.-G. Kim, J.-A. Kwon, and J.-W. Lee, “Subchannel Allocation for the OFDMA-Based Femtocell System,” Computer Networks, vol. 57, no. 17, pp. 3617-3629, Dec. 2013. crossref(new window)

IEEE Std P1901-2010 “Standard for Broadband over Power Line Networks: Medium Access Control and Physical Layer Specifications,” 2010.

K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, “Impact of Interference on Multi-Hop Wireless Network Performance,” Wireless Networks, vol. 11, no. 4, pp. 471-487, Jul. 2005. crossref(new window)

H. Ferreira, L. Lampe, J. Newbury, and T. Swart, Power Line Communications: Theory and Applications for Narrowband and Broadband Communications over Power Lines, John Wiley & Sons, 2010.