<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">JERA</journal-id><journal-title-group><journal-title>Journal of Electronic Research and Application</journal-title></journal-title-group><issn>2208-3502</issn><eissn>2208-3510</eissn><publisher><publisher-name>Bio-Byword Scientific Publishing Pty. Ltd.</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26689/jera.v8i3.7214</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>Optimizing Spatial Crowdsourcing: A Quality-Aware Task Assignment Approach for Mobile Communication</title><url>https://artdesignp.com/journal/JERA/8/3/10.26689/jera.v8i3.7214</url><author>WengJiali,XieXike</author><pub-date pub-type="publication-year"><year>2024</year></pub-date><volume>8</volume><issue>3</issue><history><date date-type="pub"><published-time>2024-06-14</published-time></date></history><abstract>The widespread use of advanced electronic devices has led to the emergence of spatial crowdsourcing, a method that taps into collective efforts to perform real-world tasks like environmental monitoring and traffic surveillance. Our research focuses on a specific type of spatial crowdsourcing that involves ongoing, collaborative efforts for continuous spatial data acquisition. However, due to limited budgets and workforce availability, the collected data often lacks completeness, posing a data deficiency problem. To address this, we propose a reciprocal framework to optimize task assignments by leveraging the mutual benefits of spatiotemporal subtask execution. We introduce an entropy-based quality metric to capture the combined effects of incomplete data acquisition and interpolation imprecision. Building on this, we explore a quality-aware task assignment method, corresponding to spatiotemporal assignment strategies. Since the assignment problem is NP-hard, we develop a polynomial-time algorithm with the guaranteed approximation ratio. Novel indexing and pruning techniques are proposed to further enhance performance. Extensive experiments conducted on datasets validate the effectiveness of our methods.</abstract><keywords/></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>Ye G, Zhao Y, Chen X, et al., 2021, Proceedings of the 30th ACM International Conference on Information &amp; Knowledge Management, November 1–5, 2021: Task Allocation with Geographic Partition in Spatial Crowdsourcing, Association for Computing Machinery, New York, 2404–2413.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B2" content-type="article"><label>2</label><element-citation publication-type="journal"><p>Kazemi L, Shahabi C, 2018, Proceedings of the 20th International Conference on Advances in Geographic Information Systems, November 6–9: GeoCrowd: Enabling Query Answering with Spatial Crowdsourcing, Association for Computing Machinery, New York, 189–198.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B3" content-type="article"><label>3</label><element-citation publication-type="journal"><p>Xia J, Zhao Y, Liu G, et al., 2019, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, August 10–16, 2019: Profit-Driven Task Assignment in Spatial Crowdsourcing. Macao, 1914–1920</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B4" content-type="article"><label>4</label><element-citation publication-type="journal"><p>Chen X, Zhao Y, Zheng K, et al., 2022, 2022 IEEE 38th International Conference on Data Engineering (ICDE), May 9–12, 2022: Influence-Aware Task Assignment in Spatial Crowdsourcing. Kuala Lumpur, 2141–2153.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B5" content-type="article"><label>5</label><element-citation publication-type="journal"><p>Karam R, Melchiori M, 2013, Proceedings of the Joint EDBT/ICDT 2013 Workshops, March 18–22, 2013: Improving Geo-Spatial Linked Data with the Wisdom of the Crowds Association for Computing Machinery. New York, 68–74.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B6" content-type="article"><label>6</label><element-citation publication-type="journal"><p>Wang T, Xie X, Cao X, et al., 2021, 2021 IEEE 37th International Conference on Data Engineering (ICDE), April 19–22, 2021: On Efficient and Scalable Time-Continuous Spatial Crowdsourcing. Chania, 1212–1223.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B7" content-type="article"><label>7</label><element-citation publication-type="journal"><p>Krause A, Guestrin C, 2005, A Note on the Budgeted Maximization of Submodular Functions, Carnegie Mellon University.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B8" content-type="article"><label>8</label><element-citation publication-type="journal"><p>Guttman A, 1984, R Trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD Record, 14(2): 47–57. https://doi.org/10.1145/971697.602266</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
