Efficient paths determining strategies in Mobile Crowd-sensing Networks with AI-based sensors forwarding data

IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Communications Pub Date : 2025-04-15 Epub Date: 2025-03-13 DOI:10.1016/j.comcom.2025.108138
Jiaoyan Chen , Jin Liu , Zhehao Cheng , Laurence Tianruo Yang , Xianjun Deng , Yihong Chen
{"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.3000,"publicationDate":"2025-04-15","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":"2025/3/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于人工智能传感器转发数据的移动群感网络中的高效路径确定策略
在移动人群感知网络(MCN)中,选择足够数量的移动用户来收集和上传收集到的数据到服务器是一个关键问题。以前的研究假设移动用户通过蜂窝网络上传收集到的数据,这可能会给用户带来沉重的负担。本文主要研究如何通过预部署的无线传感器来转发收集到的数据,这些传感器可以融合收集到的数据并作为边缘节点运行。具体来说,考虑到支付给每个移动用户的奖励取决于他在数据收集和上传上花费的时间,本工作研究了如何为已经有时间表的参与者选择兴趣点(PoIs)和边缘节点的问题,目标是最小化支付给所有参与者的总奖励。我们将这个问题归结为确定每个参与者的路径问题,该路径将参与者的初始位置连接到PoI,然后连接到边缘节点,最后连接到参与者的目的地。我们将其表述为具有成本最小化问题的路径确定。我们可以证明这个问题是一个np完全问题。考虑到传感器作为边缘节点可能是可充电的或能量有限的,我们设计了三种启发式算法:最小成本算法(MCA)、最小成本与能量考虑算法(MCECA)和能量平衡算法(EBA)来解决这一问题。最后,我们进行了大量的仿真来验证所提出算法的效率。结果表明,MCA以较低的成本为用户找到路径,而EBA有效地平衡了边缘节点的能量消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Digital Twins for smart campus networks: An end-to-end framework for multi-domain data intelligence Multimedia's multicast broadcast services (MBS) over vehicles in the cellular network using the standard deviation-oriented grouping mechanism V2X rebroadcasting for C-V2X communications Enabling ML-driven threat detection: An analysis of IoT network traffic datasets AssertGPT: LLM-driven assertion generation for programmable networks verification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1