{"title":"Requester mobility for mobile crowdsensing system: A dynamic alliance-based incentive mechanism","authors":"Zhilin Xu , Hao Sun , Panfei Sun , Qianqian Kong","doi":"10.1016/j.adhoc.2024.103680","DOIUrl":null,"url":null,"abstract":"<div><div>In the Mobile Crowdsensing (MCS) system, due to the heterogeneity of requesters, they are in mobile which means requesters will join or leave the MCS system at different times and their data demands are time-varying. The uncertainty of requesters caused by requester mobility will generate the instability of the match between requesters and participants which means the established matching algorithm cannot be completed due to the dissatisfaction of requesters and participants caused by the changes in the intensity of competition. For requester mobility, we design a dynamic alliance-based incentive mechanism where requesters can leave, join the MCS system separately, and change their data needs. To the instability, we divide the dynamic mechanism into different stages and will update the matching rules in each stage. A unique algorithm based on the dynamic Stackelberg game and the corresponding updated algorithm is proposed to analyze the matching strategies of requesters and participants to make an optimal match. By proving the stability of the updated rules, we guarantee the stability of the match with requester mobility. Through numerical analysis, alliance formation can significantly reduce weak requesters’ costs by at most 90%. Besides, in our mechanism any requester participates in the game at most twice, the chosen rate can be up to 100%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524002919","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In the Mobile Crowdsensing (MCS) system, due to the heterogeneity of requesters, they are in mobile which means requesters will join or leave the MCS system at different times and their data demands are time-varying. The uncertainty of requesters caused by requester mobility will generate the instability of the match between requesters and participants which means the established matching algorithm cannot be completed due to the dissatisfaction of requesters and participants caused by the changes in the intensity of competition. For requester mobility, we design a dynamic alliance-based incentive mechanism where requesters can leave, join the MCS system separately, and change their data needs. To the instability, we divide the dynamic mechanism into different stages and will update the matching rules in each stage. A unique algorithm based on the dynamic Stackelberg game and the corresponding updated algorithm is proposed to analyze the matching strategies of requesters and participants to make an optimal match. By proving the stability of the updated rules, we guarantee the stability of the match with requester mobility. Through numerical analysis, alliance formation can significantly reduce weak requesters’ costs by at most 90%. Besides, in our mechanism any requester participates in the game at most twice, the chosen rate can be up to 100%.
期刊介绍:
The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to:
Mobile and Wireless Ad Hoc Networks
Sensor Networks
Wireless Local and Personal Area Networks
Home Networks
Ad Hoc Networks of Autonomous Intelligent Systems
Novel Architectures for Ad Hoc and Sensor Networks
Self-organizing Network Architectures and Protocols
Transport Layer Protocols
Routing protocols (unicast, multicast, geocast, etc.)
Media Access Control Techniques
Error Control Schemes
Power-Aware, Low-Power and Energy-Efficient Designs
Synchronization and Scheduling Issues
Mobility Management
Mobility-Tolerant Communication Protocols
Location Tracking and Location-based Services
Resource and Information Management
Security and Fault-Tolerance Issues
Hardware and Software Platforms, Systems, and Testbeds
Experimental and Prototype Results
Quality-of-Service Issues
Cross-Layer Interactions
Scalability Issues
Performance Analysis and Simulation of Protocols.