Effective Probabilistic Approach Protecting Sensor Traffic

Abstract

Abstract-Sensor networks are often deployed in environments where malicious nodes present. Among all possible forms of the attacks threatening the sensor networks, in this work, we focus on traffic analysis attacks. Typically, in performing traffic analysis, an attacker will eavesdrop on-going wireless transmissions and analyze contents and timing instances of the transmissions so to infer critical events or to trace valuable assets in the network (e.g, data sources or sinks). The paper presents a probabilistic approach to shape the sensor network traffic to decorrelate time instances in transmissions. The security properties of the approach are studied both analytically and empirically, showing strong protection in high probability.

A decision theoretic framework for selecting source location privacy aware routing protocols in wireless sensor networks

“…Apart from techniques described above, an algorithm was proposed where nodes changed the chronological order of received messages and sent messages which also change the traffic pattern, making it hard for a local adversary to track the traffic to the source node [8]. Wang used separate path routing to transmit messages, leading to less packets per path, making it harder for the adversary to track messages back to the real source [16].…”

“…A number of techniques have been proposed to provide SLP, such as phantom routing using random walks [7], delays [8], dummy data sources [9,10] and many others [11]. In general, the objective can be informally stated as the provision of a high level of source location privacy while spending as little energy as possible.…”

Fortified Anonymous Communication Protocol for Location Privacy in WSN: A Modular Approach

“…There are some literature addressed this using issuing packet delay techniques. Hong et al [ 18 ] introduced probabilistic reshaping ( PRESH ) to counter the adversary that uses timing analysis techniques and also introduced and upgraded PRESH to be extended probabilistic reshaping ( exPRESH ) to counter such a scenario. The SN will delay the packet in its buffer again up to D time.…”

“…Using routing schemes to protect against time correlation attacks is found to be efficient to certain extent where local adversary usually has limited mobility and partial view of the network traffic. However, routing based schemes do not work for global adversary where the traffic of the whole network can be easily monitored with a full spatial view and the adversaries can collude together to promptly detect the origin and time information of the event [ 18 , 34 ]. A mechanism is required to divert attention of the adversary when there is event-driven transmissions, especially with the presence of global adversary [ 43 ].…”