메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Towards privacy-sensitive participatory sensing

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SERVERS; HYBRID SCHEME; INFORMATION LOSS; LOCATION PRIVACY; MAXIMUM DISTANCE; MICROAGGREGATION; RANDOM GAUSSIAN NOISE; REAL WORLD DATA; RESEARCH CHALLENGES; URBAN ENVIRONMENTS; USER LOCATION;

EID: 70349336066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PERCOM.2009.4912864     Document Type: Conference Paper
Times cited : (28)

References (18)
  • 3
    • 34247356882 scopus 로고    scopus 로고
    • B. Hull, V. Bychkovsky, Y. Zhang, et. al., Cartel: A Distributed Mobile Sensor Computing System, in Proceedings of ACM SenSys 2006,pp. 125-J38, November 2006.
    • B. Hull, V. Bychkovsky, Y. Zhang, et. al., Cartel: A Distributed Mobile Sensor Computing System, in Proceedings of ACM SenSys 2006,pp. 125-J38, November 2006.
  • 4
    • 84866503356 scopus 로고    scopus 로고
    • Nericell: Rich Monitoring of Road and Traffic Conditions using Mobile Smartphones
    • November
    • P. Mohan, V. Padmanabhan, R. Ramjee, Nericell: Rich Monitoring of Road and Traffic Conditions using Mobile Smartphones, in Proceedings of ACM SenSys 2008,November 2008.
    • (2008) Proceedings of ACM SenSys 2008
    • Mohan, P.1    Padmanabhan, V.2    Ramjee, R.3
  • 9
    • 70349322373 scopus 로고    scopus 로고
    • Mobishop: Using Mobile Phones for Sharing Consumer Pricing Information
    • Demo Paper in ,June
    • S. Sehgal, S. S. Kanhere and C. T. Chou, Mobishop: Using Mobile Phones for Sharing Consumer Pricing Information, Demo Paper in Proceedings of IEEE DCOSS 2008,June 2008.
    • (2008) Proceedings of IEEE DCOSS 2008
    • Sehgal, S.1    Kanhere, S.S.2    Chou, C.T.3
  • 14
    • 26944448516 scopus 로고    scopus 로고
    • Ordinal, Continuous and Heterogeneous k-anonymity through Mieroaggregation
    • J. Domingo-Ferrer and V. Torra. Ordinal, Continuous and Heterogeneous k-anonymity through Mieroaggregation. Data Mining and Knowledge Discovery,Vol. 11, pages 195-212, 2005.
    • (2005) Data Mining and Knowledge Discovery , vol.11 , pp. 195-212
    • Domingo-Ferrer, J.1    Torra, V.2
  • 15
    • 22944452807 scopus 로고    scopus 로고
    • Minimum Spanning Tree Partitioning Algorithm for Mieroaggregation
    • M. Laszlo and S. Mukherjee. Minimum Spanning Tree Partitioning Algorithm for Mieroaggregation. IEEE Transactions on Knowledge and Data Engineering,Vol. 17, No. 7, pages 902-911, 2005.
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.7 , pp. 902-911
    • Laszlo, M.1    Mukherjee, S.2
  • 17
    • 33746949868 scopus 로고    scopus 로고
    • Mieroaggregation for Database and Location Privacy
    • Next Generation Information Technologies and Systems-NGITS'2006,of
    • J. Domingo-Ferrer. Mieroaggregation for Database and Location Privacy. In Next Generation Information Technologies and Systems-NGITS'2006,Vol. 4032 of Lecture Notes in Computer Science,pp. 106-116, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4032 , pp. 106-116
    • Domingo-Ferrer, J.1
  • 18
    • 70349308181 scopus 로고    scopus 로고
    • D. Kotz, T. Henderson, and I. Abyzov. CRAWDAD trace, url-http://crawdad. es. dartmouth.edu/meta.php?name=dartmouth/campus.
    • D. Kotz, T. Henderson, and I. Abyzov. CRAWDAD trace, url-http://crawdad. es. dartmouth.edu/meta.php?name=dartmouth/campus.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.