download0 view158
twitter facebook

공공누리This item is licensed Korea Open Government License

dc.contributor.author
엄정호
dc.contributor.author
김용기
dc.date.accessioned
2019-08-28T07:41:12Z
dc.date.available
2019-08-28T07:41:12Z
dc.date.issued
2012-05-11
dc.identifier.issn
1383-7621
dc.identifier.uri
https://repository.kisti.re.kr/handle/10580/14073
dc.description.abstract
Duetotheadvancementofwirelessinternetandmobilepositioningtechnology,theapplicationoflocation-basedservices(LBSs)hasbecomepopularformobileusers.Sinceusershavetosendtheirexactlocationstoobtaintheservice,itmayleadtoseveralprivacythreats.Tosolvethisproblem,acloakingmethodhasbeenproposedtoblurusers’exactlocationsintoacloakedspatialregionwitharequiredprivacythreshold(k).Withthecloakedregion,anLBSservercancarryoutak-nearestneighbor(k-NN)searchalgorithm.Somerecentstudieshaveproposedmethodstosearchk-nearestPOIswhileprotectingauser’sprivacy.However,theyhaveatleastonemajorproblem,suchasinefficiencyonqueryprocessingorlowprecisionofretrievedresult.Toresolvetheseproblems,inthispaper,weproposeanovelk-NNqueryprocessingalgorithmforacloakingregiontosatisfybothrequirementsoffastqueryprocessingtimeandhighprecisionoftheretrievedresult.Toachievefastqueryprocessingtime,weproposeanewpruningtechniquebasedona2D-coodinatescheme.Inaddition,wemakeuseofaVoronoidiagramforretrievingthenearestPOIsefficiently.Tosatisfytherequirementofhighprecisionoftheretrievedresult,weguaranteethatourk-NNqueryprocessingalgorithmalwayscontainstheexactsetofknearestneighbors.OurperformanceanalysisshowsthatouralgorithmachievesbetterperformanceintermsofqueryprocessingtimeandthenumberofcandidatePOIscomparedwithotheralgorithms.
dc.language
eng
dc.relation.ispartofseries
Journalofsystemsarchitecture:JSA:theEuromicrojournal
dc.title
k-Nearest Neighbor Query Processing Algorithm for Cloaking Regions
dc.subject.keyword
Privacy
dc.subject.keyword
k-NNqueryprocessingalgorithm
dc.subject.keyword
Voronoidiagram
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
Files in This Item:
There are no files associated with this item.

Browse