Security and privacy support for wireless sensor networks
by Shao, Min, Ph.D., THE PENNSYLVANIA STATE UNIVERSITY, 2008, 147 pages; 3346374

Abstract:

Sensor networks are considered useful for a broad spectrum of emerging civil and military applications. However, sensor networks are also confronted with many security threats such as node compromise, routing disruption, and false data injection, because they normally operate in unattended, harsh or hostile environments. Due to the unique characteristics of sensor networks, such as limited system resources and large-scale deployment, traditional security and privacy solutions cannot be applied to them.

The goal of this dissertation is to provide ways to deal with security and privacy attacks on sensor networks. First, we design and evaluate solutions for local, passive, external attackers. Traditionally, dummy messages are used to hide the event source. To reduce the message overhead, we propose a cross-layer solution utilizing beacons at the MAC layer. In this solution, the event information is first propagated several hops through a MAC-layer beacon. Then, it is propagated in the routing layer to the destination to avoid further beacon delay. Second, to defend against global, passive, and external attackers, dummy messages are used. To reduce the event notification delay, we propose a FitProbRate scheme based on a statistically strong source anonymity model. Our analysis and simulation results show that this scheme, besides providing provable privacy, significantly reduces real event reporting latency compared to other schemes. To reduce the network traffic, we select some sensors as proxies that proactively filter dummy messages on their way to the base station. Since the problem of optimal proxy placement is NP-hard, we employ local search heuristics. We propose a Proxy-based Filtering Scheme and a Tree-based Filtering Scheme to accurately locate proxies. Simulation results show that our schemes not only quickly find nearly optimal proxy placement, but also significantly reduce message overhead and improve message delivery ratio. Finally, we study the internal attacker in data-centric sensor networks (DCS) and present pDCS, a privacy-enhanced DCS network that offers different levels of data privacy based on different cryptographic keys. In addition, we propose several query optimization techniques based on the Euclidean Steiner Tree and Keyed Bloom Filter to minimize the query overhead while providing certain query privacy. Detailed analysis and simulations show that the Keyed Bloom Filter scheme can significantly reduce message overhead with the same level of query delay and maintain a very high level of query privacy.

 
AdviserGuohong Cao
SchoolTHE PENNSYLVANIA STATE UNIVERSITY
SourceDAI/B 70-02, p. , Apr 2009
Source TypeDissertation
SubjectsComputer science
Publication Number3346374
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3346374
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.