@InProceedings{Bradbury:2017:OptimalSourceLocation,
    author = "Bradbury, Matthew and Jhumka, Arshad",
    booktitle = "16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
    title = "{A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks}",
    year = "2017",
    address = "Sydney, NSW, Australia",
    month = "01--04 August",
    pages = "409--416",
    publisher = "IEEE",
    abstract = "As interest in using Wireless Sensor Networks (WSNs) for deployments in scenarios such as asset monitoring increases, the need to consider security and privacy issues also becomes greater. One such issue is that of Source Location Privacy (SLP) where the location of a source in the network needs to be kept secret from a malicious attacker. Many techniques have been proposed to provide SLP against an eavesdropping attacker. Most techniques work by first developing an algorithm followed by extensive performance validation. Differently, in this paper, we model the SLP problem as an Integer Linear Programming optimization problem. Using the IBM ILOG CPLEX optimiser, we obtain an optimal solution to provide SLP. However, that solution is centralised (i.e., requires network-wide knowledge) making the solution unsuitable for WSNs. Therefore, we develop a distributed version of the solution and evaluate the level of privacy provided by it. The solution is hybrid in nature, in that it uses both spatial and temporal redundancy to provide SLP. Results from extensive simulations using the TOSSIM WSN simulator indicate a 1\% capture ratio is achievable as a trade-off for an increase in the delivery latency.",
    dataset = "https://doi.org/10.5281/zenodo.801222",
    doi = "10.1109/Trustcom/BigDataSE/ICESS.2017.265",
    file = ":TrustCom2017.pdf:PDF",
    keywords = "Integer linear programming;Monitoring;Privacy;Routing;Routing protocols;Wireless sensor networks;Integer Linear Programming;Optimal Routing;Source Location Privacy;Wireless Sensor Networks"
}