31 August 2018 in Proceedings of the IEEE
Tactile internet is defined as a network that offers a response to a physical process or an object in perceived real time. The development of new radio (NR) and long-term evolution (LTE) technologies with tailored high-reliability and low-latency design is expected to reliably transmit data in milliseconds, leading to the promising realization of tactile internet with applications in areas such as factory automation, education, gaming, and healthcare. In this paper, from a physical layer and medium-access control (PHY/MAC) perspective, we discuss the systems design of ultrareliable and low-latency communications (URLLC) in NR and LTE technologies, both belonging to the fifth-generation (5G) wireless technologies. Motivated by the safety and privacy requirements of tactile internet, we also outline the 5G security landscape, major categories of attackers, and potential countermeasures. Finally, we provide a case study of factory automation as an example of the proposed 5G-based tactile internet.
19 March 2020 in IEEE Internet of Things Journal
This paper presents a novel way to reduce blockchain nodes memory requirements using error correcting codes. In particular, LDPC codes are taken as examples to explicitly demonstrate the scheme. The proposed coding scheme encodes data across of multiple blocks, respectively block headers, in the blockchain. This leads to a significant reduction in required memory at each node. We then apply the proposed coding technique to blockchains organized in two different ways. Our first scheme has the same protocol for mining, broadcasting and verification of blocks, as Bitcoin-type blockchains. Our scheme is different in that full nodes do not have to store all blocks. Instead they will need to store only one block of a group of t blocks. In the second scheme, we consider a new block verification protocol and an account based model, under the assumption that a transmission between any two nodes can be established, as well as the broadcast transmission. Our block verification protocol uses Byzantine fault tolerance algorithm and requires sending a newly mined block to only a small number of verification nodes, instead of broadcasting it to the entire network, which leads to reduction of the network load.
20 January 2020 in IEEE Transactions on Information Theory
We investigate the state-dependent Gaussian wiretap channel with noncausal channel state information at the transmitter (GWTC-N-CSIT), and explore whether three strategies (i.e., taking action on the state, legitimate receiver’s channel output feedback, and combining the former two strategies together) help to enhance the secrecy capacity of the GWTC-N-CSIT. To be specific, we first determine the secrecy capacity of the GWTC-N-CSIT with noiseless feedback. Next, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with action-dependent state. Finally, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with both action-dependent state and noiseless feedback, and show that these bounds meet for a special case. Numerical results of this paper indicate that all three strategies enhance the secrecy capacity of the GWTC-N-CSIT. The study of this paper offers new options for enhancing the secrecy rates of the state-dependent wiretap channel models.
13 March 2019 in IEEE Transactions on Information Theory
5 February 2018 in IEEE Transactions on Information Theory
In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite-dimensional (FD) Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the interpretation of feedback communication over stationary FD Gaussian channels as feedback control systems. We show that the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity. This extended interpretation provides an approach to construct deterministic feedback coding schemes with double exponential decaying error probability. We next propose asymptotic capacity-achieving upper bounds, which can be numerically evaluated by solving FD convex optimizations. From the filters that achieve the upper bounds, we apply the Youla-based interpretation to construct feasible filters, i.e., feedback codes, leading to a sequence of lower bounds. We prove that the sequence of lower bounds is asymptotically capacity achieving.
7 April 2022 in IEEE Transactions on Information Forensics and Security
It has been shown that the SK scheme, which was proposed by Schalkwijk and Kailath, is a self-secure capacity-achieving (SSCA) feedback scheme for the Gaussian wiretap channel, i.e., the SK scheme not only achieves the feedback capacity of the Gaussian channel, but also is secure by itself and achieves the feedback secrecy capacity of the Gaussian wiretap channel. For the multi-user wiretap channels, very recently, it has been shown that Ozarow’s capacity-achieving feedback scheme for the two-user Gaussian multiple-access channel (GMAC) is the SSCA feedback scheme for the two-user Gaussian multiple-access wiretap channel (GMAC-WT). In this paper, first, we propose a SSCA feedback scheme for the two-user GMAC-WT with degraded message sets (GMAC-WT-DMS). Next, we extend the above scheme to the two-user GMAC-WT-DMS with noncausal channel state information at the transmitters (NCSIT), and show that the extended scheme is also a SSCA feedback scheme. Finally, we derive outer bounds on the secrecy capacity regions of the two-user GMAC-WT-DMS with or without NCSIT, and numerical results show the rate gains by the feedback.