A clean slate design for secure wireless ad-hoc networks - Part 1: Closed synchronized networks

Jonathan Ponniah, Yih Chun Hu, P. R. Kumar

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

Abstract

We propose a clean-slate, holistic approach to the design of secure protocols for wireless ad-hoc networks. We design a protocol that enables a collection of distributed nodes to emerge from a primordial birth and form a functioning network. We consider the case when nodes are synchronized and the network is closed, in that no other nodes can join. We define a game between protocols and adversarial nodes, and describe a protocol that is guaranteed to achieve the max-min payoff regardless of what the adversarial nodes do. Moreover, even though the adversarial nodes always know the protocol a priori, we show an even stronger result; the protocol is guaranteed to achieve the min-max payoff. Hence there is a saddle point in the game between protocols and adversarial strategies. Finally, we show that the adversarial nodes are in effect, strategically confined to either jamming or conforming to the protocol. These guarantees are contingent on a set of underlying model assumptions, and cease to be valid if the assumptions are violated.

Original languageEnglish (US)
Title of host publication2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages175-182
Number of pages8
ISBN (Electronic)9783901882746
DOIs
StatePublished - Jul 6 2015
Event2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015 - Mumbai, India
Duration: May 25 2015May 29 2015

Publication series

Name2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015

Other

Other2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015
CountryIndia
CityMumbai
Period5/25/155/29/15

Fingerprint

Slate
Wireless Ad Hoc Networks
Wireless ad hoc networks
Network protocols
Closed
Vertex of a graph
Min-max
Game
Design
Jamming
Saddlepoint
Join
Valid

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Optimization
  • Modeling and Simulation

Cite this

Ponniah, J., Hu, Y. C., & Kumar, P. R. (2015). A clean slate design for secure wireless ad-hoc networks - Part 1: Closed synchronized networks. In 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015 (pp. 175-182). [7151070] (2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WIOPT.2015.7151070

A clean slate design for secure wireless ad-hoc networks - Part 1 : Closed synchronized networks. / Ponniah, Jonathan; Hu, Yih Chun; Kumar, P. R.

2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 175-182 7151070 (2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015).

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

Ponniah, J, Hu, YC & Kumar, PR 2015, A clean slate design for secure wireless ad-hoc networks - Part 1: Closed synchronized networks. in 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015., 7151070, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015, Institute of Electrical and Electronics Engineers Inc., pp. 175-182, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015, Mumbai, India, 5/25/15. https://doi.org/10.1109/WIOPT.2015.7151070
Ponniah J, Hu YC, Kumar PR. A clean slate design for secure wireless ad-hoc networks - Part 1: Closed synchronized networks. In 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 175-182. 7151070. (2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015). https://doi.org/10.1109/WIOPT.2015.7151070
Ponniah, Jonathan ; Hu, Yih Chun ; Kumar, P. R. / A clean slate design for secure wireless ad-hoc networks - Part 1 : Closed synchronized networks. 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 175-182 (2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015).
@inproceedings{4ac12b1b49b148f8b82b5dc17d013443,
title = "A clean slate design for secure wireless ad-hoc networks - Part 1: Closed synchronized networks",
abstract = "We propose a clean-slate, holistic approach to the design of secure protocols for wireless ad-hoc networks. We design a protocol that enables a collection of distributed nodes to emerge from a primordial birth and form a functioning network. We consider the case when nodes are synchronized and the network is closed, in that no other nodes can join. We define a game between protocols and adversarial nodes, and describe a protocol that is guaranteed to achieve the max-min payoff regardless of what the adversarial nodes do. Moreover, even though the adversarial nodes always know the protocol a priori, we show an even stronger result; the protocol is guaranteed to achieve the min-max payoff. Hence there is a saddle point in the game between protocols and adversarial strategies. Finally, we show that the adversarial nodes are in effect, strategically confined to either jamming or conforming to the protocol. These guarantees are contingent on a set of underlying model assumptions, and cease to be valid if the assumptions are violated.",
author = "Jonathan Ponniah and Hu, {Yih Chun} and Kumar, {P. R.}",
year = "2015",
month = "7",
day = "6",
doi = "10.1109/WIOPT.2015.7151070",
language = "English (US)",
series = "2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "175--182",
booktitle = "2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015",
address = "United States",

}

TY - GEN

T1 - A clean slate design for secure wireless ad-hoc networks - Part 1

T2 - Closed synchronized networks

AU - Ponniah, Jonathan

AU - Hu, Yih Chun

AU - Kumar, P. R.

PY - 2015/7/6

Y1 - 2015/7/6

N2 - We propose a clean-slate, holistic approach to the design of secure protocols for wireless ad-hoc networks. We design a protocol that enables a collection of distributed nodes to emerge from a primordial birth and form a functioning network. We consider the case when nodes are synchronized and the network is closed, in that no other nodes can join. We define a game between protocols and adversarial nodes, and describe a protocol that is guaranteed to achieve the max-min payoff regardless of what the adversarial nodes do. Moreover, even though the adversarial nodes always know the protocol a priori, we show an even stronger result; the protocol is guaranteed to achieve the min-max payoff. Hence there is a saddle point in the game between protocols and adversarial strategies. Finally, we show that the adversarial nodes are in effect, strategically confined to either jamming or conforming to the protocol. These guarantees are contingent on a set of underlying model assumptions, and cease to be valid if the assumptions are violated.

AB - We propose a clean-slate, holistic approach to the design of secure protocols for wireless ad-hoc networks. We design a protocol that enables a collection of distributed nodes to emerge from a primordial birth and form a functioning network. We consider the case when nodes are synchronized and the network is closed, in that no other nodes can join. We define a game between protocols and adversarial nodes, and describe a protocol that is guaranteed to achieve the max-min payoff regardless of what the adversarial nodes do. Moreover, even though the adversarial nodes always know the protocol a priori, we show an even stronger result; the protocol is guaranteed to achieve the min-max payoff. Hence there is a saddle point in the game between protocols and adversarial strategies. Finally, we show that the adversarial nodes are in effect, strategically confined to either jamming or conforming to the protocol. These guarantees are contingent on a set of underlying model assumptions, and cease to be valid if the assumptions are violated.

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

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

U2 - 10.1109/WIOPT.2015.7151070

DO - 10.1109/WIOPT.2015.7151070

M3 - Conference contribution

AN - SCOPUS:84941073694

T3 - 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015

SP - 175

EP - 182

BT - 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -