@InProceedings{Gu:2017:PhantomWalkaboutsWireless,
    author = "Gu, Chen and Bradbury, Matthew and Jhumka, Arshad",
    booktitle = "Proceedings of the Symposium on Applied Computing",
    title = "{Phantom Walkabouts in Wireless Sensor Networks}",
    year = "2017",
    address = "Marrakech, Morocco",
    month = "03--07 April",
    pages = "609--616",
    publisher = "ACM",
    series = "SAC'17",
    abstract = "As wireless sensor networks (WSNs) have been applied across a spectrum of application domains, the problem of source location privacy (SLP) has emerged as a significant issue, particularly in security-critical situations. In the seminal work on SLP, phantom routing was proposed as a viable approach to address SLP. However, recent work has shown some limitations of phantom routing such as poor performance with multiple sources. In this paper, we propose phantom walkabouts, a novel version and more general version of phantom routing, which performs phantom routes of variable lengths. Through extensive simulations we show that phantom walkabouts provides high SLP levels with a low message overhead and hence, low energy usage.",
    acmid = "3019732",
    doi = "10.1145/3019612.3019732",
    file = ":SAC-NET2017.pdf:PDF",
    isbn = "978-1-4503-4486-9",
    keywords = "phantom routing, phantom walkabouts, routing, source location privacy, wireless sensor networks",
    numpages = "8"
}