Information exchange through a relay node is attracting attention for applying machine-to-machine communications. If the node demodulates the received signal in relay processing confidentially, the information leakage through the relay station is a problem. In wireless MIMO switching, the frequency spectrum usage efficiency can be improved owing to the completion of information exchange within a short time. This study proposes a novel wireless MIMO switching method for secure information exchange. An overloaded situation, in which the access nodes are one larger than the number of antennas in the relay node, makes the demodulation of the relay node difficult. The access schedule of nodes is required for maintaining the overload situation and the high information exchange efficiency. This study derives the equation model of the access schedule and constructs an access schedule with fewer time periods in the integer programming problem. From the computer simulation, we confirm that the secure capacity of the proposed MIMO switching is larger than that of the original one, and the constructed access schedule is as large as the ideal and minimum time period for information exchange completion.
Arata TAKAHASHI
Shinshu Univ.
Osamu TAKYU
Shinshu Univ.
Hiroshi FUJIWARA
Shinshu Univ.
Takeo FUJII
Univ. of Electro-Communications
Tomoaki OHTSUKI
Keio University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Arata TAKAHASHI, Osamu TAKYU, Hiroshi FUJIWARA, Takeo FUJII, Tomoaki OHTSUKI, "Overloaded Wireless MIMO Switching for Information Exchanging through Untrusted Relay in Secure Wireless Communication" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 10, pp. 1249-1259, October 2021, doi: 10.1587/transcom.2020DSP0005.
Abstract: Information exchange through a relay node is attracting attention for applying machine-to-machine communications. If the node demodulates the received signal in relay processing confidentially, the information leakage through the relay station is a problem. In wireless MIMO switching, the frequency spectrum usage efficiency can be improved owing to the completion of information exchange within a short time. This study proposes a novel wireless MIMO switching method for secure information exchange. An overloaded situation, in which the access nodes are one larger than the number of antennas in the relay node, makes the demodulation of the relay node difficult. The access schedule of nodes is required for maintaining the overload situation and the high information exchange efficiency. This study derives the equation model of the access schedule and constructs an access schedule with fewer time periods in the integer programming problem. From the computer simulation, we confirm that the secure capacity of the proposed MIMO switching is larger than that of the original one, and the constructed access schedule is as large as the ideal and minimum time period for information exchange completion.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020DSP0005/_p
Copy
@ARTICLE{e104-b_10_1249,
author={Arata TAKAHASHI, Osamu TAKYU, Hiroshi FUJIWARA, Takeo FUJII, Tomoaki OHTSUKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Overloaded Wireless MIMO Switching for Information Exchanging through Untrusted Relay in Secure Wireless Communication},
year={2021},
volume={E104-B},
number={10},
pages={1249-1259},
abstract={Information exchange through a relay node is attracting attention for applying machine-to-machine communications. If the node demodulates the received signal in relay processing confidentially, the information leakage through the relay station is a problem. In wireless MIMO switching, the frequency spectrum usage efficiency can be improved owing to the completion of information exchange within a short time. This study proposes a novel wireless MIMO switching method for secure information exchange. An overloaded situation, in which the access nodes are one larger than the number of antennas in the relay node, makes the demodulation of the relay node difficult. The access schedule of nodes is required for maintaining the overload situation and the high information exchange efficiency. This study derives the equation model of the access schedule and constructs an access schedule with fewer time periods in the integer programming problem. From the computer simulation, we confirm that the secure capacity of the proposed MIMO switching is larger than that of the original one, and the constructed access schedule is as large as the ideal and minimum time period for information exchange completion.},
keywords={},
doi={10.1587/transcom.2020DSP0005},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - Overloaded Wireless MIMO Switching for Information Exchanging through Untrusted Relay in Secure Wireless Communication
T2 - IEICE TRANSACTIONS on Communications
SP - 1249
EP - 1259
AU - Arata TAKAHASHI
AU - Osamu TAKYU
AU - Hiroshi FUJIWARA
AU - Takeo FUJII
AU - Tomoaki OHTSUKI
PY - 2021
DO - 10.1587/transcom.2020DSP0005
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2021
AB - Information exchange through a relay node is attracting attention for applying machine-to-machine communications. If the node demodulates the received signal in relay processing confidentially, the information leakage through the relay station is a problem. In wireless MIMO switching, the frequency spectrum usage efficiency can be improved owing to the completion of information exchange within a short time. This study proposes a novel wireless MIMO switching method for secure information exchange. An overloaded situation, in which the access nodes are one larger than the number of antennas in the relay node, makes the demodulation of the relay node difficult. The access schedule of nodes is required for maintaining the overload situation and the high information exchange efficiency. This study derives the equation model of the access schedule and constructs an access schedule with fewer time periods in the integer programming problem. From the computer simulation, we confirm that the secure capacity of the proposed MIMO switching is larger than that of the original one, and the constructed access schedule is as large as the ideal and minimum time period for information exchange completion.
ER -