An integrated MCDM-based charging scheduling in a WRSN with multiple MCs

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Man Gun Ri, Il Gwang Kim, Se Hun Pak, Nam Jun Jong, Song Jo Kim
{"title":"An integrated MCDM-based charging scheduling in a WRSN with multiple MCs","authors":"Man Gun Ri, Il Gwang Kim, Se Hun Pak, Nam Jun Jong, Song Jo Kim","doi":"10.1007/s12083-024-01705-y","DOIUrl":null,"url":null,"abstract":"<p>Recently, a few Multi-Criteria Decision Making (MCDM)-based charging scheduling schemes have been proposed. However, these schemes have still connoted the problems from the viewpoint of assigning weights to multi-criteria and exploiting redundant capability of a Mobile Charger (MC). In this paper, we propose an efficient charging scheduling scheme using an integrated FCNP-TOPSIS to solve the above-mentioned problems. The proposed scheme firstly divides the whole network into sub-areas by using the Fuzzy C-Means (FCM) algorithm so as to evenly distribute charging request load into multiple MCs and assign a MC to each sub-area. Next, each MC draws up a charging schedule into on-demand or semi-on-demand charging scheduling scheme according to the MC’s charging capability and the number of charging Request Nodes (cRNs). In charging scheduling, first the Fuzzy Cognitive Network Process (FCNP) assigns the relative weights to multi-criteria to characterize the cRNs and predict the potential-to-be-Bottlenecked Nodes (pBNs). Then the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) selects the most suitable next charging location for on-demand charging scheduling and the proactive charging nodes among the predicted pBNs for semi-on-demand charging scheduling. While drawing up the on-demand charging schedule, the partial charging time at each charging location is calculated considering the weights of multi-criteria by FCNP. Extensive simulation experiments have been conducted to show that the proposed scheme greatly improves the charging and network performance at various performance metrics compared to existing schemes. In special, if the number of nodes is 650, the network lifetime of the proposed scheme is 129.4%, 239.8%, 282.5%, 283.2% and 293.6% longer compared to the FAHP-VWA-TOPSIS, FLCSD, AHP-TOPSIS, OPPC, and NJNP schemes, respectively.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"13 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Peer-To-Peer Networking and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12083-024-01705-y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, a few Multi-Criteria Decision Making (MCDM)-based charging scheduling schemes have been proposed. However, these schemes have still connoted the problems from the viewpoint of assigning weights to multi-criteria and exploiting redundant capability of a Mobile Charger (MC). In this paper, we propose an efficient charging scheduling scheme using an integrated FCNP-TOPSIS to solve the above-mentioned problems. The proposed scheme firstly divides the whole network into sub-areas by using the Fuzzy C-Means (FCM) algorithm so as to evenly distribute charging request load into multiple MCs and assign a MC to each sub-area. Next, each MC draws up a charging schedule into on-demand or semi-on-demand charging scheduling scheme according to the MC’s charging capability and the number of charging Request Nodes (cRNs). In charging scheduling, first the Fuzzy Cognitive Network Process (FCNP) assigns the relative weights to multi-criteria to characterize the cRNs and predict the potential-to-be-Bottlenecked Nodes (pBNs). Then the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) selects the most suitable next charging location for on-demand charging scheduling and the proactive charging nodes among the predicted pBNs for semi-on-demand charging scheduling. While drawing up the on-demand charging schedule, the partial charging time at each charging location is calculated considering the weights of multi-criteria by FCNP. Extensive simulation experiments have been conducted to show that the proposed scheme greatly improves the charging and network performance at various performance metrics compared to existing schemes. In special, if the number of nodes is 650, the network lifetime of the proposed scheme is 129.4%, 239.8%, 282.5%, 283.2% and 293.6% longer compared to the FAHP-VWA-TOPSIS, FLCSD, AHP-TOPSIS, OPPC, and NJNP schemes, respectively.

Abstract Image

具有多个 MC 的 WRSN 中基于 MCDM 的综合充电调度
最近,人们提出了一些基于多标准决策(MCDM)的充电调度方案。然而,这些方案仍存在多标准权重分配和利用移动充电器(MC)冗余能力的问题。本文提出了一种利用集成 FCNP-TOPSIS 的高效充电调度方案来解决上述问题。该方案首先利用模糊 C-Means 算法将整个网络划分为多个子区域,以便将充电请求负载平均分配给多个 MC,并为每个子区域分配一个 MC。接下来,每个 MC 根据 MC 的充电能力和充电请求节点(cRN)的数量制定充电计划,分为按需或半按需充电调度方案。在充电调度过程中,首先采用模糊认知网络过程(FCNP)对多标准进行相对权重分配,以确定 cRN 的特征并预测潜在瓶颈节点(pBN)。然后,通过与理想解相似的排序偏好技术(TOPSIS)为按需充电调度选择最合适的下一个充电地点,并为半按需充电调度从预测的 pBN 中选择主动充电节点。在制定按需充电计划时,通过 FCNP 计算每个充电地点的部分充电时间,并考虑多标准的权重。广泛的仿真实验表明,与现有方案相比,拟议方案在各种性能指标上大大提高了充电和网络性能。具体而言,如果节点数为 650 个,与 FAHP-VWA-TOPSIS、FLCSD、AHP-TOPSIS、OPPC 和 NJNP 方案相比,拟议方案的网络寿命分别延长了 129.4%、239.8%、282.5%、283.2% 和 293.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Peer-To-Peer Networking and Applications
Peer-To-Peer Networking and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
8.00
自引率
7.10%
发文量
145
审稿时长
12 months
期刊介绍: The aim of the Peer-to-Peer Networking and Applications journal is to disseminate state-of-the-art research and development results in this rapidly growing research area, to facilitate the deployment of P2P networking and applications, and to bring together the academic and industry communities, with the goal of fostering interaction to promote further research interests and activities, thus enabling new P2P applications and services. The journal not only addresses research topics related to networking and communications theory, but also considers the standardization, economic, and engineering aspects of P2P technologies, and their impacts on software engineering, computer engineering, networked communication, and security. The journal serves as a forum for tackling the technical problems arising from both file sharing and media streaming applications. It also includes state-of-the-art technologies in the P2P security domain. Peer-to-Peer Networking and Applications publishes regular papers, tutorials and review papers, case studies, and correspondence from the research, development, and standardization communities. Papers addressing system, application, and service issues are encouraged.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信