An optimal algorithm towards successive location privacy in sensor networks with dynamic programming

Baokang Zhao; Dan Wang; Zili Shao; Jiannong Cao; Chun Chung Chan; Jinshu Su

doi:10.1587/transinf.E93.D.531

An optimal algorithm towards successive location privacy in sensor networks with dynamic programming

Baokang Zhao, Dan Wang, Zili Shao, Jiannong Cao, Chun Chung Chan, Jinshu Su

Research output: Journal article publication › Journal article › Academic research › peer-review

3 Citations (Scopus)

Abstract

In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.

Original language	English
Pages (from-to)	531-533
Number of pages	3
Journal	IEICE Transactions on Information and Systems
Volume	E93-D
Issue number	3
DOIs	https://doi.org/10.1587/transinf.E93.D.531
Publication status	Published - 1 Jan 2010

Keywords

Algorithms
Dynamic programming
Location privacy
Wireless sensor networks

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Vision and Pattern Recognition
Artificial Intelligence
Electrical and Electronic Engineering

More information

10.1587/transinf.E93.D.531

Cite this

@article{a63d1a18aa4140b6aba3413992c2e726,

title = "An optimal algorithm towards successive location privacy in sensor networks with dynamic programming",

abstract = "In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.",

keywords = "Algorithms, Dynamic programming, Location privacy, Wireless sensor networks",

author = "Baokang Zhao and Dan Wang and Zili Shao and Jiannong Cao and Chan, {Chun Chung} and Jinshu Su",

year = "2010",

month = jan,

day = "1",

doi = "10.1587/transinf.E93.D.531",

language = "English",

volume = "E93-D",

pages = "531--533",

journal = "IEICE Transactions on Information and Systems",

issn = "0916-8532",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "3",

}

TY - JOUR

T1 - An optimal algorithm towards successive location privacy in sensor networks with dynamic programming

AU - Zhao, Baokang

AU - Wang, Dan

AU - Shao, Zili

AU - Cao, Jiannong

AU - Chan, Chun Chung

AU - Su, Jinshu

PY - 2010/1/1

Y1 - 2010/1/1

N2 - In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.

AB - In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.

KW - Algorithms

KW - Dynamic programming

KW - Location privacy

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=77950246399&partnerID=8YFLogxK

U2 - 10.1587/transinf.E93.D.531

DO - 10.1587/transinf.E93.D.531

M3 - Journal article

SN - 0916-8532

VL - E93-D

SP - 531

EP - 533

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

IS - 3

ER -

An optimal algorithm towards successive location privacy in sensor networks with dynamic programming

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this