基于人工智能传感器转发数据的移动群感网络中的高效路径确定策略

IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jiaoyan Chen , Jin Liu , Zhehao Cheng , Laurence Tianruo Yang , Xianjun Deng , Yihong Chen
{"title":"基于人工智能传感器转发数据的移动群感网络中的高效路径确定策略","authors":"Jiaoyan Chen ,&nbsp;Jin Liu ,&nbsp;Zhehao Cheng ,&nbsp;Laurence Tianruo Yang ,&nbsp;Xianjun Deng ,&nbsp;Yihong Chen","doi":"10.1016/j.comcom.2025.108138","DOIUrl":null,"url":null,"abstract":"<div><div>Selecting a sufficient number of mobile users to collect and upload collected data to the server is a critical issue in the Mobile Crowd-sensing Networks (MCN). Previous studies have assumed that mobile users upload collected data over cellular networks, which could cause heavily burden to users. This work focus on how to forward collected data by pre-deployed wireless sensors which can fuse collected data and operate as edge nodes. Specifically, given the reward paid to each mobile user depends on the time he spends on data collection and uploading, this work investigates the problem how to select Points of Interest (PoIs) and edge nodes for participants who already have schedules with the objective of minimizing the total reward paid to all participants. We boil down this problem to the problem of determining path for each participant which connects participant’s initial location to PoI, then to an edge node and finally to participant’s destination. We formulate it as <em>Paths determination with Cost Minimization</em> problem. We can prove that this problem is an NP-Complete problem. Considering that the sensors acted as edge nodes which may be rechargeable or have limited energy, we design three heuristic algorithms: Minimum Cost Algorithm (MCA), Minimum Cost with Energy Consideration Algorithm (MCECA), and Energy Balance Algorithm (EBA) to address this problem. Finally, we conduct extensive simulations to validate the efficiency of the proposed algorithms. The results demonstrate that MCA finds paths for users with lower cost, while EBA effectively balances the energy consumption of edge nodes.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"236 ","pages":"Article 108138"},"PeriodicalIF":4.5000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient paths determining strategies in Mobile Crowd-sensing Networks with AI-based sensors forwarding data\",\"authors\":\"Jiaoyan Chen ,&nbsp;Jin Liu ,&nbsp;Zhehao Cheng ,&nbsp;Laurence Tianruo Yang ,&nbsp;Xianjun Deng ,&nbsp;Yihong Chen\",\"doi\":\"10.1016/j.comcom.2025.108138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Selecting a sufficient number of mobile users to collect and upload collected data to the server is a critical issue in the Mobile Crowd-sensing Networks (MCN). Previous studies have assumed that mobile users upload collected data over cellular networks, which could cause heavily burden to users. This work focus on how to forward collected data by pre-deployed wireless sensors which can fuse collected data and operate as edge nodes. Specifically, given the reward paid to each mobile user depends on the time he spends on data collection and uploading, this work investigates the problem how to select Points of Interest (PoIs) and edge nodes for participants who already have schedules with the objective of minimizing the total reward paid to all participants. We boil down this problem to the problem of determining path for each participant which connects participant’s initial location to PoI, then to an edge node and finally to participant’s destination. We formulate it as <em>Paths determination with Cost Minimization</em> problem. We can prove that this problem is an NP-Complete problem. Considering that the sensors acted as edge nodes which may be rechargeable or have limited energy, we design three heuristic algorithms: Minimum Cost Algorithm (MCA), Minimum Cost with Energy Consideration Algorithm (MCECA), and Energy Balance Algorithm (EBA) to address this problem. Finally, we conduct extensive simulations to validate the efficiency of the proposed algorithms. The results demonstrate that MCA finds paths for users with lower cost, while EBA effectively balances the energy consumption of edge nodes.</div></div>\",\"PeriodicalId\":55224,\"journal\":{\"name\":\"Computer Communications\",\"volume\":\"236 \",\"pages\":\"Article 108138\"},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2025-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0140366425000957\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366425000957","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient paths determining strategies in Mobile Crowd-sensing Networks with AI-based sensors forwarding data
Selecting a sufficient number of mobile users to collect and upload collected data to the server is a critical issue in the Mobile Crowd-sensing Networks (MCN). Previous studies have assumed that mobile users upload collected data over cellular networks, which could cause heavily burden to users. This work focus on how to forward collected data by pre-deployed wireless sensors which can fuse collected data and operate as edge nodes. Specifically, given the reward paid to each mobile user depends on the time he spends on data collection and uploading, this work investigates the problem how to select Points of Interest (PoIs) and edge nodes for participants who already have schedules with the objective of minimizing the total reward paid to all participants. We boil down this problem to the problem of determining path for each participant which connects participant’s initial location to PoI, then to an edge node and finally to participant’s destination. We formulate it as Paths determination with Cost Minimization problem. We can prove that this problem is an NP-Complete problem. Considering that the sensors acted as edge nodes which may be rechargeable or have limited energy, we design three heuristic algorithms: Minimum Cost Algorithm (MCA), Minimum Cost with Energy Consideration Algorithm (MCECA), and Energy Balance Algorithm (EBA) to address this problem. Finally, we conduct extensive simulations to validate the efficiency of the proposed algorithms. The results demonstrate that MCA finds paths for users with lower cost, while EBA effectively balances the energy consumption of edge nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
×
引用
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学术官方微信