首页> 外文期刊>Information Forensics and Security, IEEE Transactions on >Secure Communications Over Wireless Broadcast Networks: Stability and Utility Maximization
【24h】

Secure Communications Over Wireless Broadcast Networks: Stability and Utility Maximization

机译:无线广播网络上的安全通信:稳定性和实用性最大化

获取原文
获取原文并翻译 | 示例

摘要

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-n-n 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.
机译:研究了一种具有保密约束的无线广播网络模型,其中源节点将$ K $机密消息流广播到$ K $用户节点,每条消息旨在由一个用户准确解码,并对所有其他用户保密(因此,对于所有其他消息(他们自己的消息),它们被认为是窃听者)。如果没有立即提供服务,则源为每个消息流维护一个队列。从源到$ K $用户的信道被建模为衰落的广播信道,并且假定信道状态信息对于源和相应的接收者是已知的。考虑了两个窃听模型。对于其中窃听者交换其输出的协作窃听模型,获得了保密容量区域,在该区域内,通过使用时分方案和针对信道状态的源功率控制策略来实现每个速率向量。进一步推导了基于吞吐量最佳队列长度的速率调度算法,该算法稳定了保密容量区域中包含的所有到达速率向量。此外,通过速率控制,速率调度,功率控制和安全编码的联合设计,网络实用程序功能得以最大化。更精确地,源根据其消息队列来控制消息到达速率,速率调度基于队列长度向量选择传输速率,并且速率向量是通过功率控制和安全编码来实现的。这些组件共同解决网络实用程序最大化问题。对于非协作窃听者不交换输出的非协作窃听模型,基于时分方案推导了可达到的保密率区域,并获得了基于队列长度的码率调度算法和相应的-nn功率控制策略。稳定了该区域中所有到达率向量。还获得了网络效用最大化速率控制向量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号