Dealing with liars

Misbehavior identification via Rényi-Ulam games

William Kozma, Loukas Lazos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

Original languageEnglish (US)
Title of host publicationLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Pages207-227
Number of pages21
Volume19 LNICST
DOIs
StatePublished - 2009
Event5th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2009 - Athens, Greece
Duration: Sep 14 2009Sep 18 2009

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume19 LNICST
ISSN (Print)18678211

Other

Other5th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2009
CountryGreece
CityAthens
Period9/14/099/18/09

Fingerprint

Communication

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Kozma, W., & Lazos, L. (2009). Dealing with liars: Misbehavior identification via Rényi-Ulam games. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 19 LNICST, pp. 207-227). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 19 LNICST). https://doi.org/10.1007/978-3-642-05284-2_12

Dealing with liars : Misbehavior identification via Rényi-Ulam games. / Kozma, William; Lazos, Loukas.

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. Vol. 19 LNICST 2009. p. 207-227 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 19 LNICST).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kozma, W & Lazos, L 2009, Dealing with liars: Misbehavior identification via Rényi-Ulam games. in Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. vol. 19 LNICST, Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 19 LNICST, pp. 207-227, 5th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2009, Athens, Greece, 9/14/09. https://doi.org/10.1007/978-3-642-05284-2_12
Kozma W, Lazos L. Dealing with liars: Misbehavior identification via Rényi-Ulam games. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. Vol. 19 LNICST. 2009. p. 207-227. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering). https://doi.org/10.1007/978-3-642-05284-2_12
Kozma, William ; Lazos, Loukas. / Dealing with liars : Misbehavior identification via Rényi-Ulam games. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. Vol. 19 LNICST 2009. pp. 207-227 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
@inproceedings{a2a2d4a347d54b72930f5e2496537516,
title = "Dealing with liars: Misbehavior identification via R{\'e}nyi-Ulam games",
abstract = "We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic R{\'e}nyi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.",
author = "William Kozma and Loukas Lazos",
year = "2009",
doi = "10.1007/978-3-642-05284-2_12",
language = "English (US)",
isbn = "3642052835",
volume = "19 LNICST",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",
pages = "207--227",
booktitle = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",

}

TY - GEN

T1 - Dealing with liars

T2 - Misbehavior identification via Rényi-Ulam games

AU - Kozma, William

AU - Lazos, Loukas

PY - 2009

Y1 - 2009

N2 - We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

AB - We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

UR - http://www.scopus.com/inward/record.url?scp=84885887137&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885887137&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-05284-2_12

DO - 10.1007/978-3-642-05284-2_12

M3 - Conference contribution

SN - 3642052835

SN - 9783642052835

VL - 19 LNICST

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

SP - 207

EP - 227

BT - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

ER -