Joint Pattern Assignment and Power Allocation for Energy Consumption Minimization for Massive MTC with PDMA

Group paging (GP) is an effective way to solve the serious congestion problem. Congestion problem usually is caused by lots of machine-type communication (MTC) devices communicating at the same time. A certain number of MTC devices in each time slot is been activated, and the number of MTC devices can achieve the maximum of resource utilization. First of all, the total number of MTC devices in each time slot should be calculated according to the different new arrivals in each time slot. By making the resources utilization maximum, the optimal number of total MTC devices can be obtained, from which the optimal number of arriving MTC devices in each time slot will be get. To estimate the total number of MTC devices for traffic scattering GP, a Fast Group Paging Algorithm (FGPA) is proposed, which aims to improve the performance of GP under the condition of massive MTC devices. FGPA is an iterative algorithm that converges fast and has low arithmetic complexity. The corresponding simulation results demonstrate that the proposed FGPA requires less number of iterations under the condition of the same estimation results of total number of MTC devices compared with the existing iterative algorithm.

Machine-to-Machine (M2M) communications have received considerable attentions in recent years. By allowing machine type communications devices (MTCDs) to communicate with each other or with infrastructures under reduced human intervention, M2M communications are expected to offer a large variety of MTCD-related applications. While the vision of M2M communications is quite promising, the diverse quality of service (QoS) requirements and the complicated network architecture pose challenges and difficulties to resource allocation, cell selection and random access schemes, etc. In this paper, we take into account the impacts of random access on the transmission performance of the MTCDs and examine the energy efficiency of each MTCD. Applying the concept of utility function, we define network utility function and formulate the problem of joint cell selection and power allocation as a network utility function maximization problem. By applying iterative method and Lagrange dual method, the formulated optimization problem is solved and the optimal joint cell selection and power allocation strategy can be obtained. Simulation results demonstrate the effectiveness of the proposed algorithm.

The increasing adoption of Machine Type Communication (MTC) applications using the Long Term Evolution (LTE) brings new challenges for the traditional bearer allocation and network management. MTC devices are high in number, each requiring an individual bearer for a short data transmission; an inefficient process considering the signaling and management effort to the duration of the actual bearer use. This paper introduces the notion of a virtual bearer that can be shared among a number of MTC devices with similar Quality of Service (QoS) characteristics. The virtual bearer support at the MTC device side is based on the paradigm of Network Function Virtualization (NFV) and can migrate from one MTC device to another eliminating the need for individual device bearer establishment for both the radio and backhaul. The use of virtual bearers is enhanced by considering additionally MTC device-to-device (D2D) connectivity allowing devices without direct access to the network to use the virtual bearer via other devices, which act as gateways. Gateway devices may also be re-located dynamically based on NFV principles. In this way, a finer control is achieved on prioritizing certain services and providing load balancing. Our simulation results demonstrate the benefits of our proposed scheme compared to conventional approaches wherein MTC devices use individual bearers to send data in response to a trigger or according to a predetermined schedule.

This paper studies the case of an overlay cognitive radio network where the primary user leases spectral resources to the secondary user in exchange for cooperation, considering that both type of users have specific quality of service requirements. We investigate the problem of joint power and time allocation for the secondary access during the cooperative phase, with a view to optimizing the effective capacity of the primary user given an average energy constraint for the secondary user. Afterwards, the optimal power allocation of the secondary user for its own transmission phase is investigated in order to maximize the effective capacity of the secondary link. The proposed joint power and time allocation mechanism is compared with an optimal time/constant power allocation scheme and a less sophisticated baseline allocation scheme, i.e. power allocation under constant time and its superiority is proven for various network parameters. The reference model of one primary---one secondary user is extended to a general multi user cognitive radio network through the proposed pairing mechanism based on matching theory. Particularly, considering the remarks of the reference scenario, we propose two different matching schemes (with/without consideration of primary users' quality of service requirements) and we confirm their superiority compared to other matching mechanisms.

Effective resource allocation has always been one of the serious challenges in wireless communication. A considerable number of machine type communication (MTC) devices in 5G with variable quality of service (QoS) aggravates this challenge even further. Existing Resource allocation schemes in MTC are usually considering signal to noise ratio (SNR), which provides preference to MTC devices based on distance rather than their QoS requirements. This paper proposes a resource allocation scheme with dynamic priorities for MTC devices with multiple radio access technologies (RATs). The proposed resource allocation scheme has two main parts namely medium access and resource allocation. The medium access leverages the broadcast nature of wireless signal and MTC devices' wait time to assign priorities using capillary band in a secure and integral way. At resource allocation, SNR, total induced transmission delay, and transmission-awaiting MTC devices are used to assign resources in the cellular band. The rumination of two-staged dynamic priorities in the proposed scheduling scheme brings significant performance improvements in outage and success probabilities. Compared to SNR-based schemes, the proposed mechanism performs well by expressively improving the outage and success probability by 20% and 30%, respectively.

A novel cross-layer joint relay selection and power allocation (CL-JRSPA) scheme over physical layer and data-link layer is proposed for cooperative relaying system in this paper. Our goal is finding the optimal relay selection and power allocation scheme to maximize system achievable rate when satisfying total transmit power constraint in physical layer and statistical delay quality-of-service (QoS) demand in data-link layer. Using the concept of effective capacity (EC), our goal can be formulated into an optimal joint relay selection and power allocation (JRSPA) problem to maximize the EC when satisfying total transmit power limitation. We first solving optimal power allocation (PA) problem with Lagrange multiplier approach, and then solving optimal relay selection (RS) problem. Simulation results demonstrate that CL-JRSPA scheme gets larger EC than other schemes when satisfying delay QoS demand. In addition, the proposed CL-JRSPA scheme achieves the maximal EC when relay located approximately halfway between source and destination, and EC becomes smaller when the QoS exponent becomes larger.

The explosive demands for mobile broadband service bring a major challenge to 5G wireless networks. Device-to-device communication, adopting side links for user-direct communication, is regarded as a main technical source for offloading large volume of mobile traffic from cellular base station. This article investigates the joint power and subcarrier allocation scheme for device-to-device communication in 5G time division duplex systems. In time division duplex system, instead of utilizing an exclusive portion of the precious cellular spectrum, device-to-device pairs reuse the subcarriers occupied by cellular users, thus producing harmful interference to cellular users in both uplink and downlink communication, and strongly limiting the spectrum efficiency of the system. To this end, we focus on the maximization of device-to-device throughput while guaranteeing both uplink and downlink channel quality of service of cellular users as well as device-to-device pairs. The problem is formulated as a mixed integer non-linear programming (MINLP) problem. To make it tractable, we separate the original MINLP problem into two sub problems: power allocation and sub-carrier reusing. The former is to develop optimal power allocation for each device-to-device pair and each cellular user, with the constraints of maximum power and quality of service. It is solved by geometric programming technique in convex optimization method. The latter is derived as a one-to-many matching problem for scheduling multiple subcarriers occupied by cellulars to device-to-device pairs. It is solved by Hungarian method. Simulation results show that the proposed scheme significantly improves system capacity of the device-to-device underlay network, with quality of service of both device-to-device users and cellular users guaranteed.

Pattern division multiple access (PDMA) is a multi- carrier non-orthogonal multiple access (NOMA), which can meet the requirements of massive user connections and super-high data rate in the fifth generation (5G) wireless networks. In this paper, we work on the optimization of power allocation to improve the performance in the down-link PDMA system with imperfect channel state information (CSI) at transmitter. The outage throughput of the system is maximized by optimizing the power allocation under the constraints of maximum transmits power, minimum user data rate, and outage probability. Since this optimization problem is a probabilistic mixing problem, we first turn it into a non-probability problem. Then, assuming the pattern matrix is known, we propose an iterative power allocation scheme. The closed-form expression of power allocation is derived based on Karush-Kuhn-Tucker (KKT) conditions. The simulation results demonstrate that the proposed iterative power allocation scheme yields better performance over the existing schemes.

An efficient radar-target assignment and power allocation strategy for low-angle tracking in the MIMO-multisite radar system

The concurrent data transmission from massive machine type communications (MTC) devices within a short time period makes the traffic flow of MTC more bursty. The classic Markovian traffic models under the assumption of Poisson arrival, whose inter-arrival time (IAT) is a negative exponentially distributed random variable with infinite support range, are no longer suitable for this situation. Beta distribution, a distribution with finite support range, is then proposed by 3GPP to account for this and used to serve as the IAT of MTC. The researches on the traffic modeling based on Beta distribution is still in its very initial step and is rarely reported in state of the art literatures. This article takes the initiatives to discuss some prime issues for MTC traffic modeling under the assumption of Beta arrival. By the usage of renewal theory and Volterra integral equation of the second kind with difference kernel, we present the methodology to deduce the access intensity of MTC arrival process, which is defined as the mean number of renewals by time t. Numerical results show that in the context of MTC, there is a sharp increase in the number of access requests from MTC devices which directly causes the well-known congestion problem of MTC. And the ratio of

In the realm of the fifth-generation (5G) wireless cellular networks, renowned for their dense connectivity, there lies a substantial facilitation of a myriad of Internet of Things (IoT) applications, which can be supported by the massive machine-type communication (MTC) technique, a fundamental communication framework. In some scenarios, a large number of machine-type communication devices (MTCD) may simultaneously enter the communication coverage of a target base station. However, the current handover mechanism specified by the 3rd Generation Partnership Project (3GPP) Release 16 incurs high signaling overhead within the access and core networks, which may have negative impacts on network efficiency. Additionally, other existing solutions are vulnerable to malicious attacks such as Denial of Service (DoS), Distributed Denial of Service (DDoS) attacks, and the failure of Key Forward Secrecy (KFS). To address this challenge, this paper proposes an efficient and secure handover authentication protocol for a group of MTCDs supported by blockchain technology. This protocol leverages the decentralized nature of blockchain technology and combines it with certificateless aggregate signatures to mutually authenticate the identity of a base station and a group of MTCDs. This approach can reduce signaling overhead and avoid key escrow while significantly lowering the risk associated with single points of failure. Additionally, the protocol protects device anonymity by encrypting device identities with temporary anonymous identity markers with the Elliptic Curve Diffie-Hellman (ECDH) to abandon serial numbers to prevent linkage attacks. The resilience of the proposed protocol against predominant malicious attacks has been rigorously validated through the application of the BAN logic and Scyther tool, underscoring its robust security attributes. Furthermore, compared to the existing solutions, the proposed protocol significantly reduces the authentication cost for a group of MTCDs during handover, while ensuring security, demonstrating commendable efficiency.

A cognitive radio (CR) network refers to a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multiple primary users (PUs). A fundamental challenge for realizing such a system is to ensure the quality of service (QoS) of the PUs as well as to maximize the throughput or ensure the QoS, such as signal-to-interference-plus-noise ratios (SINRs), of the secondary users (SUs). In this paper, we study single-input multiple output multiple access channels (SIMO-MAC) for the CR network. Subject to interference constraints for the PUs as well as peak power constraints for the SUs, two optimization problems involving a joint beamforming and power allocation for the CR network are considered: the sum-rate maximization problem and the SINR balancing problem. For the sum-rate maximization problem, zero-forcing based decision feedback equalizers are used to decouple the SIMO-MAC, and a capped multi-level (CML) water-filling algorithm is proposed to maximize the achievable sum-rate of the SUs for the single PU case. When multiple PUs exist, a recursive decoupled power allocation algorithm is proposed to derive the optimal power allocation solution. For the SINR balancing problem, it is shown that, using linear minimum mean-square-error receivers, each of the interference constraints and peak power constraints can be completely decoupled, and thus the multi-constraint optimization problem can be solved through multiple single-constraint sub-problems. Theoretical analysis for the proposed algorithms is presented, together with numerical simulations which compare the performances of different power allocation schemes.

Joint resource and trajectory optimization in a UAV-enabled dual-function radar-communication network

This paper investigates the optimal resource allocation of a downlink non-orthogonal multiple access (NOMA) system consisting of one base station and multiple users. Unlike existing short-term NOMA designs that focused on the resource allocation for only the current transmission timeslot, we aim to maximize a long-term network utility by jointly optimizing the data rate control at the network layer and the power allocation among multiple users at the physical layer, subject to practical constraints on both the short-term and long-term power consumptions. To solve this problem, we leverage the recently-developed Lyapunov optimization framework to convert the original long-term optimization problem into a series of online rate control and power allocation problems in each timeslot. The power allocation problem, however, is shown to be non-convex in nature and thus cannot be solved with a standard method. However, we explore two structures of the optimal solution and develop a dynamic programming based power allocation algorithm, which can derive a globally optimal solution, with a polynomial computational complexity. Extensive simulation results are provided to evaluate the performance of the proposed joint rate control and power allocation framework for NOMA systems, which demonstrate that the proposed NOMA design can significantly outperform multiple benchmark schemes, including orthogonal multiple access (OMA) schemes with optimal power allocation and NOMA schemes with non-optimal power allocation, in terms of average throughput and data delay.

We consider two-way amplify-and-forward relaying in a multichannel system with two end nodes and a single relay, using a two-slot multi-access broadcast (MABC) relaying strategy. We investigate the problem of joint subchannel pairing and power allocation to maximize the achievable sum-rate in the network, under an individual power budgets at each node. To solve this challenging joint optimization problem, an iterative approach is proposed to decompose the problem into pairing optimization and joint power allocation optimization, and solve them iteratively. For the joint power allocation at the relay and the two end nodes, we propose another iterative optimization procedure to optimize the power at the two end nodes and at the relay iteratively. By using different forms of optimization parameters, the sum-rate maximization problem turns out to be convex and the optimal solutions can be obtained for each subproblem. The simulation performance demonstrates the gain of joint optimization approach over other pairing-only or power-allocation-only optimization approaches.