Dynamic Network Control for Confidential Multi-Hop Communications

被引:5
作者
Sarikaya, Yunus [1 ]
Koksal, C. Emre [2 ]
Ercetin, Ozgur [1 ]
机构
[1] Sabanci Univ, Fac Engn & Nat Sci, Dept Elect Engn, TR-34956 Istanbul, Turkey
[2] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
关键词
SECRECY CAPACITY; WIRELESS NETWORKS; CHANNEL;
D O I
10.1109/TNET.2015.2414945
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1181 / 1195
页数:15
相关论文
共 50 条
  • [41] Power and delay optimisation in multi-hop wireless networks
    Xia, Li
    Shihada, Basem
    INTERNATIONAL JOURNAL OF CONTROL, 2014, 87 (06) : 1252 - 1265
  • [42] Optimal Routing Strategy in Multi-Hop Relaying Networks
    Hu, Feng
    Li, Wei
    Zhang, Hua
    Latva-Aho, Matti
    You, Xiaohu
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2011, E94B (08) : 2378 - 2381
  • [43] Multi-Hop Space Shift Keying with Path Selection
    Yarkin, Ferhat
    Altunbas, Ibrahim
    Basar, Ertugrul
    2017 ADVANCES IN WIRELESS AND OPTICAL COMMUNICATIONS (RTUWO), 2017, : 40 - 44
  • [44] CFPSM: An energy efficient multi-hop WLAN protocol
    Khanna, Vimal K.
    Gupta, Hari M.
    IETE JOURNAL OF RESEARCH, 2006, 52 (2-3) : 147 - 152
  • [45] On the Capacity of Downlink Multi-Hop Heterogeneous Cellular Networks
    Wen, Juan
    Sheng, Min
    Wang, Xijun
    Li, Jiandong
    Sun, Hongguang
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (08) : 4092 - 4103
  • [46] Effects of Routing on the Capacity of Multi-Hop Wireless Networks
    Jones, William
    Wilson, R. Eddie
    MSWIM'18: PROCEEDINGS OF THE 21ST ACM INTERNATIONAL CONFERENCE ON MODELING, ANALYSIS AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS, 2018, : 155 - 162
  • [47] Optimal Spatial Reuse in Poisson Multi-hop Networks
    Stamatiou, Kostas
    Haenggi, Martin
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [48] Efficient Multi-flow Multicasting in Wireless Multi-hop Networks
    Tu, Wanqing
    2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2013, : 2232 - 2237
  • [49] Performance Evaluation of a Quality of Service Control Scheme in Multi-Hop WBAN Based on IEEE 802.15.6
    Takabayashi, Kento
    Tanaka, Hirokazu
    Sugimoto, Chika
    Sakakibara, Katsumi
    Kohno, Ryuji
    SENSORS, 2018, 18 (11)
  • [50] Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling
    Bui, Loc
    Eryilmaz, Atilla
    Srikant, R.
    Wu, Xinzhou
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (04) : 826 - 839