Search

We propose a novel interference alignment (IA) technique with receive antenna partitioning (RAP) for simultaneous wireless information and power transfer (SWIPT)-enabled downlink fog radio access networks (F-RANs). The basic idea of the proposed scheme is to apply a generalized downlink IA for each access point (AP) and to divide receive antennas at each user into two groups for information decoding (ID) and energy harvesting (EH), respectively. With the proposed scheme, an optimal receive antenna configuration at each user is obtained to maximize the weighted sum of achievable rate and the sum of harvested energy of the network. Also we develop an antenna configuration selection algorithm to obtain near-optimal performance with low computational complexity. Through extensive computer simulations, it is shown that the proposed scheme significantly improves a rate-energy region compared with existing techniques.

In this paper, we mathematically analyze bit-error rate (BER) and diversity order of physical-layer network coding (PNC) scheme in the two-way relay channel (TWRC) under the assumption of multiple antennas at relay node. We assume the quadrature phase shift keying (QPSK) modulation for simple data transmission in IoT applications, and max–min transmit antenna selection (TAS) scheme in the broadcast (BC) phase for achieving full diversity gain. In particular, we obtain the upper bound of BER at the multiple access (MA) phase, while deriving the exact BER performance at the BC phase. To the best our knowledge, the mathematical analysis in this paper is the first analytical results in the literature. Through computer simulations, the analytical results are validated.

Grant-free multiple access (GFMA) is an emerging technology to accommodate a massive number of devices for 6G-enabled Internet of Things (IoT) networks. The main advantages of GFMA are to efficiently reduce control signaling overhead for resource scheduling while improving resource efficiency. In this article, we propose a novel resource-hopping-based GFMA (RH-GFMA) framework with resource hopping schemes for providing massive connectivity in 6G cellular IoT networks, where each IoT device is allowed to access physical radio resources by using a preassigned resource hopping pattern without not only resource request but also grant procedure, which is the so-called “one-shot” noninteractive multiple access. We exploit three types of resource hopping schemes in the proposed RH-GFMA framework: 1) random hopping; 2) resource group hopping; and 3) Latin-square group hopping. We mathematically analyze the RH-GFMA system performance in terms of the hopping pattern collision probability, maximum allowable packet delay, and interference-over-thermal. Finally, we derive an accommodation capacity of the proposed RH-GFMA framework, which is defined as the expected number of IoT devices accommodated in a cell under a maximum allowable packet-delay requirement and an interference-over-thermal constraint. With the proposed GFMA, massive IoT devices are expected to be efficiently accommodated in 6G wireless networks, while satisfying strict latency and reliability requirements.

Unslotted ALOHA protocol has been adopted as a channel access mechanism in commercial low-power wide-area networks (LPWANs), such as Sigfox and long-range (LoRa) alliance. This work examines the throughput and random access (RA) delay distribution of unslotted ALOHA systems by considering exponential random backoff (ERB) or uniform random backoff (URB) algorithm. We further characterize the operating region of the systems as unsaturated stable, bistable, and saturated regions in terms of the new packet arrival and retransmission rates. To run the system stably with the maximum throughput, we propose a Bayesian online backoff algorithm that estimates the number of backlogged devices. Its performance is compared with other algorithms, such as particle filter (PF)-based algorithm, binary exponential backoff (BEB) algorithm, and the algorithm of exploiting exact backlog size information. Through extensive simulations, it is demonstrated that the performance of the proposed algorithm is very close to the upper bound and robust to time-varying traffic condition.

In this paper, we propose a novel interference alignment (IA) technique for an in-band full-duplex (IBFD) multiple-input multiple-output (MIMO) cellular network where a base station (BS) and user equipment (UE) are equipped with multiple antennas, and the local channel state information (CSI) is available at all nodes. Considering a practical IBFD MIMO cellular network, it is assumed that only the BS operates with full-duplex (FD) communication while UE operate in half-duplex (HD) mode. These IBFD networks introduce a new type of interference called cross-link interference (CLI), in which uplink UE affects downlink UE. The proposed IA technique consists of two symmetric IA schemes according to the number of antennas in the uplink and downlink UE, and both schemes effectively mitigate CLI in the IBFD MIMO network. It is worth noting that both IA schemes are adaptively applicable according to the network’s quality-of-service (QoS) requirements, such as uplink and downlink traffic demands. Furthermore, we theoretically characterize and prove the achievable sum-degrees-of-freedom (DoF) of the proposed IA technique. Simulation results show that the proposed IA technique significantly improves the sum rate performance compared to conventional HD communications (multi-user MIMO) while achieving the same achievable DoF as the interference-free IBFD MIMO network.

In this article, we investigate a secure uplink multiple-input multiple-output communication system, in which the multiple users transmit information to a legitimate access point (AP) when a passive eavesdropper exists. A secure multiple access method is proposed for single-antenna users by employing space–time line codes (STLCs), which enables noncoherent detection at the legitimate AP without channel state information (CSI) and achieves full spatial diversity. While extending the secure STLC scheme from the single-antenna to two-antenna users by combining the STLC with artificial noise (AN) injection, we design a low-complexity AN signals with the optimal power control scheme. The proposed AN is ensured to be eliminated after STLC decoding at the legitimate AP, while sustained in eavesdropper's received signals as interference. Theoretical sum secrecy rates are derived by considering time-varying fading channels with the uncertainty of CSI at the users, and the numerical results verify that the proposed STLC schemes outperform the existing secure transmission schemes in terms of the sum secrecy rate.

A massive number of Internet-of-Things (IoT) and machine-to-machine (M2M) communication devices generate various types of data traffic in cellular IoT networks: periodic or nonperiodic, bursty or sporadic, etc. In particular, bursty and nonperiodic traffic may cause an unexpected network congestion and temporary lack of radio resources. In order to effectively accommodate such bursty and nonperiodic traffic, we propose a novel recursive access class barring (R-ACB) technique to optimally utilize the available resources associated with the random access procedure (RAP) that consists of multiple steps in cellular IoT networks, while existing ACB schemes only considered the resource of the first step of RAP, i.e., the number of available preambles. The proposed R-ACB technique consists of two main parts: 1) online estimation of the number of active IoT/M2M devices who have data to transmit to an eNodeB and 2) adjustment of the ACB factor that indicates the probability that an active device sends a preamble to eNodeB. It is notable that the estimation and the adjustment recursively affect each other when R-ACB operates. In addition, we also propose mathematical models to analyze the performance of R-ACB in terms of total service time, average access delay, resource efficiency, and energy efficiency (EE). Through extensive computer simulations, we show that the proposed R-ACB technique outperforms the conventional ACB schemes.

Uplink power domain non-orthogonal multiple access (NOMA) random access (RA) system allows users to transmit their packet with one of target receive power (TRP) levels at the base station (BS). Then the BS can separate the users in simultaneous transmission with successive interference cancellation (SIC), when the users choose different TRP levels. It enjoys a higher throughput through supporting simultaneous transmissions that occur frequently in RA system. This letter examines how to incorporate uplink NOMA RA system with the existing Long-Term Evolution (LTE) RA procedure with minimal modifications. Furthermore, to optimize the proposed RA procedure, we propose an online control algorithm for backoff interval and analyze its performance particularly with focus on the average RA delay. The results show that the proposed RA procedure achieves $0.5896{L}$ of throughput for a total of ${L}$ RA preambles and guarantees the average RA delay by 1/( $0.5896{L} -\lambda $ ) for Poisson traffic with mean $\lambda $ .

We investigate the secrecy outage probability (SOP) of a downlink wiretap network consisting of a single legitimate base station (BS), multiple legitimate mobile stations (MSs), and multiple potential eavesdroppers (EVEs), where each EVE randomly attempts to overhear the data transmission with a certain probability. In particular, we consider an opportunistic feedback ( $\mathsf {OF}$ ) strategy in which each legitimate MS feeds their channel gain back to the BS for data reception only when its gain is greater than a certain threshold. We analyze a closed-form expression of the SOP under this strategy. As our main result, we demonstrate that the SOP of the $\mathsf {OF}$ strategy approaches that of the full feedback strategy as the number of legitimate MSs becomes large. It is worth noting that, for the first time, we mathematically characterize the SOP in this practical wiretap network setting having multiple potential EVEs.

This letter proposes a novel distributed opportunistic scheduling with interference mitigation antenna selection (DOS-IMAS) to achieve the optimal multi-user diversity in ultra-dense device-to-device (D2D) networks. The proposed DOS-IMAS opportunistically and sequentially selects ${K}$ D2D pairs in a fully distributed manner based on interference and desired signal power thresholds. We prove that the proposed DOS-IMAS achieves the optimal multi-user diversity ${K}$ log SNR log ( ${n}$ ) under $n=\omega \left({(MN)^{\frac {1}{\kappa -1}}\mathsf {SNR}^{\frac {K(K-1)}{1-\kappa }}}\right)$ , where SNR , n , M , and N denote the signal-to-noise ratio, the total number of D2D pairs in the network, the number of transmit antennas, the number of receive antennas, respectively, and $\kappa \in $ (0, 1). The numerical results validate that the proposed technique outperforms existing scheduling schemes in terms of sum rates.

In this paper, we investigate stability region of hybrid uplink non-orthogonal multiple access (NOMA) in conjunction with non-cooperative game, where two users independently send packets with transmit power control according to fading channel gain to the same radio resource so that their packets are received at a base station (BS) with one of two target receive powers (TRPs). The BS then tries to decode the packets with successive interference cancellation (SIC) technique in power domain. We consider a symmetric non-cooperative game where the users (or players) send packets with one of two TRPs or no transmission. We examine the convexity of stability region at the mixed-strategy Nash equilibrium (NE) of the game, where no one's queue grows to infinity. Furthermore, we investigate how the stability region changes depending on the parameters of users’ payoff.

Orbital angular momentum (OAM) multiplexing has recently been proposed as a solution to the ultimate goal of increasing the channel capacity of wireless communication links because of the existence of infinite orthogonal modes. It can be combined with the existing conventional multiplexing techniques to boost up the data rate multiple times for future wireless communication systems. We analyze the fundamental behavior of the channel capacity of OAM channels based on two concepts for the most common Laguerre-Gaussian OAM beams: paraxiality and orthogonality. We also confirm our general theory by applying the proposed method to the evanescing OAM beams, circular transverse electric beams. Our study is based on calculating the paraxial estimator of these OAM beams and relating it as a parameter that limits the degree of freedom in OAM channels. In particular, we investigate the dependency on physical parameters, such as transmitter and receiver sizes, in our calculation to define the capacity of OAM channels.

In this paper, we propose a cooperative maximum-ratio transmission (C-MRT) technique with multi-antenna relay nodes for tactical mobile ad-hoc networks (MANETs) where both the location and the number of antennas of relay nodes are arbitrary. Each relay node is assumed to know both the wireless channel coefficient from the source node to itself and the wireless channel from itself to the destination node, which is known as local channel state information (CSI) assumption. Maximum-ratio combining (MRC) and MRT techniques are used for beamforming the transmit and receive signals of the relay node, respectively. In addition, we mathematically analyze the overall outage probability of the proposed technique with moment generating function (MGF). It is shown that the mathematical analysis on the overall outage probability of the proposed C-MRT technique is matched well with the simulation results especially in high transmit power regimes. It is also observed that the proposed technique outperforms other schemes such as phase steering (PS) and optimal relay selection (ORS) in terms of outage probability.

In 5G cellular networks, it is required to accommodate a massive number of Internet-of-Things (IoT) devices in a resource-efficient way. In this letter, we propose a random access with an inter-frame successive interference cancellation (RA-ISIC) for stationary IoT networks. In our proposed scheme, the BS does not discard the collided packets and attempts to recover them through inter-frame SIC operations. We evaluate the performance of our proposed scheme in terms of resource efficiency. Results show that a certain level of system load is required to maximize the efficiency of our proposed scheme, which can be achieved through a probabilistic retransmission (PR) policy. Consequently, our proposed scheme can effectively improve the resource efficiency and can be suitable to accommodate more IoT devices with a smaller amount of resources, compared to the conventional one.

A planar antenna is designed to replace complex structures of many rat-races and 90° hybrids used in conventional target detection antennas for receiving radar signals. The proposed antenna has 2 × 2 microstrip patch antenna arrays with dual feeding to radiate symmetric polarizations in the 9.375 GHz ( X -band). The sum (Σ) pattern with circular polarization is implemented through a sequence feeding at port 1. The simultaneous feeding of port 2 radiates a difference (Δ) pattern in all linear polarizations. Thus, the proposed antenna is compact, planar, and has a simple comparator circuit. Measurement results verify the designed prototype, showing that the antenna has a null depth of over 34.5 dB in all polarizations, a peak sum gain 4.51 dB at 9.375 GHz, and a 3 dB axial-ratio bandwidth of 160 MHz.

This work proposes a random access system with uplink non-orthogonal multiple access (NOMA), where users transmit their packets by using the space-time line code (STLC) to fully exploit the spatial diversity without channel state information at the receiver. More specifically, users with a single antenna estimate channel gain from the base station (BS) with two antennas, encode the information using the STLC, and then transmit it using transmit power control so that the received power of their packets at the BS can be one of the predetermined values. The BS decodes the received packets via STLC decoding and the successive interference cancellation technique. Owing to spatial diversity, we show that the proposed scheme improves energy efficiency in comparison to the conventional system with a single antenna BS.

In this paper, an $M\times 4$ double space-time line code (D-STLC) is designed for a system with $M$ -transmit and four-receive antennas whose channel state information is available at the transmitter. By delivering two independent STLC data streams simultaneously, both spatial diversity and multiplexing gains are obtained, like a $4\times M$ double space-time transmit diversity (DSTTD) system that transmits two space-time block coded data streams. It is analytically shown that the decoding signal-to-interference-plus-noise ratios of D-STLC and DSTTD are identical to each other, and furthermore, it is numerically verified that the proposed D-STLC significantly outperforms a conventional $M\times 4$ STLC scheme and other existing spatial-diversity and spatial-multiplexing schemes, such as precoded space-time block code and precoded spatial multiplexing, in terms of achievable rate and bit-error-rate performance as the signal-to-noise ratio and/or transmission data rate increase.

In this paper, we propose an enhanced random access (RA) with a distributed pilot orthogonalization (ERA-DPO) for mitigating packet collisions in Step3 during the RA procedure in cellular internet-of-things (IoT) networks. Even though each IoT device experiences a preamble collision in Step1, it can avoid the packet collision in Step3 by differentiating uplink pilot with the proposed technique, which provides an opportunity for the collided packets to be separated in spatial domain by multiple receive antennas. We also mathematically analyze the performance of the proposed scheme in terms of packet collision probability, throughput, and resource efficiency, based on a Markov chain model. Simulation results reveal that the proposed scheme significantly reduces the packet collision probability and increases resource efficiency compared to the conventional scheme.

Recently, there has been a rapid increase in the number of (small-cell) base stations (BSs) to support the massive amount of mobile data traffic and rapidly increasing number of mobile devices in beyond 5G (B5G) wireless communication systems or Internet of Things (IoT) networks. However, many of these BSs tend to waste a considerable amount of energy to support such data traffic and mobile devices. Therefore, the development of an efficient BS status control algorithm is important for realizing energy-efficient IoT networks. To reduce network energy consumption, we herein propose a density clustering-based BS control algorithm for energy-efficient IoT networks (DeCoNet). DBSCAN (Density-Based Spatial Clustering of Applications with Noise) and OPTICS (Ordering Points To Identify the Clustering Structure) are utilized for partitioning high and low user-density regions. To find the effective number of BSs and their appropriate locations considering user-density differences, we utilize parameters obtained after applying density clustering algorithms to derive the thinning radius that is used to adjust the status of BSs in overall cellular IoT networks. Specifically, the average reachability-distance of each cluster in OPTICS and the distance between the outermost border users of each cluster in DBSCAN are used to obtain the radius of each cluster region. Through extensive computer simulations, we show that the proposed algorithms outperform the conventional algorithms in terms of average area throughput, energy efficiency, energy per information bit, and power consumption per unit area.

Time-division multiple access (TDMA)-based medium access control (MAC) protocol has been widely used for avoiding access conflicts in wireless multi-hop ad hoc networks, where the time synchronization among wireless nodes is essential. In this paper, we propose a novel time synchronization protocol for TDMA-based cooperative multi-hop wireless ad hoc networks, which are also called barrage relay networks (BRNs). The proposed time synchronization protocol is based on cooperative relay transmissions to send time synchronization messages. We also propose a network time reference (NTR) selection technique for improving the convergence time and average time error. In the proposed NTR selection technique, each node overhears the user identifier (UID) of other nodes, hop count (HC) from them to itself, and network degree, which denotes the number of 1-hop neighbor nodes. Then, the node with the minimum HC from all other nodes is selected as the NTR node. If there are multiple nodes with the minimum HC, the node with the larger degree is selected as the NTR node. To the best of our knowledge, the proposed time synchronization protocol with the NTR selection is introduced for the first time for cooperative (barrage) relay networks in this paper. Through computer simulations, we validate the proposed time synchronization protocol in terms of the average time error under various practical network scenarios. Furthermore, we also compare the performance of the proposed protocol with the conventional time synchronization methods. It is shown that the proposed protocol significantly outperforms the conventional methods in terms of the average time error and convergence time. The proposed protocol is shown to be more robust against packet loss as well.

In this paper, we revisit a two-user space-time line coded uplink non-orthogonal multiple access (STLC-NOMA) system for Internet-of-things (IoT) networks and propose a novel low-complexity STLC-NOMA system. The basic idea is that both IoT devices (stations: STAs) employ amplitude-shift keying (ASK) modulators and align their modulated symbols to in-phase and quadrature axes, respectively, before the STLC encoding. The phase distortion caused by wireless channels becomes compensated at the receiver side with the STLC, and thus each STA’s signals are still aligned on their axes at the access point (AP) in the proposed uplink STLC-NOMA system. Then, the AP can decode the signals transmitted from STAs via a single-user maximum-likelihood (ML) detector with low-complexity, while the conventional uplink STLC-NOMA system exploits a multi-user joint ML detector with relatively high-complexity. We mathematically analyze the exact BER performance of the proposed uplink STLC-NOMA system. Furthermore, we propose a novel expectation-maximization (EM)-based blind energy estimation (BEE) algorithm to jointly estimate both transmit power and effective channel gain of each STA without the help of pilot signals at the AP. Somewhat interestingly, the proposed BEE algorithm works well even in short-packet transmission scenarios. It is worth noting that the proposed uplink STLC-NOMA architecture outperforms the conventional STLC-NOMA technique in terms of bit-error-rate (BER), especially with high-order modulation schemes, even though it requires lower computation complexity than the conventional technique at the receiver.

In this paper, we suggest an RFID tag antenna for ultrahigh frequency band for radio frequency identification for drug runout management and a float motion detection that can be used in hospitals and fishing. The RFID tag antenna works as a sensor which warns of drug runout when the drug inside the drip chamber is completely consumed, while it does not work if the drug remains inside the drop chamber. Also, the antenna which attached to the fishing float propagates signals when it is exposed to air, but it does not work when submerged in water. The fabricated antenna has an average omnidirectional reading range of 10.65 m in the horizontal plane.

In this paper, we propose a virtual full-duplex cooperative non-orthogonal multiple access (NOMA) framework for a downlink two-hop network assisted by multiple half-duplex decode–and–forward (DF) relay stations (RSs). In the proposed virtual full-duplex framework, the RSs except for a selected RS to forward the received signal suffer from inter-RS interference since both the BS and the selected RS transmit the super-imposed signal simultaneously. To address this problem, we propose an RS selection algorithm with adaptive inter-RS interference management and we mathematically attain the closed-form outage probability, which is challenging in general. In addition, we investigate diversity-multiplexing tradeoff (DMT) performance of a modified version of the proposed RS selection algorithm based on a discrete Markov chain, which adaptively resets the successive transmission. Simulation results show that the proposed RS selection algorithm outperforms the conventional cooperative NOMA algorithm in terms of both the outage probability and the DMT, which has the best performance reported in the literature.