Wireless broadcast networks: Reliability, security, and stability

Yingbin Liang, H. Vincent Poor, Lei Ying

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

23 Citations (Scopus)

Abstract

A secure wireless broadcast network model is investigated, in which a source node broadcasts K confidential message flows to N user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all of 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 modelled as a fading broadcast channel, and the channel state information is assumed to be known to all nodes. Two eavesdropping models are considered. For a collaborative eaves-dropping 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 scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. At each packet time slot, the queue length vector determines the power control policy over the channel states at the source, and hence determines the secrecy rate allocation among users. For a non-collaborative model, in which eavesdroppers do not exchange their outputs, the time-division scheme provides an achievable secrecy rate region, and the queue length based scheduling algorithm stabilizes all arrival rate vectors in this region.

Original languageEnglish (US)
Title of host publication2008 Information Theory and Applications Workshop - Conference Proceedings, ITA
Pages249-255
Number of pages7
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 Information Theory and Applications Workshop - ITA - San Diego, CA, United States
Duration: Jan 27 2008Feb 1 2008

Other

Other2008 Information Theory and Applications Workshop - ITA
CountryUnited States
CitySan Diego, CA
Period1/27/082/1/08

Fingerprint

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

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Liang, Y., Poor, H. V., & Ying, L. (2008). Wireless broadcast networks: Reliability, security, and stability. In 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA (pp. 249-255). [4601057] https://doi.org/10.1109/ITA.2008.4601057

Wireless broadcast networks : Reliability, security, and stability. / Liang, Yingbin; Poor, H. Vincent; Ying, Lei.

2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. 2008. p. 249-255 4601057.

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

Liang, Y, Poor, HV & Ying, L 2008, Wireless broadcast networks: Reliability, security, and stability. in 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA., 4601057, pp. 249-255, 2008 Information Theory and Applications Workshop - ITA, San Diego, CA, United States, 1/27/08. https://doi.org/10.1109/ITA.2008.4601057
Liang Y, Poor HV, Ying L. Wireless broadcast networks: Reliability, security, and stability. In 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. 2008. p. 249-255. 4601057 https://doi.org/10.1109/ITA.2008.4601057
Liang, Yingbin ; Poor, H. Vincent ; Ying, Lei. / Wireless broadcast networks : Reliability, security, and stability. 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. 2008. pp. 249-255
@inproceedings{f41817da1bc241d2ae308c8378d3c7d7,
title = "Wireless broadcast networks: Reliability, security, and stability",
abstract = "A secure wireless broadcast network model is investigated, in which a source node broadcasts K confidential message flows to N user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all of 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 modelled as a fading broadcast channel, and the channel state information is assumed to be known to all nodes. Two eavesdropping models are considered. For a collaborative eaves-dropping 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 scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. At each packet time slot, the queue length vector determines the power control policy over the channel states at the source, and hence determines the secrecy rate allocation among users. For a non-collaborative model, in which eavesdroppers do not exchange their outputs, the time-division scheme provides an achievable secrecy rate region, and the queue length based scheduling algorithm stabilizes all arrival rate vectors in this region.",
author = "Yingbin Liang and Poor, {H. Vincent} and Lei Ying",
year = "2008",
doi = "10.1109/ITA.2008.4601057",
language = "English (US)",
isbn = "1424426707",
pages = "249--255",
booktitle = "2008 Information Theory and Applications Workshop - Conference Proceedings, ITA",

}

TY - GEN

T1 - Wireless broadcast networks

T2 - Reliability, security, and stability

AU - Liang, Yingbin

AU - Poor, H. Vincent

AU - Ying, Lei

PY - 2008

Y1 - 2008

N2 - A secure wireless broadcast network model is investigated, in which a source node broadcasts K confidential message flows to N user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all of 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 modelled as a fading broadcast channel, and the channel state information is assumed to be known to all nodes. Two eavesdropping models are considered. For a collaborative eaves-dropping 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 scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. At each packet time slot, the queue length vector determines the power control policy over the channel states at the source, and hence determines the secrecy rate allocation among users. For a non-collaborative model, in which eavesdroppers do not exchange their outputs, the time-division scheme provides an achievable secrecy rate region, and the queue length based scheduling algorithm stabilizes all arrival rate vectors in this region.

AB - A secure wireless broadcast network model is investigated, in which a source node broadcasts K confidential message flows to N user nodes, with each message intended to be decoded accurately by one user and to be kept secret from all of 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 modelled as a fading broadcast channel, and the channel state information is assumed to be known to all nodes. Two eavesdropping models are considered. For a collaborative eaves-dropping 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 scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. At each packet time slot, the queue length vector determines the power control policy over the channel states at the source, and hence determines the secrecy rate allocation among users. For a non-collaborative model, in which eavesdroppers do not exchange their outputs, the time-division scheme provides an achievable secrecy rate region, and the queue length based scheduling algorithm stabilizes all arrival rate vectors in this region.

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

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

U2 - 10.1109/ITA.2008.4601057

DO - 10.1109/ITA.2008.4601057

M3 - Conference contribution

AN - SCOPUS:52949087579

SN - 1424426707

SN - 9781424426706

SP - 249

EP - 255

BT - 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA

ER -