Achieving Network Level Privacy in Wireless Sensor Networks

Shaikh, Riaz Ahmed; Jameel, Hassan; d’Auriol, Brian J.; Lee, Heejo; Lee, Sungyoung; Song, Young Jae

doi:10.3390/s100301447

Cited by 38 publications

(28 citation statements)

References 32 publications

(54 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, works such as in [3,6,13,19,20] do not use dummy messages. In particular, [17] and [9] proposed a two-phase solution called phantom routing scheme (PRS).…”

Section: Related Workmentioning

confidence: 99%

“…PRS has received a lot of attention in the literature. On the other hand, the weaknesses as proposed by [22], [19] and [11] for poor SLP are due to the directed random walk reusing the routing path and exposure of direction information. In order to improve the random walk quality, [23] proposed using location angles to construct the random walk.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Phantom walkabouts in wireless sensor networks

Bradbury

Jhumka

2017

Proceedings of the Symposium on Applied Computing

View full text Add to dashboard Cite

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.

show abstract

“…However, works such as in [3,6,13,19,20] do not use dummy messages. In particular, [17] and [9] proposed a two-phase solution called phantom routing scheme (PRS).…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Phantom walkabouts in wireless sensor networks

Bradbury

Jhumka

2017

Proceedings of the Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…A variety of approaches that do not rely on the use of dummy messages have also been proposed to address the SLP problem [4,14,15,16,17]. In particular, Ozturk et al [8] and Kamat et al [3] proposed a two-phase solution.…”

Section: Related Workmentioning

confidence: 99%

Assessing the Performance of Phantom Routing on Source Location Privacy in Wireless Sensor Networks

Bradbury

Jhumka

et al. 2015

2015 IEEE 21st Pacific Rim International Symposium on Dependable Computing (PRDC)

View full text Add to dashboard Cite

(2015) Assessing the performance of phantom routing on source location privacy in wireless sensor networks. In: 2015 IEEE 21st Pacific Rim International Symposium on Dependable Computing (PRDC), Zhangjiajie, China, 18-20 Nov 2015 Copies of full items can be used for personal research or study, educational, or not-for profit purposes without prior permission or charge. Provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way.Publisher's statement: "© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works." A note on versions:The version presented here may differ from the published version or, version of record, if you wish to cite this item you are advised to consult the publisher's version. Please see the 'permanent WRAP url' above for details on accessing the published version and note that access may require a subscription.For more information, please contact the WRAP Team at: publications@warwick.ac.uk Assessing the Performance of Phantom Routing on Source Location Privacy in Wireless Sensor NetworksChen Gu, Matthew Bradbury, Arshad Jhumka, and Matthew Leeke Department of Computer Science, University of Warwick, Coventry, United Kingdom, CV4 7AL {cspmaj, bradbury, matt, arshad}@dcs.warwick.ac.uk 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 safety-critical situations. In seminal work on SLP, phantom routing was proposed as an approach to addressing the issue. However, results presented in support of phantom routing have not included considerations for practical network configurations, omitting simulations and analyses with larger network sizes. This paper addresses this shortcoming by conducting an in-depth investigation of phantom routing under various network configurations. The results presented demonstrate that previous work in phantom routing does not generalise well to different network configurations. Specifically, under certain configurations, it is shown that the afforded SLP is reduced by a factor of up to 75.

show abstract

“…In addition, this scheme has low communication overhead. Shaikh et al (2010) have proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses the privacy problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy.…”

Section: Key Management In Wireless Sensor Networkmentioning

confidence: 99%

“…The queries are processed in order to give the required answer to the legitimate entity. Hence the propagation of a fake query is limited (Shaikh et al, 2010) …”

Section: Authentication and Its Issuesmentioning

confidence: 99%

Efficient Key Management and Authentication Scheme for Wireless Sensor Networks

Lalitha¹

2014

American Journal of Applied Sciences

View full text Add to dashboard Cite

Wireless Sensor Networks (WSN) is vulnerable to node capture attacks in which an attacker can capture one or more sensor nodes and reveal all stored security information which enables him to compromise a part of the WSN communications. Due to large number of sensor nodes and lack of information about deployment and hardware capabilities of sensor node, key management in wireless sensor networks has become a complex task. Limited memory resources and energy constraints are the other issues of key management in WSN. Hence an efficient key management scheme is necessary which reduces the impact of node capture attacks and consume less energy. In this study, we develop a cluster based technique for key management in wireless sensor network.

show abstract

Achieving Network Level Privacy in Wireless Sensor Networks

Cited by 38 publications

References 32 publications

Phantom walkabouts in wireless sensor networks

Phantom walkabouts in wireless sensor networks

Assessing the Performance of Phantom Routing on Source Location Privacy in Wireless Sensor Networks

Efficient Key Management and Authentication Scheme for Wireless Sensor Networks

Contact Info

Product

Resources

About