Home > Research > Publications & Outputs > Maximizing lifetime of event-unobservable wirel...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

Maximizing lifetime of event-unobservable wireless sensor networks

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Maximizing lifetime of event-unobservable wireless sensor networks. / Bicakci, Kemal; Gultekin, Hakan; Tavli, Bulent et al.
In: Computer Standards and Interfaces, Vol. 33, No. 4, 06.2011, p. 401-410.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Bicakci, K, Gultekin, H, Tavli, B & Bagci, IE 2011, 'Maximizing lifetime of event-unobservable wireless sensor networks', Computer Standards and Interfaces, vol. 33, no. 4, pp. 401-410. https://doi.org/10.1016/j.csi.2011.01.001

APA

Bicakci, K., Gultekin, H., Tavli, B., & Bagci, I. E. (2011). Maximizing lifetime of event-unobservable wireless sensor networks. Computer Standards and Interfaces, 33(4), 401-410. https://doi.org/10.1016/j.csi.2011.01.001

Vancouver

Bicakci K, Gultekin H, Tavli B, Bagci IE. Maximizing lifetime of event-unobservable wireless sensor networks. Computer Standards and Interfaces. 2011 Jun;33(4):401-410. doi: 10.1016/j.csi.2011.01.001

Author

Bicakci, Kemal ; Gultekin, Hakan ; Tavli, Bulent et al. / Maximizing lifetime of event-unobservable wireless sensor networks. In: Computer Standards and Interfaces. 2011 ; Vol. 33, No. 4. pp. 401-410.

Bibtex

@article{ebf389cd81c144148eaabfc479f3e7e7,
title = "Maximizing lifetime of event-unobservable wireless sensor networks",
abstract = "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.",
keywords = "Wireless sensor networks, Contextual privacy , Transactional confidentiality , Privacy , Location privacy , Event-unobservability , Linear Programming",
author = "Kemal Bicakci and Hakan Gultekin and Bulent Tavli and Bagci, {Ibrahim Ethem}",
year = "2011",
month = jun,
doi = "10.1016/j.csi.2011.01.001",
language = "English",
volume = "33",
pages = "401--410",
journal = "Computer Standards and Interfaces",
issn = "0920-5489",
publisher = "ELSEVIER SCIENCE BV",
number = "4",

}

RIS

TY - JOUR

T1 - Maximizing lifetime of event-unobservable wireless sensor networks

AU - Bicakci, Kemal

AU - Gultekin, Hakan

AU - Tavli, Bulent

AU - Bagci, Ibrahim Ethem

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

KW - Wireless sensor networks

KW - Contextual privacy

KW - Transactional confidentiality

KW - Privacy

KW - Location privacy

KW - Event-unobservability

KW - Linear Programming

U2 - 10.1016/j.csi.2011.01.001

DO - 10.1016/j.csi.2011.01.001

M3 - Journal article

VL - 33

SP - 401

EP - 410

JO - Computer Standards and Interfaces

JF - Computer Standards and Interfaces

SN - 0920-5489

IS - 4

ER -