@Article{Jhumka:2015:Fakesourcebased, author = "Jhumka, Arshad and Bradbury, Matthew and Leeke, Matthew", journal = "Concurrency and Computation: Practice and Experience", title = "Fake source-based source location privacy in wireless sensor networks", year = "2015", month = "25 August", issn = "1532-0634", number = "12", pages = "2999--3020", volume = "27", abstract = "The development of novel wireless sensor network (WSN) applications, such as asset monitoring, has led to novel reliability requirements. One such property is source location privacy (SLP). The original SLP problem is to protect the location of a source node in a WSN from a single distributed eavesdropper attacker. Several techniques have been proposed to address the SLP problem, and most of them use some form of traffic analysis and engineering to provide enhanced SLP. The use of fake sources is considered to be promising for providing SLP, and several works have investigated the effectiveness of the fake sources approach under various attacker models. However, very little work has been done to understand the theoretical underpinnings of the fake source technique. In this paper, we (i) provide a novel formalisation of the fake sources selection problem; (ii) prove the fake sources selection problem to be NP-complete; (iii) provide parametric heuristics for three different network configurations; and (iv) show that these heuristics provide (near) optimal levels of SLP under appropriate parameterisation. Our results show that fake sources can provide a high level of SLP. Our work is the first to investigate the theoretical underpinnings of the fake source technique.", doi = "10.1002/cpe.3242", file = ":CCPE2015.pdf:PDF", keywords = "complexity, distributed eavesdropper, fake source, source location privacy, wireless sensor networks" }