کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
463785 697238 2016 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Ring-like reliable PON planning with physical constraints for a smart grid
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
Ring-like reliable PON planning with physical constraints for a smart grid
چکیده انگلیسی


• The ring-like reliable PON planning of a smart grid has been investigated.
• A mathematical model and an efficient algorithm are proposed.
• Feasible solution can be obtained directly with few processes under constraints.
• CMW-FSA is verified to be effective, and acceptable in time complexity of algorithm.
• The effects of two PON system parameters are evaluated.

Due to the high reliability requirements in the communication networks of a smart grid, a ring-like reliable PON is an ideal choice to carry power distribution information. Economical network planning is also very important for the smart grid communication infrastructure. Although the ring-like reliable PON has been widely used in the real applications, as far as we know, little research has been done on the network optimization subject of the ring-like reliable PON. Most PON planning research studies only consider a star-like topology or cascaded PON network, which barely guarantees the reliability requirements of the smart grid. In this paper, we mainly investigate the economical network planning problem for the ring-like reliable PON of the smart grid. To address this issue, we built a mathematical model for the planning problem of the ring-like reliable PON, and the objective was to minimize the total deployment costs under physical constraints. The model is simplified such that all of the nodes have the same properties, except OLT, because each potential splitter site can be located in the same ONU position in power communication networks. The simplified model is used to construct an optimal main tree topology in the complete graph and a backup-protected tree topology in the residual graph. An efficient heuristic algorithm, called the Constraints and Minimal Weight Oriented Fast Searching Algorithm (CMW-FSA), is proposed. In CMW-FSA, a feasible solution can be obtained directly with oriented constraints and a few recursive search processes. From the simulation results, the proposed planning model and CMW-FSA are verified to be accurate (the error rates are less than 0.4%) and effective compared with the accurate solution (CAESA), especially in small and sparse scenarios. The CMW-FSA significantly reduces the computation time compared with the CAESA. The time complexity algorithm of the CMW-FSA is acceptable and calculated as T(n) = O(n3). After evaluating the effects of the parameters of the two PON systems, the total planning costs of each scenario show a general declining trend and reach a threshold as the respective maximal transmission distances and maximal time delays increase.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Optical Fiber Technology - Volume 27, January 2016, Pages 24–34
نویسندگان
, , ,