Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Near optimal routing protocols for source location privacy in wireless sensor networks: modelling, design and evaluation

Tools
- Tools
+ Tools

Bradbury, Matthew S. (2018) Near optimal routing protocols for source location privacy in wireless sensor networks: modelling, design and evaluation. PhD thesis, University of Warwick.

[img]
Preview
PDF
WRAP_Theses_Bradbury_2018.pdf - Unspecified Version - Requires a PDF viewer.

Download (4Mb) | Preview
Official URL: http://webcat.warwick.ac.uk/record=b3349346~S1

Request Changes to record.

Abstract

Wireless Sensor Networks (WSNs) are collections of small computing devices that are used to monitor valuable assets such as endangered animals. As WSNs communicate wirelessly they leak information to malicious eavesdroppers. When monitoring assets it is important to provide Source Location Privacy (SLP), where the location of the message source must be kept hidden. Many SLP protocols have been developed by designing a protocol using intuition before evaluating its performance. However, this does not provide insight into how to develop optimal approaches. This thesis will present an alternate approach where the SLP problem is modelled using different techniques to give an optimal output. However, as this optimal output is typically for a restricted scenario, algorithms that trade optimality for generality are subsequently designed. Four main contributions are presented. First, an analysis is performed based on entropy and divergence to gain insight into how to reduce the information an attacker gains via the use of competing paths, and ways to compare the information loss of arbitrary routing protocols. Secondly, the SLP problem is modelled using Integer Linear Programming. The model result guides the design of a generic protocol called ILPRouting that groups messages together to reduce the moves an attacker makes. Thirdly, a timing analysis of when events occur is used to dynamically determine fake source parameters for the Dynamic and DynamicSPR algorithms. These fake sources lure the attacker to their location instead of the real source. Finally, the first SLP-aware duty cycle is investigated, and implemented for DynamicSPR to make it more energy efficient. These techniques are evaluated through simulations and deployments on WSN testbeds to demonstrate their effectiveness.

Item Type: Thesis (PhD)
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Library of Congress Subject Headings (LCSH): Wireless sensor networks -- Security measures, Computer network protocols, Routers (Computer networks)
Official Date: May 2018
Dates:
DateEvent
May 2018Submitted
Institution: University of Warwick
Theses Department: Department of Computer Science
Thesis Type: PhD
Publication Status: Unpublished
Supervisor(s)/Advisor: Jhumka, Arshad,1974-
Sponsors: Engineering and Physical Sciences Research Council
Extent: xix, 242 leaves : illustrations (chiefly colour)
Language: eng

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us