scholarly journals Performance Analysis of Wireless Information Surveillance in Machine-Type Communication at Finite Blocklength Regime

Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 3031
Author(s):  
Dong ◽  
Li ◽  
Yan

The Internet of Things (IoT) will feature pervasive sensing and control capabilities via the massive deployment of machine-type communication devices in order to greatly improve daily life. However, machine-type communications can be illegally used (e.g., by criminals or terrorists) which is difficult to monitor, and thus presents new security challenges. The information exchanged in machine-type communications is usually transmitted in short packets. Thus, this paper investigates a legitimate surveillance system via proactive eavesdropping at finite blocklength regime. Under the finite blocklength regime, we analyze the channel coding rate of the eavesdropping link and the suspicious link. We find that the legitimate monitor can still eavesdrop the information sent by the suspicious transmitter as the blocklength decreases, even when the eavesdropping is failed under the Shannon capacity regime. Moreover, we define a metric called the effective eavesdropping rate and study the monotonicity. From the analysis of monotonicity, the existence of a maximum effective eavesdropping rate for a moderate or even high signal-to-noise (SNR) is verified. Finally, numerical results are provided and discussed. In the simulation, we also find that the maximum effective eavesdropping rate slowly increases with the blocklength.

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6553
Author(s):  
Edgar A. Esquivel-Mendiola ◽  
Hiram Galeana-Zapién ◽  
David H. Covarrubias ◽  
Edwin Aldana-Bobadilla

A progressive paradigm shift from centralized to distributed network architectures has been consolidated since the 4G communication standard, calling for novel decision-making mechanisms with distributed control to operate at the network edge. This situation implies that each base station (BS) must manage resources independently to meet the quality of service (QoS) of existing human-type communication devices (HTC), as well as the emerging machine type communication (MTC) devices from the internet of things (IoT). In this paper, we address the BS assignment problem, whose aim is to determine the most appropriate serving BS to each mobile device. This problem is formulated as an optimization problem for maximizing the system throughput and imposing constraints on the air interface and backhaul resources. The assignment problem is challenging to solve, so we present a simple yet valid reformulation of the original problem while using dual decomposition theory. Subsequently, we propose a distributed price-based BS assignment algorithm that performs at each BS the assignment process, where a novel pricing update scheme is presented. The simulation results show that our proposed solution outperforms traditional maximum signal to interference plus noise ratio (Max-SINR) and minimum path-loss (Min-PL) approaches in terms of system throughput.


IEEE Access ◽  
2015 ◽  
Vol 3 ◽  
pp. 864-874 ◽  
Author(s):  
Yinan Qi ◽  
Atta Ul Quddus ◽  
Muhammad Ali Imran ◽  
Rahim Tafazolli

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Minjoong Rim ◽  
Seungyeob Chae

One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance.


Electronics ◽  
2020 ◽  
Vol 9 (8) ◽  
pp. 1286
Author(s):  
Mengjiang Sun ◽  
Peng Chen

In massive machine-type communications (mMTC) scenarios, grant-free non-orthogonal multiple access becomes crucial due to the small transmission latency, limited signaling overhead and the ability to support massive connectivity. In a multi-user detection (MUD) problem, the base station (BS) is unaware of the active users and needs to detect active devices. With sporadic devices transmitting signals at any moment, the MUD problem can be formulated as a multiple measurement vector (MMV) sparse recovery problem. Through the Khatri–Rao product, we prove that the MMV problem is transformed into a single measurement vector (SMV) problem. Based on the basis pursuit de-noising approximate message passing (BPDN-AMP) algorithm, a novel learning AMP network (LAMPnet) algorithm is proposed, which is designed to reduce the false alarm probability when the required detection probability is high. Simulation results show that when the required detection probablity is high, the AMP algorithm based on LAMPnet noticeably outperforms the traditional algorithms with acceptable computational complexity.


As we know, world is moving into the era of modern digital technology and looking forward tomassive machine type communications (mMTC), whichis an integral part of Internet of Things (IoT). The current technologysupporting mMTC market are not standardized; therefore, there are many short comings from physical layer which includes complexity in deployment, poor reliability, lesser flexibility, security threats and high maintenance cost. To address all these challenges in 5G machine type communication (MTC), the 3rdGeneration Partnership Project (3GPP) in release 13has standardizedNarrowband Internet of Things (NB-IoT) as a better choice in deployment of 5G MTC. NB-IoT has been recommended by ITU as a 5G standard and this recognition of NB-IoT as a core technology in massive machine type communication will impact the telecommunication industry. NB-IoT mainly works on low power wide area networks (LPWAN), which isconsidered as a major technology driver in 5G wireless technologies. Initially,we have compared a spectrum power of NB-IoT with W-Fi ac considering their own bandwidthand specificationsas per 3GPP and IEEE 802.11,respectively.As per analysis, we found many advantages of deploying NB-IoT in 5thgeneration wireless technology including ubiquitous coverage, low power consumption, less transmission power and better interference rejection. Considering thisfact of NB-IoT, we proposedand design a NB-IoT uplink systemusing NPUSCH, UL-SCH and UL-DMRS as per 3GPP 5G specificationsand performance analysis has been carried out


2018 ◽  
Vol 14 (5) ◽  
pp. 155014771877821 ◽  
Author(s):  
Shujun Han ◽  
Xiaodong Xu ◽  
Litong Zhao ◽  
Xiaofeng Tao

Non-orthogonal multiple access is an essential promising solution to support large-scale connectivity required by massive machine-type communication scenario defined in the fifth generation (5G) mobile communication system. In this article, we study the problem of energy minimization in non-orthogonal multiple access–based massive machine-type communication network. Focusing on the massive machine-type communication scenario and assisted by grouping method, we propose an uplink cooperative non-orthogonal multiple access scheme with two phases, transmission phase and cooperation phase, for one uplink cooperative transmission period. Based on uplink cooperative non-orthogonal multiple access, the machine-type communication device with better channel condition and more residual energy will be selected as a group head, which acts as a relay assisting other machine-type communication devices to communicate. In the transmission phase, machine-type communication devices transmit data to the group head. Then, the group head transmits the received data with its own data to base station in the cooperation phase. Because the massive machine-type communication devices are low-cost dominant with limited battery, based on uplink cooperative non-orthogonal multiple access, we propose a joint time and power allocation algorithm to minimize the system energy consumption. Furthermore, the proposed joint time and power allocation algorithm includes dynamic group head selection and fractional transmit time allocation algorithms. Simulation results show that the proposed solution for uplink cooperative non-orthogonal multiple access–based massive machine-type communication network outperforms other schemes.


Author(s):  
S Ullah ◽  
Raja Zahilah ◽  
Marina Md Arshad ◽  
Abdul Hanan Abdullah ◽  
Rashidah Kadir

Author(s):  
Nikolay Matveev ◽  
Andrey Turlikov

Introduction: Intensive research is currently underway in the field of data transmission systems for the Internet of Things in relation to various scenarios of Massive Machine Type Communication. The presence of a large number of devices in such systems necessitates the use the methods of random multiple access to a common communication channel. It is proposed in some works to increase the channel utilization efficiency by the use of error correction coding methods for conflict resolution (Coded Random Access). The vast variety of options for using such communication systems has made it impossible to compare algorithms implementing this approach under the same conditions. This is a problem that restrains the development of both the theory and practice of using error correction code methods for conflict resolution. Purpose: Developing a unified approach to the description of random multiple access algorithms; performing, on the base on this approach, a review and comparative analysis of algorithms in which error correction code methods are used for conflict resolution. Results: A model of a random multiple access system is formulated in the form of a set of assumptions that reflect both the features of various scenarios of Massive Machine Type Communication and the main features of random multiple access algorithms, including Coded Random Access approaches. The system models are classified by the following features: 1) a finite or infinite number of subscribers; 2) stable, unstable or metastable systems; 3) systems with retransmissions or without them; 4) systems with losses or without them. For a lossy system, the main characteristics are Throughput (the proportion of successfully delivered messages) and Packet Loss Rate (probability of a message loss). For a lossless system, the basic characteristics are the algorithm speed and the average delay. A systematic review and comparative analysis of Coded Random Access algorithms have been carried out. The result of the comparative analysis is presented in a visual tabular form. Practical relevance: The proposed model of a random multiple access system can be used as a methodological basis for research and development of random multiple access algorithms for both existing and new scenarios of Massive Machine Type Communication. The systematic results of the review allow us to identify the promising areas of research in the field of data transmission systems for the Internet of Things.


Sign in / Sign up

Export Citation Format

Share Document