Topology Construction of Near-Optimal Covert Communications Networks

被引:2
|
作者
Nix, Timothy [1 ]
Bettati, Riccardo [1 ]
机构
[1] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA
关键词
privacy; anonymity; networks; covert; topology; resiliency; peer-to-peer;
D O I
10.1109/I-SPAN.2012.26
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A covert communications network is an overlay peer-to-peer network used to support communication within a group in which the survival of the group depends on both anonymity of communication and concealment of network membership to other members of the group and to external eavesdroppers. These requirements are much more stringent than for typical privacy and anonymity systems. Whereas anonymity systems often reply on a series of intermediate network participants to forward messages in a way that de-links the sender from the receiver, membership concealment relies on the topology of the network. In this paper, we consider the topologies of resilient covert communications networks that minimize the impact on the network in the event of a subverted node and maximize the connectivity of the survivor network with the removal of the subverted node and its closed neighborhood. We briefly describe necessary considerations for the generation of covert communications networks, and then develop general methods for constructing arbitrary-sized near-optimal network topologies.
引用
收藏
页码:135 / 142
页数:8
相关论文
共 50 条
  • [1] Near-optimal construction of wavelet networks for nonlinear system modeling
    Yu, Y
    Tan, SH
    Vandewalle, J
    Deprettere, E
    ISCAS 96: 1996 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - CIRCUITS AND SYSTEMS CONNECTING THE WORLD, VOL 3, 1996, : 48 - 51
  • [2] Near-Optimal BFS-Tree Construction in Radio Networks
    Ghaffari, Mohsen
    Haeupler, Bernhard
    IEEE COMMUNICATIONS LETTERS, 2016, 20 (06) : 1172 - 1174
  • [3] CONSTRUCTION OF NEAR-OPTIMAL VERTEX CLIQUE COVERING FOR REAL-WORLD NETWORKS
    Chalupa, David
    COMPUTING AND INFORMATICS, 2015, 34 (06) : 1397 - 1417
  • [4] Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks
    Kanj, Iyad A.
    Perkovic, Ljubomir
    Xia, Ge
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2009, 8 (04) : 460 - 474
  • [5] A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks
    Hsiao, Hung-Chang
    Liao, Hao
    Yeh, Po-Shen
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2010, 21 (07) : 983 - 997
  • [6] Evolutionary programming of near-optimal neural networks
    Lock, D
    Giraud-Carrier, C
    ARTIFICIAL NEURAL NETS AND GENETIC ALGORITHMS, 1999, : 302 - 306
  • [7] Near-Optimal Multicast Tree Construction in Leaf-Spine Data Center Networks
    Luo, Shouxi
    Xing, Huanlai
    Li, Ke
    IEEE SYSTEMS JOURNAL, 2020, 14 (02): : 2581 - 2584
  • [8] Near-optimal online routing in opportunistic networks
    Arastouie, Narges
    Sabaei, Masoud
    Bakhshi, Bahador
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2019, 32 (03)
  • [9] Near-optimal control policy for loss networks
    Ku, CY
    Yen, DC
    Chang, IC
    Huang, SM
    Jordan, S
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (04): : 406 - 416
  • [10] A Near-Optimal Broadcast Technique for Vehicular Networks
    Ho, Ai Hua
    Ho, Yao Hua
    Hua, Kien A.
    Villafane, Roy
    WTS: 2009 WIRELESS TELECOMMUNICATIONS SYMPOSIUM, 2009, : 413 - +