TY - JOUR
T1 - Multi-Hop Routing in Covert Wireless Networks
AU - Sheikholeslami, Azadeh
AU - Ghaderi, Majid
AU - Towsley, Don
AU - Bash, Boulat A.
AU - Guha, Saikat
AU - Goeckel, Dennis
N1 - Funding Information:
Manuscript received August 23, 2017; revised December 28, 2017; accepted February 18, 2018. Date of publication March 13, 2018; date of current version June 8, 2018. This work was supported in part by the National Science Foundation under Grant ECCS-1309573 and Grant CNS-1564067, and in part by DARPA under Contract HR0011-16-C-0111. The associate editor coordinating the review of this paper and approving it for publication was L. Lai. (Corresponding author: Azadeh Sheikholeslami.) A. Sheikholeslami and D. Goeckel are with the Electrical and Computer Engineering Department, University of Massachusetts at Amherst, Amherst, MA 01003 USA (e-mail: azadehsh@umass.edu).
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2018/6
Y1 - 2018/6
N2 - In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared with the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve the performance. Hence, in this paper, multi-hop covert communication over a moderate size network and in the presence of multiple collaborating Willies is considered. The relays can transmit covertly using either a single key for all relays or different independent keys at the relays. For each case, we develop efficient algorithms to find optimal paths with maximum throughput and minimum end-to-end delay between Alice and Bob. As expected, employing multiple hops significantly improves the ability to communicate covertly versus the case of a single-hop transmission. Furthermore, at the expense of more shared key bits, analytical results and numerical simulations demonstrate that the multi-hop covert communication with different independent keys at the relays has better performance than the multi-hop covert communication with a single key.
AB - In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared with the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve the performance. Hence, in this paper, multi-hop covert communication over a moderate size network and in the presence of multiple collaborating Willies is considered. The relays can transmit covertly using either a single key for all relays or different independent keys at the relays. For each case, we develop efficient algorithms to find optimal paths with maximum throughput and minimum end-to-end delay between Alice and Bob. As expected, employing multiple hops significantly improves the ability to communicate covertly versus the case of a single-hop transmission. Furthermore, at the expense of more shared key bits, analytical results and numerical simulations demonstrate that the multi-hop covert communication with different independent keys at the relays has better performance than the multi-hop covert communication with a single key.
KW - Covert communication
KW - physical layer security
KW - routing
KW - wireless networks
UR - http://www.scopus.com/inward/record.url?scp=85043783157&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043783157&partnerID=8YFLogxK
U2 - 10.1109/TWC.2018.2812881
DO - 10.1109/TWC.2018.2812881
M3 - Article
AN - SCOPUS:85043783157
VL - 17
SP - 3656
EP - 3669
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
SN - 1536-1276
IS - 6
ER -