Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Optimal bandwidth guaranteed routing and time slot assignment for broadband PLC access networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Lee, S.S.W. ; Dept. of Commun. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Kuang-Yi Li ; Cheng-Shong Wu ; Jen-Yi Pan
more authors

High infrastructure availability, easy installation, and low device cost make PLC become one of the promising technologies for broadband communication. In PLC based access network, relay nodes are deployed to extend network coverage and enhance communication quality. In this paper, we consider the bandwidth guaranteed routing and time slot assignment problem in multi-hop PLC networks. Spatial reuse is considered in our system so multiple communication pairs can work at the same time if they do not interfere each other. In particular, our design takes channel quality into consideration in determining the optimal routing. Depending on the receiver node, the sender node uses the best modulation scheme to maximize transmission rate. We formulate the problem as an integer linear programming (ILP) problem. The objective is to minimize the time usage for total data delivery. The output includes optimal routing and collision free slot assignment for each node. To reduce the computation time, we propose a multi-section based algorithm to resolve the problem. We have carried out extensive numerical experiments on several network topologies. Numerical results reveal that the proposed approach obtains significant performance improvement on network resource usage compared to those without taking spatial reuse, routing, and rate adaptation into account.

Published in:

Power Line Communications and Its Applications (ISPLC), 2012 16th IEEE International Symposium on

Date of Conference:

27-30 March 2012