Home > Research > Publications & Outputs > Towards optimal source location privacy-aware T...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks. / Kirton, Jack; Bradbury, Matthew; Jhumka, Arshad.
In: Computer Networks, Vol. 146, 09.12.2018, p. 125-137.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Kirton, J, Bradbury, M & Jhumka, A 2018, 'Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks', Computer Networks, vol. 146, pp. 125-137. https://doi.org/10.1016/j.comnet.2018.09.010

APA

Kirton, J., Bradbury, M., & Jhumka, A. (2018). Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks. Computer Networks, 146, 125-137. https://doi.org/10.1016/j.comnet.2018.09.010

Vancouver

Kirton J, Bradbury M, Jhumka A. Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks. Computer Networks. 2018 Dec 9;146:125-137. Epub 2018 Sept 15. doi: 10.1016/j.comnet.2018.09.010

Author

Kirton, Jack ; Bradbury, Matthew ; Jhumka, Arshad. / Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks. In: Computer Networks. 2018 ; Vol. 146. pp. 125-137.

Bibtex

@article{e9bb6643f47645c2b1912ba35dd93f72,
title = "Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks",
abstract = "Source Location Privacy (SLP) is becoming important for wireless sensor networks where the source of messages is kept hidden from an attacker. In this paper, we conjecture that similar traffic perturbation to altering the routing protocol can be achieved at the link layer through assignment of time slots to nodes. This paper presents a multi-objective optimisation problem where SLP, schedule latency and final attacker distance are criteria. We employ genetic algorithms to generate Pareto-optimal schedules using two fitness criteria, examining the Pareto efficiency of selecting either and confirming the efficiency by performing simulations which show a near optimal capture ratio.",
keywords = "Genetic algorithm, Wireless sensor networks, TDMA, Data aggregation schedule, Source location privacy",
author = "Jack Kirton and Matthew Bradbury and Arshad Jhumka",
year = "2018",
month = dec,
day = "9",
doi = "10.1016/j.comnet.2018.09.010",
language = "English",
volume = "146",
pages = "125--137",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "ELSEVIER SCIENCE BV",

}

RIS

TY - JOUR

T1 - Towards optimal source location privacy-aware TDMA schedules in wireless sensor networks

AU - Kirton, Jack

AU - Bradbury, Matthew

AU - Jhumka, Arshad

PY - 2018/12/9

Y1 - 2018/12/9

N2 - Source Location Privacy (SLP) is becoming important for wireless sensor networks where the source of messages is kept hidden from an attacker. In this paper, we conjecture that similar traffic perturbation to altering the routing protocol can be achieved at the link layer through assignment of time slots to nodes. This paper presents a multi-objective optimisation problem where SLP, schedule latency and final attacker distance are criteria. We employ genetic algorithms to generate Pareto-optimal schedules using two fitness criteria, examining the Pareto efficiency of selecting either and confirming the efficiency by performing simulations which show a near optimal capture ratio.

AB - Source Location Privacy (SLP) is becoming important for wireless sensor networks where the source of messages is kept hidden from an attacker. In this paper, we conjecture that similar traffic perturbation to altering the routing protocol can be achieved at the link layer through assignment of time slots to nodes. This paper presents a multi-objective optimisation problem where SLP, schedule latency and final attacker distance are criteria. We employ genetic algorithms to generate Pareto-optimal schedules using two fitness criteria, examining the Pareto efficiency of selecting either and confirming the efficiency by performing simulations which show a near optimal capture ratio.

KW - Genetic algorithm

KW - Wireless sensor networks

KW - TDMA

KW - Data aggregation schedule

KW - Source location privacy

U2 - 10.1016/j.comnet.2018.09.010

DO - 10.1016/j.comnet.2018.09.010

M3 - Journal article

VL - 146

SP - 125

EP - 137

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -