Constarium
← Search

Data · dataset · 2026

260059 EP丨Reproduction Code for "Secure and Covert MIMO Short-Packet Communications with Location-Uncertain Malicious Nodes"

Listed in ScienceDB

Description

Solemn statement: If this open source content is used in papers, books, academic reports, and other works, please cite the following references (the latest citation format is available in the original link): Tian Bo, Yang Weiwei, Yang Xiaoqin, Bai Mengmeng MIMO short packet secure covert communication for malicious nodes with uncertain location [J]. Journal of Electronics and Information Technology, pre publication doi: 10.11999/JEIT260059  TIAN Bo, YANG Weiwei, YANG Xiaoqin, BAI Mengmeng.

Secure and Covert MIMO Short Packet Communications with Location-Uncertain Malicious Nodes[J]. Journal of Electronics & Information Technology, in press. doi: 10.11999/JEIT260059 Authors: Tian Bo, Yang Weiwei, Yang Xiaoqin *, Bai Mengmeng Unit: School of Communication Engineering, Army Engineering University DOI:10.11999/JEIT260059 Original text: jeit.ac.cn/cn/article/doi/10.11999/JEIT260059 Corresponding author: Yang Xiaoqin, 15261856573@139.com Open source date: May 9th, 2026 Fund projects: National Natural Science Foundation of China (62427802, 62301594, 62171461, and 62071486) Open source content MIMO Short Packet Secure Concealed Communication for Malicious Nodes with Uncertain Locations - Reproduction Code 

Read the rest (4 more)

Abstract

This paper investigates the secure covert communication of multiple input multiple output (MIMO) short packets under quasi-static Rayleigh fading for malicious nodes with uncertain locations. Based on random geometry, the monitoring node Willie and eavesdropping node Eve are modeled as Poisson point processes; Alice uses Singular Value Decomposition (SVD) precoding, while Bob uses Maximum Ratio Combining (MRC) reception.

Under the condition of finite block length, the theoretical lower bound of the average minimum detection error probability is derived based on the Chernoff bound, and an approximate analytical expression for the average secrecy rate is derived. Further propose the Average Effective Security Concealment Rate (AESCR) to unify the characterization of system concealment, confidentiality, and reliability. Construct an AESCR maximization problem under average concealment constraints and propose a joint optimization method for packet length and power.

Simulation shows that AESCR increases with the increase of the number of legitimate transmitting and receiving antennas, but decreases with the increase of malicious node density and the number of malicious node antennas, and the system has an optimal packet length.   

Links

Where it is published

Catalogue records · 1

Topics

Inferred from text
Simulation 75% · Text 75%
Provenance · 1 source records, 12 field assertions
SourceKeyLast seenRaw
ScienceDB10.57760/sciencedb.3648310 d agoJSON v1
FieldAssertionExtractorEvidence
access_levelsource · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:earth-environmentalmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:engineeringmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:humanitiesmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:life-sciencesmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:social-sciencemapping · scidb cnconnector:scidb_cn@1.0.0
concepts[method].local:method:simulationenrichment · scidb cnkeyword-concept-rules@1.0.0title+description (75%)
concepts[modality].local:modality:textenrichment · scidb cnkeyword-concept-rules@1.0.0title+description (75%)
descriptionsource · scidb cnconnector:scidb_cn@1.0.0/metadata/dc/description
licensesource · scidb cnconnector:scidb_cn@1.0.0/metadata/dc/rights
publication_datesource · scidb cnconnector:scidb_cn@1.0.0
titlesource · scidb cnconnector:scidb_cn@1.0.0/metadata/dc/title