TY - GEN
T1 - An analytical study of GWAP-based geospatial tagging systems
AU - Chen, Ling Jyh
AU - Syu, Yu Song
AU - Wang, Bo Chun
AU - Lee, Wang Chien
PY - 2009
Y1 - 2009
N2 - Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the development of future location-based services. Conventional geotagging systems share some limitations, such as the use of a two-phase operating model and the tendency to tag popular objects with simple contexts. To address these problems, geotagging systems based on the concept of 'Games with a Purpose' (GWAP) have been developed recently. In this study, we use analysis to investigate these new systems. Based on our analysis results, we design three metrics to evaluate the system performance, and develop five task assignment algorithms for a GWAP-based system. Using a comprehensive set of simulations under both synthetic and realistic mobility scenarios, we find that the Least-Throughput-First Assignment algorithm (LTFA)is the most effective approach because it can achieve competitive system utility, while its computational complexity remains moderate. We also find that, to improve the system utility, it is better to assign as many tasks as possible in each round. However, because players may feel annoyed if too many tasks are assigned at the same time, it is recommended that multiple tasks be assigned one by one in each round in order to achieve higher system utility.
AB - Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the development of future location-based services. Conventional geotagging systems share some limitations, such as the use of a two-phase operating model and the tendency to tag popular objects with simple contexts. To address these problems, geotagging systems based on the concept of 'Games with a Purpose' (GWAP) have been developed recently. In this study, we use analysis to investigate these new systems. Based on our analysis results, we design three metrics to evaluate the system performance, and develop five task assignment algorithms for a GWAP-based system. Using a comprehensive set of simulations under both synthetic and realistic mobility scenarios, we find that the Least-Throughput-First Assignment algorithm (LTFA)is the most effective approach because it can achieve competitive system utility, while its computational complexity remains moderate. We also find that, to improve the system utility, it is better to assign as many tasks as possible in each round. However, because players may feel annoyed if too many tasks are assigned at the same time, it is recommended that multiple tasks be assigned one by one in each round in order to achieve higher system utility.
UR - http://www.scopus.com/inward/record.url?scp=76349109048&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=76349109048&partnerID=8YFLogxK
U2 - 10.4108/ICST.COLLABORATECOM2009.8322
DO - 10.4108/ICST.COLLABORATECOM2009.8322
M3 - Conference contribution
AN - SCOPUS:76349109048
SN - 9789639799769
T3 - 2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2009
BT - 2009 5th International Conference on Collaborative Computing
T2 - 2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2009
Y2 - 11 November 2009 through 14 November 2009
ER -