Toward a statistical framework for source anonymity in sensor network using quantitative measures
Authors:
- 1 March 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
In some applications in sensor network the location and privacy of certain events must remain anonymous or undetected even by analyzing the network traffic. In this paper the framework for modeling, investigating and evaluating the sensor network is suggested and results are charted. Suggested two folded structure introduces the notion of “interval indistinguishability” which gives a quantitative evaluation to form anonymity in sensor network and secondly it charts source anonymity to statistical problem of binary hypothesis checking with nuisance parameters. The system is made energy efficient by enhancing the available techniques for choosing cluster head. The energy efficiency of the sensor network is charted.Keywords
This publication has 11 references indexed in Scilit:
- Random-walk based approach to detect clone attacks in wireless sensor networksIEEE Journal on Selected Areas in Communications, 2010
- Protecting Source Location Privacy in Wireless Sensor Networks with Data Aggregation2010
- A self-adaptive probabilistic packet filtering scheme against entropy attacks in network codingComputer Networks, 2009
- Privacy preservation in wireless sensor networks: A state-of-the-art surveyAd Hoc Networks, 2009
- Wireless sensor network surveyComputer Networks, 2008
- Routing techniques in wireless sensor networks: a surveyIEEE Wireless Communications, 2004
- SPINS: Security Protocols for Sensor NetworksWireless Networks, 2002
- Wireless sensor networks: a surveyComputer Networks, 2002
- A key-management scheme for distributed sensor networks2002
- A Test for Normality of Observations and Regression ResidualsInternational Statistical Review, 1987