{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T08:45:37Z","timestamp":1780044337242,"version":"3.53.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:p>\n            For sensor networks deployed to monitor and report real events, event source anonymity is an attractive and critical security property, which unfortunately is also very difficult and expensive to achieve. This is not only because adversaries may attack against sensor source privacy through traffic analysis, but also because sensor networks are very limited in resources. As such, a practical trade-off between security and performance is desirable. In this article, for the first time we propose the notion of\n            <jats:italic>statistically strong source anonymity<\/jats:italic>\n            , under a challenging attack model where a global attacker is able to monitor the traffic in the entire network. We propose a scheme called\n            <jats:italic>FitProbRate<\/jats:italic>\n            , which realizes statistically strong source anonymity for sensor networks. We demonstrate the robustness of our scheme under various statistical tests that might be employed by the attacker to detect real events. Our analysis and simulation results show that our scheme, besides providing source anonymity, can significantly reduce real event reporting latency compared to two baseline schemes.\n          <\/jats:p>\n          <jats:p>\n            However, the degree of source anonymity in the FitProbRate scheme might decrease as real message rate increases. We propose a\n            <jats:italic>dynamic mean<\/jats:italic>\n            scheme which has better performance under high real message rates. Simulation results show that the dynamic mean scheme is capable of increasing the attacker's false positive rate and decreasing the attacker's Bayesian detection rate significantly even under high-rate continuous real messages.\n          <\/jats:p>","DOI":"10.1145\/2480730.2480737","type":"journal-article","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T12:09:34Z","timestamp":1370434174000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Towards statistically strong source anonymity for sensor networks"],"prefix":"10.1145","volume":"9","author":[{"given":"Yi","family":"Yang","sequence":"first","affiliation":[{"name":"Catholic University of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Shao","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sencun","family":"Zhu","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, University Park"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guohong","family":"Cao","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, University Park"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00302-4"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729437"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1954.10501232"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/319709.319710"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 4th International Workshop on Information Hiding (IHW'01)","author":"Back A.","unstructured":"Back , A. , Mller , U. , and Stiglic , A . 2001. Traffic analysis attacks and trade-offs in anonymity providing systems . In Proceedings of the 4th International Workshop on Information Hiding (IHW'01) . Springer, 245--257. Back, A., Mller, U., and Stiglic, A. 2001. Traffic analysis attacks and trade-offs in anonymity providing systems. In Proceedings of the 4th International Workshop on Information Hiding (IHW'01). Springer, 245--257."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_2_1_7_1","volume-title":"International Conference on Dependable Systems and Networks (DSN'04)","author":"Deng J.","unstructured":"Deng , J. , Han , R. , and Mishra , S . 2004. Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks . In International Conference on Dependable Systems and Networks (DSN'04) . Deng, J., Han, R., and Mishra, S. 2004. Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks. In International Conference on Dependable Systems and Networks (DSN'04)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Diaz C. Seys S. Claessens J. and \n      Preneel B\n  . \n  2002\n  . Towards measuring anonymity. In Proceedings of the 2nd International Conference on Privacy Enhancing Technologies (PET'02). R. Dingledine and P. Syverson Eds. Lecture Notes in Computer Science vol. \n  2482 Springer 54--68.   Diaz C. Seys S. Claessens J. and Preneel B. 2002. Towards measuring anonymity. In Proceedings of the 2 nd International Conference on Privacy Enhancing Technologies (PET'02). R. Dingledine and P. Syverson Eds. Lecture Notes in Computer Science vol. 2482 Springer 54--68.","DOI":"10.1007\/3-540-36467-6_5"},{"key":"e_1_2_1_9_1","unstructured":"Free Haven. 2005. The free haven project. http:\/\/freehaven.net\/anonbib\/date.html.  Free Haven. 2005. The free haven project. http:\/\/freehaven.net\/anonbib\/date.html."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECURECOMM.2005.33"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.146"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.31"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2009.04.009"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 29th Conference on Information Communications (INFOCOM'10)","author":"Li Y.","unstructured":"Li , Y. and Ren , J . 2010. Source-location privacy through dynamic routing in wireless sensor networks . In Proceedings of the 29th Conference on Information Communications (INFOCOM'10) . 2660--2668. Li, Y. and Ren, J. 2010. Source-location privacy through dynamic routing in wireless sensor networks. In Proceedings of the 29th Conference on Information Communications (INFOCOM'10). 2660--2668."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 4th International Conference on Information Processing in Sensor Networks (IPSN'05)","author":"Liu D.","unstructured":"Liu , D. , Ning , P. , and Du , W . 2005. Attack-resistant location estimation in sensor networks . In Proceedings of the 4th International Conference on Information Processing in Sensor Networks (IPSN'05) . Liu, D., Ning, P., and Du, W. 2005. Attack-resistant location estimation in sensor networks. In Proceedings of the 4th International Conference on Information Processing in Sensor Networks (IPSN'05)."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v009.i02"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the IEEE International Conference on Network Protocols (ICNP'07)","author":"Mehta K.","unstructured":"Mehta , K. , Liu , D. , and Wright , M . 2007. Location privacy in sensor networks against a global eavesdropper . In Proceedings of the IEEE International Conference on Network Protocols (ICNP'07) . 314--323. Mehta, K., Liu, D., and Wright, M. 2007. Location privacy in sensor networks against a global eavesdropper. In Proceedings of the IEEE International Conference on Network Protocols (ICNP'07). 314--323."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460877.1460884"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029102.1029117"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Pfitzmann A. and Hansen M. 2000. Anonymity unobservability and pseudonymity: A consolidated proposal for terminology. http:\/\/www.caida.org\/publications\/bib\/networking\/entries\/pfitzmann_terminology.xml.  Pfitzmann A. and Hansen M. 2000. Anonymity unobservability and pseudonymity: A consolidated proposal for terminology. http:\/\/www.caida.org\/publications\/bib\/networking\/entries\/pfitzmann_terminology.xml.","DOI":"10.1007\/3-540-44702-4_1"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 30th International Conference on Computer Communications (INFOCOM'11)","author":"Pongaliur K.","unstructured":"Pongaliur , K. and Xiao , L . 2011. Maintaining source privacy under eavesdropping and node compromise attacks . In Proceedings of the 30th International Conference on Computer Communications (INFOCOM'11) . Pongaliur, K. and Xiao, L. 2011. Maintaining source privacy under eavesdropping and node compromise attacks. In Proceedings of the 30th International Conference on Computer Communications (INFOCOM'11)."},{"key":"e_1_2_1_22_1","first-page":"6","article-title":"Kolmogorov-simirnov: A goodness of fit test for small samples","volume":"10","author":"Romeu J. L.","year":"2003","unstructured":"Romeu , J. L. 2003 . Kolmogorov-simirnov: A goodness of fit test for small samples . START: Select. Topics Assur. Related Technol. 10 , 6 . Romeu, J. L. 2003. Kolmogorov-simirnov: A goodness of fit test for small samples. START: Select. Topics Assur. Related Technol. 10, 6.","journal-title":"START: Select. Topics Assur. Related Technol."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 6th Annual IEEE Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (SECON'09)","author":"Shao M.","unstructured":"Shao , M. , Hu , W. , Zhu , S. , Cao , G. , Krishnamurthy , S. , and Porta , T. L . 2009. Cross-layer enhanced source location privacy in sensor networks . In Proceedings of the 6th Annual IEEE Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (SECON'09) . Shao, M., Hu, W., Zhu, S., Cao, G., Krishnamurthy, S., and Porta, T. L. 2009. Cross-layer enhanced source location privacy in sensor networks. In Proceedings of the 6th Annual IEEE Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (SECON'09)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1974.10480196"},{"key":"e_1_2_1_25_1","volume-title":"Sequential Analysis","author":"Wald A.","unstructured":"Wald , A. 1947. Sequential Analysis . J. Wiley and Sons , New York . Wald, A. 1947. Sequential Analysis. J. Wiley and Sons, New York."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 2nd International Workshop on Security in Systems and Networks (SSN'06)","author":"Xi Y.","unstructured":"Xi , Y. , Schwiebert , L. , and Shi , W . 2006. Preserving source location privacy in monitoring-based wireless sensor networks . In Proceedings of the 2nd International Workshop on Security in Systems and Networks (SSN'06) . Xi, Y., Schwiebert, L., and Shi, W. 2006. Preserving source location privacy in monitoring-based wireless sensor networks. In Proceedings of the 2nd International Workshop on Security in Systems and Networks (SSN'06)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352533.1352547"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062689.1062737"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948120"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480730.2480737","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480730.2480737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:14Z","timestamp":1750235954000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480730.2480737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["10.1145\/2480730.2480737"],"URL":"https:\/\/doi.org\/10.1145\/2480730.2480737","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"2011-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}