arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.1002cs.ITcs.SYeess.SYmath.IT
收藏

机密多跳通信的动态网络控制

Dynamic Network Control for Confidential Multi-hop Communications

Sabanci University(萨班哲大学);The Ohio State University(俄亥俄州立大学)

Yunus Sarikaya, C. Emre Koksal, Ozgur Ercetin

AI总结:

针对多跳网络中机密消息传输的资源分配与控制问题,提出一种结合流控制、路由和端到端保密编码的动态控制算法,利用多径分集和时间分集实现保密性,并通过数值分析验证其渐近最优性。

摘要:

我们考虑多跳网络的资源分配和控制问题,其中多个源-目的对通信机密消息,这些消息需要对中间节点保密。我们将问题表述为网络效用最大化,并将机密性作为额外的服务质量约束纳入其中。我们开发了一种简单且可证明最优的动态控制算法,该算法结合了流控制、路由和端到端保密编码。为了实现机密性,我们的方案利用了由于信道变化引起的多径分集和时间分集。我们的端到端动态编码方案将机密消息编码到多个数据包中,在最终目的地组合以进行恢复。我们首先针对保密编码所跨的块数渐近大的情况开发了一种最优动态策略。接下来,我们考虑跨有限数量的数据包进行编码,这消除了实现完美保密性的可能性。对于这种情况,我们开发了一种动态策略,根据瞬时信道状态信息、队列状态和保密中断要求为每个消息选择编码速率。通过数值分析,我们观察到所提出的方案随着块大小的增加渐近地接近最优速率。最后,我们讨论了实际实施问题(如不频繁的队列更新和分散调度)的后果。我们通过各种网络条件下的数值研究证明了我们策略的有效性。

英文摘要:

We consider the problem of resource allocation and control of multihop networks in which multiple source-destination pairs communicate confidential messages, to be kept confidential from the intermediate nodes. We pose the problem as that of network utility maximization, into which confidentiality is incorporated as an additional quality of service constraint. We develop a simple, and yet provably optimal dynamic control algorithm that combines flow control, routing and end-to-end secrecy-encoding. In order to achieve confidentiality, our scheme exploits multipath diversity and temporal diversity due to channel variability. Our end-to-end dynamic encoding scheme encodes confidential messages across multiple packets, to be combined at the ultimate destination for recovery. We first develop an optimal dynamic policy for the case in which the number of blocks across which secrecy encoding is performed is asymptotically large. Next, we consider encoding across a finite number of packets, which eliminates the possibility of achieving perfect secrecy. For this case, we develop a dynamic policy to choose the encoding rates for each message, based on the instantaneous channel state information, queue states and secrecy outage requirements. By numerical analysis, we observe that the proposed scheme approaches the optimal rates asymptotically with increasing block size. Finally, we address the consequences of practical implementation issues such as infrequent queue updates and de-centralized scheduling. We demonstrate the efficacy of our policies by numerical studies under various network conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑