Time-delayed broadcasting for defeating inside jammers

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We address the problem of jamming-resistant broadcast communications under an internal threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the broadcast operation as a series of unicast transmissions distributed in frequency and time. TDBS does not rely on commonly shared secrets, or the existence of jamming-immune control channels for coordinating broadcasts. Instead, each node follows a unique pseudo-noise (PN) frequency hopping sequence. Contrary to conventional PN sequences designed for multi-access systems, the PN sequences in TDBS exhibit correlation to enable broadcast. Moreover, they are designed to limit the information leakage due to the exposure of a subset of sequences by compromised nodes. We map the problem of constructing such PN sequences to the 1-factorization problem for complete graphs. We further accommodate dynamic broadcast groups by mapping the problem of updating the assigned PN sequences to the problem of constructing rainbow paths in proper edge-colored graphs.

Original languageEnglish (US)
Article number6847182
Pages (from-to)351-365
Number of pages15
JournalIEEE Transactions on Dependable and Secure Computing
Volume12
Issue number3
DOIs
StatePublished - May 1 2015

Fingerprint

Jamming
Broadcasting
Frequency hopping
Factorization
Communication

Keywords

  • broadcast communications
  • denial-of-service
  • graph factorization
  • Jamming
  • security
  • wireless networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Time-delayed broadcasting for defeating inside jammers. / Liu, Sisi; Lazos, Loukas; Krunz, Marwan M.

In: IEEE Transactions on Dependable and Secure Computing, Vol. 12, No. 3, 6847182, 01.05.2015, p. 351-365.

Research output: Contribution to journalArticle

@article{effca8fbfe2b4441ab37fe468c699838,
title = "Time-delayed broadcasting for defeating inside jammers",
abstract = "We address the problem of jamming-resistant broadcast communications under an internal threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the broadcast operation as a series of unicast transmissions distributed in frequency and time. TDBS does not rely on commonly shared secrets, or the existence of jamming-immune control channels for coordinating broadcasts. Instead, each node follows a unique pseudo-noise (PN) frequency hopping sequence. Contrary to conventional PN sequences designed for multi-access systems, the PN sequences in TDBS exhibit correlation to enable broadcast. Moreover, they are designed to limit the information leakage due to the exposure of a subset of sequences by compromised nodes. We map the problem of constructing such PN sequences to the 1-factorization problem for complete graphs. We further accommodate dynamic broadcast groups by mapping the problem of updating the assigned PN sequences to the problem of constructing rainbow paths in proper edge-colored graphs.",
keywords = "broadcast communications, denial-of-service, graph factorization, Jamming, security, wireless networks",
author = "Sisi Liu and Loukas Lazos and Krunz, {Marwan M}",
year = "2015",
month = "5",
day = "1",
doi = "10.1109/TDSC.2014.2334308",
language = "English (US)",
volume = "12",
pages = "351--365",
journal = "IEEE Transactions on Dependable and Secure Computing",
issn = "1545-5971",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Time-delayed broadcasting for defeating inside jammers

AU - Liu, Sisi

AU - Lazos, Loukas

AU - Krunz, Marwan M

PY - 2015/5/1

Y1 - 2015/5/1

N2 - We address the problem of jamming-resistant broadcast communications under an internal threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the broadcast operation as a series of unicast transmissions distributed in frequency and time. TDBS does not rely on commonly shared secrets, or the existence of jamming-immune control channels for coordinating broadcasts. Instead, each node follows a unique pseudo-noise (PN) frequency hopping sequence. Contrary to conventional PN sequences designed for multi-access systems, the PN sequences in TDBS exhibit correlation to enable broadcast. Moreover, they are designed to limit the information leakage due to the exposure of a subset of sequences by compromised nodes. We map the problem of constructing such PN sequences to the 1-factorization problem for complete graphs. We further accommodate dynamic broadcast groups by mapping the problem of updating the assigned PN sequences to the problem of constructing rainbow paths in proper edge-colored graphs.

AB - We address the problem of jamming-resistant broadcast communications under an internal threat model. We propose a time-delayed broadcast scheme (TDBS), which implements the broadcast operation as a series of unicast transmissions distributed in frequency and time. TDBS does not rely on commonly shared secrets, or the existence of jamming-immune control channels for coordinating broadcasts. Instead, each node follows a unique pseudo-noise (PN) frequency hopping sequence. Contrary to conventional PN sequences designed for multi-access systems, the PN sequences in TDBS exhibit correlation to enable broadcast. Moreover, they are designed to limit the information leakage due to the exposure of a subset of sequences by compromised nodes. We map the problem of constructing such PN sequences to the 1-factorization problem for complete graphs. We further accommodate dynamic broadcast groups by mapping the problem of updating the assigned PN sequences to the problem of constructing rainbow paths in proper edge-colored graphs.

KW - broadcast communications

KW - denial-of-service

KW - graph factorization

KW - Jamming

KW - security

KW - wireless networks

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

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

U2 - 10.1109/TDSC.2014.2334308

DO - 10.1109/TDSC.2014.2334308

M3 - Article

AN - SCOPUS:84929319644

VL - 12

SP - 351

EP - 365

JO - IEEE Transactions on Dependable and Secure Computing

JF - IEEE Transactions on Dependable and Secure Computing

SN - 1545-5971

IS - 3

M1 - 6847182

ER -