Journal ArticleDOI
Privacy-aware routing in sensor networks
Haodong Wang,Bo Sheng,Qun Li +2 more
Reads0
Chats0
TLDR
To maximize source location privacy, which is evaluated by the adversary's traceback time, by designing routing protocols that distribute message flows to different routes, this paper gives the performance bound for any routing scheme and proposes WRS, a suboptimal but practical privacy-aware routing scheme.About:
This article is published in Computer Networks.The article was published on 2009-06-25. It has received 94 citations till now. The article focuses on the topics: Adversary model & Static routing.read more
Citations
More filters
BookDOI
Foundations of Security Analysis and Design V: FOSAD 2007/2008/2009 Tutorial Lectures
TL;DR: This paper, summarizing the six hours lesson taught during the Summer School FOSAD’12, gives an overview of the test data selection techniques and provides a state-of-the-art about Model-Based approaches for security testing.
Journal ArticleDOI
Providing Source Location Privacy in Wireless Sensor Networks: A Survey
TL;DR: This paper presents an overview of the solutions that provide source location privacy within a WSN, in relation to the assumptions about the adversary's capabilities, and summarizes the concepts and solutions, which are categorized based on the core techniques used to provide source locations privacy.
Journal ArticleDOI
A Cloud-Based Scheme for Protecting Source-Location Privacy against Hotspot-Locating Attack in Wireless Sensor Networks
Mohamed E. Mahmoud,Xuemin Shen +1 more
TL;DR: A cloud-based scheme for efficiently protecting source nodes' location privacy against Hotspot-Locating attack by creating a cloud with an irregular shape of fake traffic, to counteract the inconsistency in the traffic pattern and camouflage the source node in the nodes forming the cloud.
Journal ArticleDOI
Evolving privacy: From sensors to the Internet of Things
TL;DR: The privacy problems of one of the key enablers of the IoT, namely wireless sensor networks, are looked at and how these problems may evolve with the development of this complex paradigm is analyzed.
Journal ArticleDOI
Secure and Energy-Efficient Disjoint Multipath Routing for WSNs
TL;DR: A three-phase disjoint routing scheme called the Security and Energy-efficient Disjoint Route (SEDR), based on the secret-sharing algorithm, that has significant improvement in network security under both scenarios of single and multiple black holes without reducing the network lifetime.
References
More filters
Proceedings ArticleDOI
Energy-efficient communication protocol for wireless microsensor networks
TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.
Energy-efficient communication protocols for wireless microsensor networks
TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Proceedings ArticleDOI
Directed diffusion: a scalable and robust communication paradigm for sensor networks
TL;DR: This paper explores and evaluates the use of directed diffusion for a simple remote-surveillance sensor network and its implications for sensing, communication and computation.
Journal ArticleDOI
Untraceable electronic mail, return addresses, and digital pseudonyms
TL;DR: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system.
Proceedings ArticleDOI
A key-management scheme for distributed sensor networks
TL;DR: A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.