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

Wireless sensor network (WSN) consists of many hosts called sensors. These sensors can sense a phenomenon (motion, temperature, humidity, average, max, min, etc.) and represent what they sense in a form of data. There are many applications for WSNs including object tracking and monitoring where in most of the cases these objects need protection. In these applications, data privacy itself might not be as important as the privacy of source location. In addition to the source location privacy, sink location privacy should also be provided. Providing an efficient end-to-end privacy solution would be a challenging task to achieve due to the open nature of the WSN. The key schemes needed for end-to-end location privacy are anonymity, observability, capture likelihood, and safety period. We extend this work to allow for countermeasures against multi-local and global adversaries. We present a network model protected against a sophisticated threat model: passive /active and local/multi-local/global attacks. This work provides a solution for end-to-end anonymity and location privacy as well. We will introduce a framework called fortified anonymous communication (FAC) protocol for WSN.http://dx.doi.org/10.3390/s15030582

Generalized Lehmer-Tausworthe random number generators

We study a general class of random number generators which includes Lehmer\u27s congruential generator and the Tausworthe shift-register generator as special cases. The generators in this class use a general linear recurrence relation defined by a primitive polynomial over a large finite field. This generator, like the Tausworthe generator, has the property of the kspace equi-distribution. We give some theoretical and heuristic justincation for its asymptotic uniformity as well as asymptotic independence from a statistical theory viewpoint. In this paper, we also propose an efficient method of nnding primitive polynomials in a large finite fieid. Several generators with extremely long cycles are presented

Fortified End-to-End Location Privacy and Anonymity in Wireless Sensor Networks: a Modular Approach

Wireless sensor network (WSN) consists of many hosts called sensors. These sensors can sense a phenomenon (motion, temperature, humidity, average, max, min, etc.) and represent what they sense in a form of data. There are many applications for WSNs; including object tracking and monitoring where in most of the cases these objects need protection. In these applications, data privacy itself might not be as important as the privacy of source location. In addition to the source location privacy, sink location privacy should also be provided. Providing an efficient end-to-end privacy solution would be a challenging task to achieve due to the open nature of the WSN. The key schemes needed for end-to-end location privacy are anonymity, observability, capture likelihood, and safety period. We extend this work to allow for countermeasures against multi-local and global adversaries. We present a network model that is protected against a sophisticated threat model: passive /active and local/multi-local/global attacks. This work provides a solution for end-to-end anonymity and location privacy as well. We will introduce a framework called fortified anonymous communication (FAC) protocol for WSN