Secure communications over wireless broadcast networks: Stability and utility maximization

Yingbin Liang, H. Vincent Poor, Lei Ying

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

A wireless broadcast network model with secrecy constraints is investigated, in which a source node broadcasts K confidential message flows to K user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all other users (who are thus considered to be eavesdroppers with regard to all other messages but their own). The source maintains a queue for each message flow if it is not served immediately. The channel from the source to the K users is modeled as a fading broadcast channel, and the channel state information is assumed to be known to the source and the corresponding receivers. Two eavesdropping models are considered. For a collaborative eavesdropping model, in which the eavesdroppers exchange their outputs, the secrecy capacity region is obtained, within which each rate vector is achieved by using a time-division scheme and a source power control policy over channel states. A throughput optimal queue-length-based rate scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. Moreover, the network utility function is maximized via joint design of rate control, rate scheduling, power control, and secure coding. More precisely, a source controls the message arrival rate according to its message queue, the rate scheduling selects a transmission rate based the queue length vector, and the rate vector is achieved by power control and secure coding. These components work jointly to solve the network utility maximization problem. For a noncollaborative eavesdropping model, in which eavesdroppers do not exchange their outputs, an achievable secrecy rate region is derived based on a time-division scheme, and the queue-length-based rate scheduling algorithm and the corresponding power control policy are obtained that stabilize all arrival rate vectors in this region. The network utility maximizing rate control vector is also obtained.

Original languageEnglish (US)
Article number5782980
Pages (from-to)682-692
Number of pages11
JournalIEEE Transactions on Information Forensics and Security
Volume6
Issue number3 PART 1
DOIs
StatePublished - Sep 2011
Externally publishedYes

Fingerprint

Wireless networks
Power control
Scheduling algorithms
Scheduling
Channel state information
Fading channels
Throughput
Secure communication

Keywords

  • Broadcast channel
  • power control
  • queue-length-based algorithm
  • rate control
  • rate scheduling
  • secrecy capacity region
  • stability
  • utility maximization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Cite this

Secure communications over wireless broadcast networks : Stability and utility maximization. / Liang, Yingbin; Poor, H. Vincent; Ying, Lei.

In: IEEE Transactions on Information Forensics and Security, Vol. 6, No. 3 PART 1, 5782980, 09.2011, p. 682-692.

Research output: Contribution to journalArticle

@article{bde00c805706412c9d9b229d18573c7b,
title = "Secure communications over wireless broadcast networks: Stability and utility maximization",
abstract = "A wireless broadcast network model with secrecy constraints is investigated, in which a source node broadcasts K confidential message flows to K user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all other users (who are thus considered to be eavesdroppers with regard to all other messages but their own). The source maintains a queue for each message flow if it is not served immediately. The channel from the source to the K users is modeled as a fading broadcast channel, and the channel state information is assumed to be known to the source and the corresponding receivers. Two eavesdropping models are considered. For a collaborative eavesdropping model, in which the eavesdroppers exchange their outputs, the secrecy capacity region is obtained, within which each rate vector is achieved by using a time-division scheme and a source power control policy over channel states. A throughput optimal queue-length-based rate scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. Moreover, the network utility function is maximized via joint design of rate control, rate scheduling, power control, and secure coding. More precisely, a source controls the message arrival rate according to its message queue, the rate scheduling selects a transmission rate based the queue length vector, and the rate vector is achieved by power control and secure coding. These components work jointly to solve the network utility maximization problem. For a noncollaborative eavesdropping model, in which eavesdroppers do not exchange their outputs, an achievable secrecy rate region is derived based on a time-division scheme, and the queue-length-based rate scheduling algorithm and the corresponding power control policy are obtained that stabilize all arrival rate vectors in this region. The network utility maximizing rate control vector is also obtained.",
keywords = "Broadcast channel, power control, queue-length-based algorithm, rate control, rate scheduling, secrecy capacity region, stability, utility maximization",
author = "Yingbin Liang and Poor, {H. Vincent} and Lei Ying",
year = "2011",
month = "9",
doi = "10.1109/TIFS.2011.2158311",
language = "English (US)",
volume = "6",
pages = "682--692",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3 PART 1",

}

TY - JOUR

T1 - Secure communications over wireless broadcast networks

T2 - Stability and utility maximization

AU - Liang, Yingbin

AU - Poor, H. Vincent

AU - Ying, Lei

PY - 2011/9

Y1 - 2011/9

N2 - A wireless broadcast network model with secrecy constraints is investigated, in which a source node broadcasts K confidential message flows to K user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all other users (who are thus considered to be eavesdroppers with regard to all other messages but their own). The source maintains a queue for each message flow if it is not served immediately. The channel from the source to the K users is modeled as a fading broadcast channel, and the channel state information is assumed to be known to the source and the corresponding receivers. Two eavesdropping models are considered. For a collaborative eavesdropping model, in which the eavesdroppers exchange their outputs, the secrecy capacity region is obtained, within which each rate vector is achieved by using a time-division scheme and a source power control policy over channel states. A throughput optimal queue-length-based rate scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. Moreover, the network utility function is maximized via joint design of rate control, rate scheduling, power control, and secure coding. More precisely, a source controls the message arrival rate according to its message queue, the rate scheduling selects a transmission rate based the queue length vector, and the rate vector is achieved by power control and secure coding. These components work jointly to solve the network utility maximization problem. For a noncollaborative eavesdropping model, in which eavesdroppers do not exchange their outputs, an achievable secrecy rate region is derived based on a time-division scheme, and the queue-length-based rate scheduling algorithm and the corresponding power control policy are obtained that stabilize all arrival rate vectors in this region. The network utility maximizing rate control vector is also obtained.

AB - A wireless broadcast network model with secrecy constraints is investigated, in which a source node broadcasts K confidential message flows to K user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all other users (who are thus considered to be eavesdroppers with regard to all other messages but their own). The source maintains a queue for each message flow if it is not served immediately. The channel from the source to the K users is modeled as a fading broadcast channel, and the channel state information is assumed to be known to the source and the corresponding receivers. Two eavesdropping models are considered. For a collaborative eavesdropping model, in which the eavesdroppers exchange their outputs, the secrecy capacity region is obtained, within which each rate vector is achieved by using a time-division scheme and a source power control policy over channel states. A throughput optimal queue-length-based rate scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. Moreover, the network utility function is maximized via joint design of rate control, rate scheduling, power control, and secure coding. More precisely, a source controls the message arrival rate according to its message queue, the rate scheduling selects a transmission rate based the queue length vector, and the rate vector is achieved by power control and secure coding. These components work jointly to solve the network utility maximization problem. For a noncollaborative eavesdropping model, in which eavesdroppers do not exchange their outputs, an achievable secrecy rate region is derived based on a time-division scheme, and the queue-length-based rate scheduling algorithm and the corresponding power control policy are obtained that stabilize all arrival rate vectors in this region. The network utility maximizing rate control vector is also obtained.

KW - Broadcast channel

KW - power control

KW - queue-length-based algorithm

KW - rate control

KW - rate scheduling

KW - secrecy capacity region

KW - stability

KW - utility maximization

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

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

U2 - 10.1109/TIFS.2011.2158311

DO - 10.1109/TIFS.2011.2158311

M3 - Article

AN - SCOPUS:80051779980

VL - 6

SP - 682

EP - 692

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 3 PART 1

M1 - 5782980

ER -