Maximizing lifetime of event-unobservable wireless sensor networks

In wireless sensor networks (WSNs) contextual information such as the information regarding whether, when, and where the data is collected cannot be protected using only traditional measures (e.g., encryption). Contextual information can be protected against global eavesdroppers by periodic packet transmission combined with dummy traffic filtering at proxy nodes. In this paper, through a Linear Programming (LP) framework, we analyze lifetime limits of WSNs preserving event-unobservability with different proxy assignment methodologies. We show that to maximize the network lifetime data flow should pass through multiple proxies that are organized as a general directed graph rather than as a tree.

[1]  Pravin Varaiya,et al.  On multi-hop routing for energy efficiency , 2005, IEEE Communications Letters.

[2]  Sencun Zhu,et al.  Towards Statistically Strong Source Anonymity for Sensor Networks , 2008, INFOCOM.

[3]  Stephen B. Wicker,et al.  Transactional Confidentiality in Sensor Networks , 2008, IEEE Security & Privacy.

[4]  Kemal Bicakci,et al.  Prolonging network lifetime with multi-domain cooperation strategies in wireless sensor networks , 2010, Ad Hoc Networks.

[5]  Bülent Tavli,et al.  Mitigation of Compromising Privacy by Transmission Range Control in Wireless Sensor Networks , 2010, IEEE Communications Letters.

[6]  Ronald L. Rardin,et al.  Optimization in operations research , 1997 .

[7]  Shivakant Mishra,et al.  Countermeasures Against Traffic Analysis Attacks in Wireless Sensor Networks , 2005, First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05).

[8]  Wade Trappe,et al.  Enhancing Source-Location Privacy in Sensor Network Routing , 2005, ICDCS.

[9]  Bülent Tavli,et al.  The future of security in Wireless Multimedia Sensor Networks , 2010, Telecommun. Syst..

[10]  Bo Sheng,et al.  Privacy-aware routing in sensor networks , 2009, Comput. Networks.

[11]  Sencun Zhu,et al.  Towards event source unobservability with minimum network traffic in sensor networks , 2008, WiSec '08.

[12]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[13]  Bülent Tavli,et al.  Optimal data compression and forwarding in wireless sensor networks , 2010, IEEE Communications Letters.

[14]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[16]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[17]  Donggang Liu,et al.  Location Privacy in Sensor Networks Against a Global Eavesdropper , 2007, 2007 IEEE International Conference on Network Protocols.

[18]  Fillia Makedon,et al.  Source location privacy against laptop-class attacks in sensor networks , 2008, SecureComm.

[19]  Wendi B. Heinzelman,et al.  General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies , 2008, IEEE Transactions on Mobile Computing.

[20]  Yong Wang,et al.  A survey of security issues in wireless sensor networks , 2006, IEEE Communications Surveys & Tutorials.

[21]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..