PRIVACY PRESERVATION AGAINST GLOBAL EAVESDROPPER

IN SENSOR NETWORKS USING NETWORK CODING

ABSTRACT

Privacy threats have been one of the critical issues in wireless sensor
networks. Therefore, many security protocols have been developed to provide privacy in sensor
networks. Security risk in sensor networks is one of the significant issues to be dealt with. The
existing techniques guard the data only against the local eavesdropper who is having limited
knowledge of the network topology. A stronger adversary such as global eavesdropper can still
analyze the pattern of traffic and launch advanced attacks such as flow tracing and traffic
analysis. Due to these advanced attacks the privacy of the users is compromised. We propose a
new network coding mechanism to protect the privacy in sensor network against the global
eavesdropper. However, the simple deployment of network coding cannot achieve the goal once
the enough packets are collected by the adversaries. We propose a novel network coding
mechanism with the use of Homomorphic Encryption Function (HEF) on Global Encoding
Vectors. It offers two significant privacy preserving features, packet flow untraceability and
message content confidentiality. We use the source simulation approach to calculate the
candidate traces which can transmit data at the same time and same rate. The optimal path
among the candidate traces for the faster transfer of data is calculated. Through the simulation
and analysis, we exhibit that the proposed scheme is both energy efficient and successful in
providing privacy in sensor networks.













Base Paper

Introduction:
Wireless networks, such as Wi-Fi, have been widely deployed in the access network area due to
their benefits such as convenience, mobility, and low cost. However, they still suffer from their
inherent shortcomings such as limited radio coverage, poor system reliability, as well as lack of
security and privacy. Multi-hop Wireless Networks (MWNs) are regarded as such a promising
solution for extending the radio coverage range of the existing wireless networks. System
reliability can be improved through multi-path packet forwarding, which is feasible in MWNs.
However, there exist many security and privacy issues in MWNs. Due to the open-air wireless
transmission, MWNs suffer from various kinds of attacks, such as eavesdropping, data
modification/injection, and node compromising; these attacks may breach the security properties
of MWNs, including confidentiality, integrity, and authenticity. In addition, some advanced
attacks, such as traffic analysis and flow tracing, can also be launched to compromise the privacy
of users, including source anonymity and traffic secrecy. Among all privacy properties, source
anonymity is of special interest in MWNs. Source anonymity refers to communicating through a
network without revealing the identity or location of the source node. Preventing traffic
analysis/flow tracing and provisioning source anonymity is critical for securing MWNs,
especially military related, such as sensor or tactical, networks.
Objective:
The main objective of the project is listed in the points below:-
The critical issue related to wireless sensor networks are energy of the sensor nodes and
security of the data traversing the wireless network.
Both of these critical issues have been dealt in this project by increasing the energy efficiency
of the sensor nodes and providing confidentiality to the data traversing across the network.
Randomly selecting the sensor nodes in the network which can act as potential source nodes.
By selecting these nodes, the number of source nodes in the network is reduced, thereby
reducing the load on each sensor node.
This approach confuses the global eavesdropper in identifying the source in the network
because of the presence of multiple sources.
The shortest path between all the sensor nodes and the base station is calculated.
By calculating the shortest path, data can be transmitted at the faster rate and the energy of the
sensor nodes is maintained for longer time.
Using the approach of network coding the confidentiality of the data traversing across the
network is preserved.
The data is encrypted at the source before sending it on the previously calculated shortest
path.
The encrypted data is passed through different sensor nodes to the base station.
Once all the packets reach the base station, it decrypts the encrypted packet using the network
decoding function.
Therefore, combining all the approaches mentioned above the deficiencies of the wireless
sensor networks have been tried to overcome.

PUBLICATIONABSTRACT

Many security protocols have been developed to provide privacy in sensor networks.
Security risk in sensor networks is one of the significant issues to be dealt with. The existing
techniques guard the data only against the local eavesdropper who is having limited
knowledge of the network topology. A stronger adversary such as global eavesdropper can
still analyze the pattern of traffic and launch advanced attacks such as flow tracing and traffic
analysis. Due to these advanced attacks the privacy of the users is compromised. This paper
proposes a new network coding mechanism to protect the privacy in sensor network against
the global eavesdropper. We use the source imitation approach to calculate the candidate
traces which can transmit data at the same time and same rate. The proposed scheme also
uses the optimal path among the candidate traces for the faster transfer of data. Through the
simulation and analysis, we exhibit that the proposed scheme is both energy efficient and
successful in providing privacy in sensor networks.

References

[1] Yanfei Fan, Yixin Jiang, Haojin Zhu, Jiming Chen, XueminShen, Network Coding
Based Privacy Preservation against Traffic Analysis in Multi-Hop Wireless Networks,
IEEE Transaction on Wireless Communication, Vol. 10, no. 3, 2011

[2]Kiran Mehta, Donggang Liu, Matthew Wright, Protecting Location Privacy in
Sensor Networks against a Global Eavesdropper IEEE Transactions on Mobile
Computing, Vol. 11, No.2, 2012

[3] Xi Luo, XuJi, and Myong-Soon Park, Location Privacy against Traffic Analysis
Attacks in Wireless Sensor Networks 2010

[4] Yanfei Fan, XueminShen, Xiaodong Lin and Jiming Chen, Preventing Traffic
Explosion and Achieving Source Unobservability in Multi-hop Wireless Networks using
Network Coding 2010
[5] M. Adeli and H. Liu, Secure network coding with minimum overhead based on
hash functions, IEEE Commun. Lett., vol. 13, no. 12, pp. 956-958, 2009

[6] Y. Yang, M. Shao, S. Zhu, B. Urgaonkar, and G. Cao, Towards Event Source
Unobservability with Minimum Network Traffic in Sensor Networks, Proc. ACM
Conf. Wireless Network Security (WiSec 08), 2008

[7] T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, A
random linear network coding approach to multicast, I EEE Trans. I nf. Theory, vol.
52,
no. 10, pp. 4413-4430, 2006.

[8] B. Bamba, L. Liu, P. Pesti, and T. Wang, Supporting Anonymous Location
Queries
in Mobile Environments with Privacygrid, Proc. Intl Conf. 2008.

[9] Sumit J, Jaydeep H, Prasenjit C A Review of Anonymous Communications Mix