REAL: A Reciprocal Protocol for Location Privacy in Wireless Sensor Networks

REAL: A Reciprocal Protocol for Location Privacy in Wireless Sensor Networks K-anonymity has been used to protect location privacy for location monitoring services in wireless sensor networks (WSNs), where sensor nodes work together to report k-anonymized aggregate locations to a server. Each k-anonymized aggregate location is a cloaked area that contains at least k persons. However, an attack model is identified to show that overlapping aggregate locations still pose privacy risks because an adversary can infer some overlapping areas with less than k persons that violates the k-anonymity privacy requirement.…

Read More

Trust Management for Defending On-Off Attacks

Trust Management for Defending On-Off Attacks A trust management scheme can be used to aid an automated decision-making process for an access control policy. Since unintentional temporary errors are possible, the trust management solution must provide a redemption scheme to allow nodes to recover trust. However, if a malicious node tries to disguise its malicious behaviors as unintentional temporary errors, the malicious node may be given more opportunities to attack the system by disturbing the redemption scheme. Existing trust management schemes that employ redemption schemes fail to discriminate between temporary…

Read More

Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection Approach

Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection Approach In mobile ad hoc networks (MANETs), a primary requirement for the establishment of communication among nodes is that nodes should cooperate with each other. In the presence of malevolent nodes, this requirement may lead to serious security concerns; for instance, such nodes may disrupt the routing process. In this context, preventing or detecting malicious nodes launching grayhole or collaborative blackhole attacks is a challenge. This paper attempts to resolve this issue by designing a dynamic source…

Read More

Cost-Aware SEcure Routing (CASER) Protocol Design for Wireless Sensor Networks

Cost-Aware SEcure Routing (CASER) Protocol Design for Wireless Sensor Networks Lifetime optimization and security are two conflicting design issues for multi-hop wireless sensor networks (WSNs) with non-replenishable energy resources. A novel secure and efficient Cost-Aware SEcure Routing (CASER) protocol is proposed to address these two conflicting issues through two adjustable parameters: energy balance control (EBC) and probabilistic-based random walking. The energy consumption is severely disproportional to the uniform energy deployment for the given network topology, which greatly reduces the lifetime of the sensor networks. To solve this problem, an efficient…

Read More

Secure and Reliable Routing Protocols for Heterogeneous Multihop Wireless Networks

Secure and Reliable Routing Protocols for Heterogeneous Multihop Wireless Networks A secure protocol for Establishing STAble and reliable Routes (E-STAR) is proposed for establishing stable and reliable routes in heterogeneous multihop wireless networks (HMWNs). E-STAR combines payment and trust systems with a trust-based and energy-aware routing protocol. The payment system rewards the nodes that relay others’ packets and charges those that send packets. The trust system evaluates the nodes’ competence and reliability in relaying packets in terms of multi-dimensional trust values. The trust values are attached to the nodes’ public-key…

Read More