Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application
Orienteering, a sport that combines navigation with running, requires efficient route planning and real-time decision-making, which can benefit significantly from mobile crowdsensing (MCS) technologies. MCS enables the platform to provide data-based service by incentivizing mobile users to perform s...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10818425/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841557021657137152 |
|---|---|
| author | Xia Hua Lei Han |
| author_facet | Xia Hua Lei Han |
| author_sort | Xia Hua |
| collection | DOAJ |
| description | Orienteering, a sport that combines navigation with running, requires efficient route planning and real-time decision-making, which can benefit significantly from mobile crowdsensing (MCS) technologies. MCS enables the platform to provide data-based service by incentivizing mobile users to perform sensing tasks and gathering sensing data from them. An extremely important problem in MCS is how to achieve effective task allocation in the context of participatory sensing, where mobile users are selectively recruited to perform tasks. However, most current work in this aspect does not consider the condition where multiple time constraints coexist, but models the problem from a single time constraint. Moreover, only a very small number of studies have paid attention to the characteristics of user destinations. Therefore, according to the shortcomings of the above research, we propose a multi-time-constrained task allocation based on origin-destination users (TAOD) problem in MCS for orienteering application, which is proved to be NP-hard. In order to solve the TAOD problem, we firstly design a path reconnection algorithm based on double-ended priority queue (PR-DEPQ) for the single-user scenario. Then, we extend the PR-DEPQ to multi-user task allocation scenario and present a multi-user path reconnection algorithm based on sensing value priority (MUPR). Extensive simulation results show the higher performance of our proposed MUPR as compared with the existing baseline algorithms. |
| format | Article |
| id | doaj-art-7544f2edbcdd4445b40285dc24c817c8 |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-7544f2edbcdd4445b40285dc24c817c82025-01-07T00:01:53ZengIEEEIEEE Access2169-35362025-01-01131974198510.1109/ACCESS.2024.352394810818425Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering ApplicationXia Hua0https://orcid.org/0000-0002-4995-9816Lei Han1https://orcid.org/0009-0002-2516-168XDepartment of Physical Education, China University of Petroleum (East China), Qingdao, ChinaDepartment of Physical Education, China University of Petroleum (East China), Qingdao, ChinaOrienteering, a sport that combines navigation with running, requires efficient route planning and real-time decision-making, which can benefit significantly from mobile crowdsensing (MCS) technologies. MCS enables the platform to provide data-based service by incentivizing mobile users to perform sensing tasks and gathering sensing data from them. An extremely important problem in MCS is how to achieve effective task allocation in the context of participatory sensing, where mobile users are selectively recruited to perform tasks. However, most current work in this aspect does not consider the condition where multiple time constraints coexist, but models the problem from a single time constraint. Moreover, only a very small number of studies have paid attention to the characteristics of user destinations. Therefore, according to the shortcomings of the above research, we propose a multi-time-constrained task allocation based on origin-destination users (TAOD) problem in MCS for orienteering application, which is proved to be NP-hard. In order to solve the TAOD problem, we firstly design a path reconnection algorithm based on double-ended priority queue (PR-DEPQ) for the single-user scenario. Then, we extend the PR-DEPQ to multi-user task allocation scenario and present a multi-user path reconnection algorithm based on sensing value priority (MUPR). Extensive simulation results show the higher performance of our proposed MUPR as compared with the existing baseline algorithms.https://ieeexplore.ieee.org/document/10818425/Mobile crowdsensingtask allocationmultiple time constraintsdestinationorienteering |
| spellingShingle | Xia Hua Lei Han Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application IEEE Access Mobile crowdsensing task allocation multiple time constraints destination orienteering |
| title | Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application |
| title_full | Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application |
| title_fullStr | Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application |
| title_full_unstemmed | Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application |
| title_short | Destination-Aware Time-Constrained Task Allocation in Mobile Crowdsensing for Orienteering Application |
| title_sort | destination aware time constrained task allocation in mobile crowdsensing for orienteering application |
| topic | Mobile crowdsensing task allocation multiple time constraints destination orienteering |
| url | https://ieeexplore.ieee.org/document/10818425/ |
| work_keys_str_mv | AT xiahua destinationawaretimeconstrainedtaskallocationinmobilecrowdsensingfororienteeringapplication AT leihan destinationawaretimeconstrainedtaskallocationinmobilecrowdsensingfororienteeringapplication |