{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:36:32Z","timestamp":1747190192925,"version":"3.40.5"},"reference-count":12,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T00:00:00Z","timestamp":1569715200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Information Systems"],"published-print":{"date-parts":[[2019,9,29]]},"abstract":"<jats:p>To achieve privacy protection in the k-anonymity algorithm, replacing the starting positions of <jats:italic>k<\/jats:italic> users with the center of the cloaked area results in the route from the starting position to the center of the cloaked area probably nonlinear, which will bring out the inconvenience for the user. This paper proposes a new anonymous server framework, on which we add the function of electronic map and navigation compared to the original one based on the framework of k-anonymity for LBS. In addition to the original tasks including computing the center of cloaked area <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mi>O<\/mml:mi><\/mml:math> and the actual query result <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:msub><mml:mrow><mml:mi>r<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> corresponding to the query <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mrow><mml:msub><mml:mrow><mml:mi>q<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math>, the anonymous server with the new architecture will plan the actual path <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\"><mml:mrow><mml:msub><mml:mrow><mml:mi>l<\/mml:mi><\/mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>o<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><mml:mo>\u2212<\/mml:mo><mml:mi>O<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> from the starting query location <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\"><mml:mrow><mml:msub><mml:mrow><mml:mi>o<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> to the center of the cloaked area <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\"><mml:mi>O<\/mml:mi><\/mml:math> and return the new result collection of <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M7\"><mml:mrow><mml:mfenced open=\"{\" close=\"}\" separators=\"|\"><mml:mrow><mml:msub><mml:mrow><mml:mi>r<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><mml:mo>,<\/mml:mo><mml:msub><mml:mrow><mml:mi>r<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>O<\/mml:mi><mml:mo>\u2212<\/mml:mo><mml:mi>s<\/mml:mi><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:mfenced><\/mml:mrow><\/mml:math> for the user <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M8\"><mml:mrow><mml:msub><mml:mrow><mml:mi>u<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math>. Moreover, this paper improves the algorithm of computing the route <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M9\"><mml:mrow><mml:msub><mml:mrow><mml:mi>r<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>O<\/mml:mi><mml:mo>\u2212<\/mml:mo><mml:mi>s<\/mml:mi><mml:mi>i<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> to make it more in line with the actual situation of road network operation. Finally, we prove the importance of the approach by the experiment demonstration.<\/jats:p>","DOI":"10.1155\/2019\/9297181","type":"journal-article","created":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:34:47Z","timestamp":1569803687000},"page":"1-11","source":"Crossref","is-referenced-by-count":0,"title":["One More Accuracy k-Anonymity Framework for LBS"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2395-730X","authenticated-orcid":true,"given":"Fang","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Information Management, Shanxi University of Finance and Economics, Taiyuan 030006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5996-024X","authenticated-orcid":true,"given":"Xinguang","family":"Peng","sequence":"additional","affiliation":[{"name":"College of Computer Science, Taiyuan University of Technology, Taiyuan 030024, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1791-0911","authenticated-orcid":true,"given":"Pingzhen","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Management, Shanxi University of Finance and Economics, Taiyuan 030006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"doi-asserted-by":"publisher","key":"2","DOI":"10.1007\/978-3-642-25734-6_29"},{"issue":"7","key":"3","first-page":"1154","volume":"45","year":"2011","journal-title":"Journal of Zhejiang University"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/tmc.2015.2388488"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.4028\/www.scientific.net\/amm.599-601.1553"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1155\/2015\/326953"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1016\/j.future.2016.08.023"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/tits.2010.2072503"},{"doi-asserted-by":"publisher","key":"19","DOI":"10.1109\/tits.2002.806806"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1007\/11553939_97"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1109\/tpami.2005.142"},{"issue":"2","key":"22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","year":"2002","journal-title":"GeoInformatica"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1145\/170036.170038"}],"container-title":["Mobile Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2019\/9297181.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2019\/9297181.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2019\/9297181.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:35:12Z","timestamp":1569803712000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/misy\/2019\/9297181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,29]]},"references-count":12,"alternative-id":["9297181","9297181"],"URL":"https:\/\/doi.org\/10.1155\/2019\/9297181","relation":{},"ISSN":["1574-017X","1875-905X"],"issn-type":[{"type":"print","value":"1574-017X"},{"type":"electronic","value":"1875-905X"}],"subject":[],"published":{"date-parts":[[2019,9,29]]}}}