Home > Research > Publications & Outputs > A Near-Optimal Source Location Privacy Scheme f...

Links

Text available via DOI:

View graph of relations

A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks. / Bradbury, Matthew; Jhumka, Arshad.
2017 IEEE Trustcom/BigDataSE/ICESS. IEEE, 2017. p. 409-416.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

APA

Vancouver

Bradbury M, Jhumka A. A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks. In 2017 IEEE Trustcom/BigDataSE/ICESS. IEEE. 2017. p. 409-416 Epub 2017 Aug 1. doi: 10.1109/Trustcom/BigDataSE/ICESS.2017.265

Author

Bradbury, Matthew ; Jhumka, Arshad. / A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks. 2017 IEEE Trustcom/BigDataSE/ICESS. IEEE, 2017. pp. 409-416

Bibtex

@inproceedings{07a07da978ac4284b97f725b5ba148ef,
title = "A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks",
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.",
keywords = "Integer linear programming, Monitoring, Privacy, Routing, Routing protocols, Wireless sensor networks, Integer Linear Programming, Optimal Routing, Source Location Privacy, Wireless Sensor Networks",
author = "Matthew Bradbury and Arshad Jhumka",
year = "2017",
month = sep,
day = "11",
doi = "10.1109/Trustcom/BigDataSE/ICESS.2017.265",
language = "English",
isbn = "97871509049066",
pages = "409--416",
booktitle = "2017 IEEE Trustcom/BigDataSE/ICESS",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - A Near-Optimal Source Location Privacy Scheme for Wireless Sensor Networks

AU - Bradbury, Matthew

AU - Jhumka, Arshad

PY - 2017/9/11

Y1 - 2017/9/11

N2 - 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.

AB - 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.

KW - Integer linear programming

KW - Monitoring

KW - Privacy

KW - Routing

KW - Routing protocols

KW - Wireless sensor networks

KW - Integer Linear Programming

KW - Optimal Routing

KW - Source Location Privacy

KW - Wireless Sensor Networks

U2 - 10.1109/Trustcom/BigDataSE/ICESS.2017.265

DO - 10.1109/Trustcom/BigDataSE/ICESS.2017.265

M3 - Conference contribution/Paper

SN - 97871509049066

SP - 409

EP - 416

BT - 2017 IEEE Trustcom/BigDataSE/ICESS

PB - IEEE

ER -