Multi-Constraint Optimal Path Finding for QoS-Enabled Smart Grids: A Combination Approach of Neural Network and Fuzzy System

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Smart Grid (SG) is an intelligent managed network inclusive various data networks. Due to using the two-way data and electricity flows in SG, relations among the network elements are in an efficient way. Path finding optimization is one of the important challenges in SG. In this paper, we propose a routing protocol, namely Neuro-Fuzzy Stable Optimization Multi-Constrained Routing (NFSOMCR), to investigate the optimal path between two nodes in the SG. For this purpose, seven parameters and one cost function are used to meet the important QoS requirements of SG. Depending on the different initializations applied on the parameters, some routes with their constraints are found out by Dijkstra routing algorithm that form the inputs of the Neuro-Fuzzy system. The output of this system is the optimized cost function as well as the optimal paths between two nodes. Experimental results show that the proposed method outperforms existing works in terms of power cost and throughput.
Language:
English
Published:
Journal of Computing and Security, Volume:4 Issue: 2, Summer and Autumn 2017
Pages:
47 to 61
magiran.com/p1937357  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!