Cargando…
Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays
In this article, we first investigate secure communications for a two-hop interference channel relay system with imperfect channel estimation in the wireless Internet of Things (IoT), where K source-destination pairs communicate simultaneously when an eavesdropper exists. We jointly conceive source,...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6263723/ https://www.ncbi.nlm.nih.gov/pubmed/30428618 http://dx.doi.org/10.3390/s18113914 |
_version_ | 1783375350705684480 |
---|---|
author | Kong, Zhengmin Wang, Die Li, Yunjuan Wang, Chao |
author_facet | Kong, Zhengmin Wang, Die Li, Yunjuan Wang, Chao |
author_sort | Kong, Zhengmin |
collection | PubMed |
description | In this article, we first investigate secure communications for a two-hop interference channel relay system with imperfect channel estimation in the wireless Internet of Things (IoT), where K source-destination pairs communicate simultaneously when an eavesdropper exists. We jointly conceive source, relay and destination matrices upon minimizing total mean-squared error (MSE) of all legitimate destinations while keeping the MSE at eavesdropper above a given threshold. We illuminate that the design of the source, relay and destination matrices is subject to both transmit power constraints and secrecy requirements. More specifically, we propose an efficient robust iterative distributed algorithm to simplify the process of the joint design for optimal source, relay and destination matrices. Furthermore, the convergence of the iterative distributed algorithm is described. Additionally, the performances of our proposed algorithm, such as its secrecy rate and MSE, are characterized in the form of simulation results. The simulation results reveal that the proposed algorithm is superior to the traditional approach. As a benefit, secure communications can be ensured by using the proposed algorithm for the multiple input multiple output (MIMO) interference relay IoT network in the presence of an eavesdropper. |
format | Online Article Text |
id | pubmed-6263723 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-62637232018-12-12 Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays Kong, Zhengmin Wang, Die Li, Yunjuan Wang, Chao Sensors (Basel) Article In this article, we first investigate secure communications for a two-hop interference channel relay system with imperfect channel estimation in the wireless Internet of Things (IoT), where K source-destination pairs communicate simultaneously when an eavesdropper exists. We jointly conceive source, relay and destination matrices upon minimizing total mean-squared error (MSE) of all legitimate destinations while keeping the MSE at eavesdropper above a given threshold. We illuminate that the design of the source, relay and destination matrices is subject to both transmit power constraints and secrecy requirements. More specifically, we propose an efficient robust iterative distributed algorithm to simplify the process of the joint design for optimal source, relay and destination matrices. Furthermore, the convergence of the iterative distributed algorithm is described. Additionally, the performances of our proposed algorithm, such as its secrecy rate and MSE, are characterized in the form of simulation results. The simulation results reveal that the proposed algorithm is superior to the traditional approach. As a benefit, secure communications can be ensured by using the proposed algorithm for the multiple input multiple output (MIMO) interference relay IoT network in the presence of an eavesdropper. MDPI 2018-11-13 /pmc/articles/PMC6263723/ /pubmed/30428618 http://dx.doi.org/10.3390/s18113914 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Kong, Zhengmin Wang, Die Li, Yunjuan Wang, Chao Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays |
title | Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays |
title_full | Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays |
title_fullStr | Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays |
title_full_unstemmed | Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays |
title_short | Robust Iterative Distributed Minimum Total MSE Algorithm for Secure Communications in the Internet of Things Using Relays |
title_sort | robust iterative distributed minimum total mse algorithm for secure communications in the internet of things using relays |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6263723/ https://www.ncbi.nlm.nih.gov/pubmed/30428618 http://dx.doi.org/10.3390/s18113914 |
work_keys_str_mv | AT kongzhengmin robustiterativedistributedminimumtotalmsealgorithmforsecurecommunicationsintheinternetofthingsusingrelays AT wangdie robustiterativedistributedminimumtotalmsealgorithmforsecurecommunicationsintheinternetofthingsusingrelays AT liyunjuan robustiterativedistributedminimumtotalmsealgorithmforsecurecommunicationsintheinternetofthingsusingrelays AT wangchao robustiterativedistributedminimumtotalmsealgorithmforsecurecommunicationsintheinternetofthingsusingrelays |