TY - JOUR
T1 - Secure communications over wireless broadcast networks
T2 - Stability and utility maximization
AU - Liang, Yingbin
AU - Poor, H. Vincent
AU - Ying, Lei
N1 - Funding Information:
Manuscript received September 27, 2010; revised May 18, 2011; accepted May 19, 2011. Date of publication May 31, 2011; date of current version August 17, 2011. The work of Y. Liang was supported by the National Science Foundation under Grant CCF-10-26566. The work of H. V. Poor was supported by the Air Force Office of Scientific Research under Grant FA9550-08-1-0480 and by the National Science Foundation under Grant CNS-09-05398. The work of L. Ying was supported by the National Science Foundation under Grant CNS-08-31756 and Grant CNS-09-53165, and by the DTRA under Grant HDTRA1-08-1-0016 and Grant HDTRA1-09-1-0055. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Wade Trappe.
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
SN - 1556-6013
VL - 6
SP - 682
EP - 692
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
IS - 3 PART 1
M1 - 5782980
ER -