Search

Carrier sense multiple access with collision notification (CSMA/CN) is a typical representation of physical-layer (PHY)/medium access control (MAC) co-designs, where the MAC control frames are implemented or detected using PHY techniques. With CSMA/CN, the sender detects an unsuccessful transmission, with the aid of a collision notification (CN) from the receiver. In this paper, we first theoretically study the crucial impact of the CN attributes (namely, the detection threshold and the length) on system throughput in a wireless local area network (WLAN). We identify that the false-alarm probability of CN (more generally, the control frames in PHY/MAC co-designs) is a dominating metric that influences system performance. This paper will help developers select optimal CN attributes to balance various factors influencing CN detection performance. Extensive simulation results verify that our performance model is very accurate. [ABSTRACT FROM PUBLISHER]

In this paper, the scaling law of the network throughput of a special type of heterogeneous networks is studied, where a secondary network composed of cognitive users shares the same resources opportunistically with a primary network of licensed users. Some pioneering works in this area showed that this type of heterogeneous networks performs as well as two stand-alone networks under the dense network model. A key assumption behind this conclusion is that the density of the secondary network is higher than that of the primary network in the order sense, which essentially decouples the two overlaid networks as the secondary network dominates asymptotically. In this paper, we endeavor to investigate this problem with a weaker condition that the dimensions of the two overlaid networks are on the same order, under the extended network model. Our analysis shows that, with the ratio of the two network sizes larger than a threshold, this weaker (and arguably more practical) condition does not degrade either network throughput scaling. Our result further reveals the potential of cognitive radio (CR) technology in real applications. [ABSTRACT FROM PUBLISHER]

We present a distributed stable protocol for local broadcast in multi-hop wireless networks, where packets are injected to the nodes continuously, and each node needs to quickly disseminate the injected packets to all its neighbors within a given communication range $R$. We investigate the maximum packet injection rate and the minimum packet latency that can be achieved in a stable protocol. This paper assumes the signal-to-interference-plus-noise-ratio (SINR) interference model, which reflects more accurately the physical characteristics of the wireless interference, such as fading and signal accumulation, than conventional local interference models, e.g., graph-based models. More specifically, we present a stable protocol that can handle both stochastic and adversarial injection patterns. The protocol is asymptotically optimal in terms of both injection rate and packet latency. To the best of our knowledge, this paper is the first one studying the properties of stable protocols for the basic primitive of local broadcast in a multi-hop setting under SINR. Our proposed protocol utilizes a static local broadcast algorithm as a subroutine. This static algorithm is of independent interest, and it closes the $O(\log n)$ gap between the upper and lower bounds for static local broadcast. Simulation results indicate that our proposed algorithms can perform well in realistic environments. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid radio frequency (RF) and visible light communication (VLC) system is considered. A hybrid system with multiple VLC access points (APs) and RF APs is designed and analyzed. In indoor environments, VLC APs provide very high data rates whilst proving illumination, and RF APs offer ubiquitous coverage with moderate data rates. Since VLC networks piggyback on existing lighting infrastructures, they may not always be able to provide full coverage despite supporting very high data rates in some areas. Hence in practical deployments, the standalone VLC networks should be augmented in order to improve the per user data rate coverage. In this context, RF APs can be used to improve the per user rate coverage of VLC networks as well as to provide the ubiquitous control functionalities. In this paper, a simple RF deployment is proposed in order to improve the per user outage data rate performance of standalone VLC networks. It is assumed that the VLC system resources are fixed, and this paper quantifies the minimum spectrum and power requirements for a RF system, which after introduction to the VLC system, the hybrid RF/VLC system achieves certain per user rate coverage performances. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach to assess the performance in terms of end-to-end throughput of an ad hoc multi-hop wireless network, where each link is affected by interference coming from other multi-hop paths nearby. The approach captures the mutual impact of each path on all others. It can be applied to both, contention-based and scheduled, medium access control (MAC) protocols. Sources have data to send to destination nodes through $n$ relays. Nodes are assumed to be uniformly and randomly distributed in the 2-D infinite plane. The model shows the impact on the end-to-end throughput of $n$ ; it also captures the influence of node density, traffic generated, number of retransmissions, and other MAC parameters. Finally, the model provides the throughput-delay tradeoff. Unlike most previous approaches, the mathematical tool proposed appears to be scalable, allowing easy extension to any number of hops. Comparison with simulation results is provided to prove that the impact of the approximations introduced in the analysis is almost negligible. [ABSTRACT FROM PUBLISHER]

There have been some rapid advances on the design of full duplex (FD) transceivers in recent years. Although the benefits of FD have been studied for single-hop wireless communications, its potential on throughput performance in a multi-hop wireless network remains unclear. As for multi-hop networks, a fundamental problem is to compute the achievable end-to-end throughput for one or multiple communication sessions. The goal of this paper is to offer some fundamental understanding on end-to-end throughput performance limits of FD in a multi-hop wireless network. We show that through a rigorous mathematical formulation, we can cast the multi-hop throughput performance problem into a formal optimization problem. Through numerical results, we show that in many cases, the end-to-end session throughput in a FD network can exceed $2 \times$ of that in a half duplex (HD) network. Our finding can be explained by the much larger design space for scheduling that is offered by removing HD constraints in throughput maximization problem. The results in this paper offer some new understandings on the potential benefits of FD for end-to-end session throughput in a multi-hop wireless network. [ABSTRACT FROM AUTHOR]

In this paper, we optimize the energy efficiency (bits/s/Hz/J) of device-to-multi-device (D2MD) wireless communications. While the device-to-device scenario has been extensively studied to improve the spectral efficiency in cellular networks, the use of multicast communications opens the possibility of reusing the spectrum resources also inside the groups. The optimization problem is formulated as a mixed integer non-linear joint optimization for the power control and allocation of resource blocks (RBs) to each group. Our model explicitly considers resource sharing by letting co-channel transmission over a RB (up to a maximum of $r$ transmitters) and/or transmission through $s$ different channels in each group. We use an iterative decomposition approach, using first matching theory to find a stable even if sub-optimal channel allocation, to then optimize the transmission power vectors in each group via fractional programming. In addition, within this framework, both the network energy efficiency and the max-min individual energy efficiency are investigated. We characterize numerically the energy-efficient capacity region, and our results show that the normalized energy efficiency is nearly optimal (above 90% of the network capacity) for a wide range of minimum-rate constraints. This performance is better than that of other matching-based techniques previously proposed. [ABSTRACT FROM AUTHOR]

In this paper, we propose a decentralized access control scheme for interference management in device-to-device (D2D) underlaid cellular networks. Our method combines signal-to-interference ratio (SIR)-aware link activation with cellular guard zones in a system, where D2D links opportunistically access the licensed cellular spectrum when the activation conditions are satisfied. Analytical expressions for the success/coverage probability of both cellular and D2D links are derived. We characterize the impact of the guard zone radius and the SIR threshold on the D2D potential throughput and cellular coverage. A tractable approach is proposed to find the SIR threshold and guard zone radius that maximize the potential throughput of the D2D communication while ensuring sufficient coverage probability for the cellular uplink users. Simulations validate the accuracy of our analytical results and show the performance gain of the proposed scheme compared to prior state-of-the-art solutions. [ABSTRACT FROM AUTHOR]

In this paper, we consider the two-user broadcast channel and we characterize its stable throughput region. We start the analysis by providing the stability region for the general case without any specific considerations on transmission and reception mechanisms. We also provide conditions for the stable throughput region to be convex. Subsequently, we study the case where the transmitter uses superposition coding and we consider two special cases for the receivers. The first one is when both receivers treat interference as noise. The second is when the user with a better channel uses successive decoding and the other receiver treats interference as noise. [ABSTRACT FROM AUTHOR]

Compared to half duplex communications, full duplex communications can significantly improve link capacity. However, in a large scale wireless network such as a wireless mesh network, the capacity gain from full duplex communications has not been fully investigated. To this end, a metric of network capacity called transmission capacity is studied in this paper for a full duplex wireless network. It captures the maximum transmission throughput in a unit area, subject to a certain outage probability. The key challenge of deriving transmission capacity is to characterize the aggregate interference of the typical link in a full duplex wireless network, which is completely different from that in a half duplex wireless network. In this paper, stochastic geometry is employed to model the network topology as a Thomas cluster point process and then the aggregate interference is characterized as a shot-noise process. Based on these models, the transmission capacity is derived. Analytical results show that under the same network density the distribution of aggregate interference in a full duplex wireless network is more dispersed than that in a half duplex wireless network. Comparisons of transmission capacity between a full duplex network and a half duplex network reveal that the capacity gain from full duplex communications is limited due to severe aggregate interference. This result implies that self-interference cancellation alone cannot ensure scalable full duplex wireless networking. [ABSTRACT FROM PUBLISHER]

Densely deployed cellular wireless networks, which employ small cell technology, are being widely implemented. Mitigating the impact of inter- and intracell signal interferences induced by the operations of these networks is a challenging yet essential task. In this paper, we consider adaptive rate scheduling for a transmitting node, regardless of whether it is a base station (BS) or a mobile user. We aim to maximize the system's throughput through the employment of fractional frequency reuse (FFR) schemes. Each BS employs either an omnidirectional or a directional antenna system. We derive the optimal configuration of the FFR scheme and evaluate the ensuing system's performance behavior under absolute and proportional fairness requirements. To maximize the attained throughput by mobiles, we determine the best method to use to classify cell users into interior and edge mobiles. The bandwidth levels allocated for serving interior and edge mobiles are optimized. We derive approximate closed-form mathematical expressions for calculating the probability distributions of the interference signal levels measured at the destined receivers. We account for the impact of the classification process on intercell interference power levels. Under an absolute fairness requirement, we show that optimally configured FFR schemes lead to much enhanced performance. We show that the optimally configured directional-FFR schemes increase the throughput capacity by a factor of about 60% relative to that obtained by using optimal omnidirectional-FFR schemes. The analyses and simulation results presented in this paper serve to characterize the performance behavior attainable by using such small cell deployed cellular wireless network systems when employing the underlying configurations. [ABSTRACT FROM AUTHOR]

The adjacent channel interference (ACI) resulting from imperfect filtering can severely degrade the performance of any wireless communication system. Despite this fact, most of previously proposed medium access control (MAC) protocols for cognitive radio networks (CRNs) were designed while ignoring the effects of ACI (assuming ideal filtering). The effect of ACI can be reduced by introducing guard bands (GBs). However, this solution comes at the expense of degrading spectrum efficiency. In this paper, we develop an efficient GB-aware MAC protocol that attempts at maximizing network throughput while improving fairness in CRNs. Unlike most of previously proposed GB-aware MAC protocols that perform channel assignment sequentially, our MAC performs the channel assignment for multiple CR links simultaneously (the so-called batch method). Batching enables concurrent channel assignment for multiple CR links, which consequently allows for concurrent data transmissions. Batching can be realized by introducing an admission control phase for CR users to share their control information. The batch method can effectively provide distributed decisions that achieve better throughput while reducing the number of GBs. Our MAC also allows the CR users to utilize the reserved GBs of primary networks under predefined FCC power constraints. Simulation results indicate that our protocol achieves significant performance improvement compared to previous GB-aware protocols. [ABSTRACT FROM AUTHOR]

Recently, multiple concurrent transmission techniques have been proposed for smartly exploiting interference to improve network throughput. This paper considers zero-forcing (ZF) precoding that allows two interfering links to concurrently transmit under certain situations. This paper focuses on identifying appropriate schedule schemes that efficiently utilize the ZF precoding opportunities to improve network throughput. With this motivation, we define novel link models to formulate our concerned problem. We also develop a distributed scheduling algorithm by using belief propagation. Finally, we conduct extensive simulation experiments to evaluate the efficiency of ZF in improving network throughput in multihop wireless networks. Our simulations confirm that intelligently utilizing ZF in multihop networks is very effective in improving throughput. [ABSTRACT FROM PUBLISHER]

The large spectral bandwidth at millimeter-wave (mmWave) frequencies provides a mean to achieve very high data rates in wireless communication systems. A unique characteristic of mmWave is that mmWave links are very sensitive to blockage and have large propagation path loss, which exhibits low line-of-sight (LoS) probability, unstable connectivity and unreliable communication. This paper studies the influence of the blockage in pedestrian scenario, explains in detail how blockage affects the mmWave propagation characteristics. In particular, we study the behavior of the blockage due to human mobility and how it affects the timescale for outage due to blockage using knife-edge diffraction model (KED). One of the existing solutions to overcome the influence of blockage, is to associate the user equipment (UE) with other available base stations (BSs) by handover (HO) if the serving BS is blocked. In this paper, for a pedestrian scenario, we propose two reinforcement learning (RL) based user association algorithms, which accounts for the past experience of the blockage on the position of the UE. One focuses on the reward to increase the sum LoS probability and is named as blockage-aware user association (BAUA). The other focuses on the reward to balance the trade-off between the throughput and the LoS probability and is named as modified BAUA. We compare the proposed algorithm with the conventional user algorithms such as the maximum throughput based algorithm and the maximum SINR based algorithm. Simulation results show that to increase the sum LoS probability BAUA would be suitable, and to increase the average throughput maximum throughput based method would be suitable. [ABSTRACT FROM AUTHOR]

The 802.11ac is a significant landmark in wireless communications, as it pushes towards new rate limits by utilizing downlink multiuser multiple-input multiple-output (MIMO) beamforming to transmit data to various locations simultaneously. However, successful beamforming relies on intelligent user selection which requires, in turn, extensive overhead of channel calibration between the AP and each of the candidate users. The large overhead involved in the user selection procedure overwhelms the multiuser gain and hinders the utilization of multiuser MIMO. The phenomenon is even more acute when APs handle large groups of mobile users, which frequently associate and disconnect, making the process of acquiring channel state from all users and selecting the appropriate group even harder. Thus, the subtle relation between the achievable rate of a scheduling algorithm and the overhead it requires is significant for the 802.11ac performance analysis. In this paper, we provide a rigorous analysis of distributed algorithms that schedule a group of users for the downlink. In particular, we accommodate common scheduling methods for the 802.11ac protocol and analyze both their achievable rate and their calibration process overhead. Both analysis and extensive simulations depict the superiority of simple threshold-based methods in terms of the throughput. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the design and analysis of coded slotted ALOHA (CSA) schemes in the presence of channel erasure. We design the code probability distributions for CSA schemes with repetition codes and maximum distance separable codes to maximize the expected traffic load, under both packet erasure channels and slot erasure channels. We derive the extrinsic information transfer (EXIT) functions of CSA schemes over erasure channels. By optimizing the convergence behavior of the derived EXIT functions, the code probability distributions to achieve the maximum expected traffic load are obtained. Then, we derive the asymptotic throughput of CSA schemes over erasure channels. In addition, we validate that the asymptotic throughput can give a good approximation to the throughput of CSA schemes over erasure channels. [ABSTRACT FROM AUTHOR]

The level crossing rate (LCR) is an important second-order statistical quantity that characterizes the rate of occurrence of fading time intervals. In this paper, we investigate the LCR of multiantenna flat-fading channels in the presence of additive white Gaussian noise and cochannel interferers with unequal received powers and Doppler shifts. We first present a unified approach to derive the exact LCR of the signal-to-interference-noise ratio at a receiver, where maximum ratio combining is deployed over spatially correlated or uncorrelated systems. Through the exact LCR derivation, we identify an accurate approach to obtain a simplified approximate LCR expression in the spatially uncorrelated system case. Benefits of the LCR expressions derived in the paper are demonstrated in two important applications: 1) the packet error rate is evaluated through the finite-state Markov channel model; and 2) the optimum packet length to maximize the throughput of the system with the stop-and-wait automatic repeat request protocol is derived. The analytical results are validated by simulations. [ABSTRACT FROM PUBLISHER]

Propelled by multi-user MIMO (MU-MIMO) technology, unmanned aerial vehicles (UAVs) as mobile hotspots have recently emerged as an attractive wireless communication paradigm. Rate adaptation (RA) becomes indispensable to enhance UAV communication robustness against UAV mobility-induced channel variances. However, existing MU-MIMO RA algorithms are mainly designed for ground communications with relatively stable channel coherence time, which incurs channel measurement staleness and sub-optimal rate selections when coping with highly dynamic air-to-ground links. In this paper, we propose SensRate, a new uplink MU-MIMO RA algorithm dedicated for low-altitude UAVs, which exploits inherent on-board sensors used for flight control with no extra cost. We propose a novel channel prediction algorithm that utilizes sensor-estimated flight states to assist channel direction prediction for each client and estimate inter-user interference for optimal rates. We provide an implementation of our design using a commercial UAV and show that it achieves an average throughput gain of $1.24\times $ and $1.28\times $ compared with the bestknown RA algorithm for 2- and 3-antenna APs, respectively. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) communications underlaying cellular networks have been recently considered as a promising means to enhance resource utilization of the cellular network and local user throughput among devices in proximity to each other. In this paper, we investigate the joint resource block assignment and transmit power allocation problem to optimize the network performance in such a scenario. Specifically, we model the interference relationships among different D2D and cellular communication links as a novel interference graph with unique attributes and propose a corresponding joint resource-allocation scheme that can effectively lead to a near-optimal solution at the base station, with low computational complexity. Simulation results confirm that, with markedly reduced complexity, our proposed scheme achieves a network throughput that approaches the one corresponding to the optimal resource-sharing scheme obtained via exhaustive search. [ABSTRACT FROM PUBLISHER]

In this paper, we consider a heterogenous network in which low-power indoor femtocells are deployed in the coverage area of the existing macrobase station (MBS). This paper proposes a novel coordinated random beamforming and user-scheduling strategy to improve the throughput of users served by the femtocell access point (FAP) while satisfying the quality-of-service (QoS) requirements of users served by both MBS and FAP. The strategy, termed as QoS-aware coordinated scheduling (QACS), requires limited coordination between the MBS and FAP, i.e., only the indexes of the qualified beams are shared. Exact statistical analysis for the ergodic achievable rate of both FAP and MBS with the proposed strategy are presented. Scheduling fairness is also addressed for the proposed QACS. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems employing a full-duplex (FD) base station for serving multiple half-duplex (HD) downlink and uplink users simultaneously. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted sum system throughput. We apply monotonic optimization to develop an optimal joint power and subcarrier allocation policy. The optimal resource allocation policy serves as a system performance benchmark due to its high computational complexity. Furthermore, a suboptimal iterative scheme based on successive convex approximation is proposed to strike a balance between computational complexity and optimality. Our simulation results reveal that the proposed suboptimal algorithm achieves a close-to-optimal performance. In addition, FD MC-NOMA systems employing the proposed resource allocation algorithms provide a substantial system throughput improvement compared with conventional HD multicarrier orthogonal multiple access (MC-OMA) systems and other baseline schemes. In addition, our results unveil that FD MC-NOMA systems enable a fairer resource allocation compared with traditional HD MC-OMA systems. [ABSTRACT FROM AUTHOR]

This paper uses a spatial Aloha model to describe a distributed autonomous wireless network in which a group of transmit–receive pairs (users) shares a common collision channel via slotted-Aloha-like random access. The objective of this study is to develop an intelligent algorithm to be embedded into the transceivers so that all users know how to self-tune their medium access probability (MAP) to achieve overall Pareto optimality in terms of network throughput under spatial reuse while maintaining network stability. While the optimal solution requires each user to have complete information about the network, our proposed algorithm only requires users to have local information. The fundamental of our algorithm is that the users will first self-organize into a number of nonoverlapping neighborhoods, and the user with the maximum node degree in each neighborhood is elected as the local leader (LL). Each LL then adjusts its MAP according to a parameter R, which indicates the radio intensity level in its neighboring region, whereas the remaining users in the neighborhood simply follow the same MAP value. We show that by ensuring R \le \text{2} at the LLs, the stability of the entire network can be assured, even when each user only has partial network information. For practical implementation, we propose each LL to use R=\text{2}$ as the constant reference signal to its built-in proportional and integral controller. The settings of the control parameters are discussed, and we validate through simulations that the proposed method is able to achieve close-to-Pareto-front throughput. [ABSTRACT FROM PUBLISHER]

To support a tremendous amount of traffic demands via wireless access in 2020 and beyond, limited bandwidth of the licensed bands has been a major obstacle to boosting further the capacity of wireless services. To fundamentally break through this predicament, an emerging technology known as heterogeneous carrier communications has been launched into standardization in the form of licensed-assisted access (LAA) to the unlicensed bands. Integrating the heterogeneous cloud radio access networks and carrier aggregation, and although LAA-empowered cellular networks gain wider bandwidth from the unlicensed bands, communications may suffer from intersystem interference. To avoid interference, listen-before-talk has been designated as a mandatory function; however, it leads to significant challenges of the hidden-terminal problem. To address this open issue in LAA, in this paper, we consequently propose a resource-optimal scheme using a minimum amount of replicated radio resources to achieve the most essential latency guarantees for real-time applications. To further support non-real-time applications, a new resource control as well as the mathematical architecture inspired by so-called political communications is proposed to further maximize the throughput of packet delivery. Our scheme not only optimizes resource utilization in time and spatial domains but also suggests optimum energy efficiency and computation efficiency, to successfully deploy cellular networks on the unlicensed bands. [ABSTRACT FROM PUBLISHER]

Joint optimal resource allocation and probabilistic caching design is conceived for device-to-device (D2D) communications in a heterogeneous wireless network (HetNet) relying on full-duplex (FD) relays. In particular, popular contents can be cached at user devices and at relays that are located close to users. A user may request the contents of interest from another user via D2D communications and also from a nearby relay equipped with FD radios. If the requested contents are not found in the buffers of other users/relays within the coverage range, users may opt for connecting to the macro base station (MBS) via a relay by using an FD communication. Furthermore, we propose a beneficial mobility-aware coded caching philosophy for D2D communications in the HetNet considered. Especially, we model the mobility pattern of users as discrete random jumps and exploit coded caching for improving the throughput attained. Subsequently, we develop mathematical models for analyzing the throughput in the presence of edge caching, where both the system-level co-channel interference and the FD self-interference are considered. We circumvent the high complexity of stochastic optimization by developing low-complexity optimization. Finally, numerical results are presented to illustrate the theoretical findings developed in this paper and quantify the throughput gains attained. [ABSTRACT FROM AUTHOR]

The advancement of integrated millimeter-wave products opens the possibility of leveraging communications in 60-GHz band to meet the unprecedented traffic demand in WLAN. Despite the vast bandwidth available, millimeter-wave signals suffer from high attenuation and weak diffraction ability. Therefore, wireless communication at 60 GHz is characterized by the inherent directivity and susceptibility to blockage. Multiple Access Point (AP) architecture is proposed for 60-GHz WLAN to enhance spatial reuse and survive blockage. In the presence of multiple APs in the network, this paper addresses the important problem of user-AP association and resource allocation. We study three schemes of different complexity and investigate how to maximize user throughput with joint consideration of AP assignment and transmission scheduling. To solve the formulated problem, we propose a branch-and-cut-based solution procedure. We perform a detailed comparative analysis of the three schemes and advocate to use one-shot AP assignment-based scheduling scheme due to its simplicity and good performance. To deal with real-time traffic and human blockage, we propose an online algorithm to implement the one-shot AP assignment-based scheme to avoid frequent service disruption. Our results show that the proposed online algorithm is competitive when compared with the optimal offline algorithm. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) based offloading stands out as a promising approach to mitigate the pressure over cellular networks. From the perspectives of both operators and users, an ideal solution is expected to maximize the offloading efficiency (ratio) while guaranteeing the quality-of-service (QoS) of users. However, existing approaches seldom jointly take into consideration offloading efficiency optimization and QoS guarantee. In this paper, we study how to maximize the percentage of total offloaded traffic of mobile content downloading via D2D, while guaranteeing the user minimum throughput under limited buffer size. The major challenge is how to incorporate all potential D2D opportunities to maximize the offloading performance. We propose a spatial–temporal dynamic graph (STDG) to capture all possible D2D opportunities in D2D-based traffic offloading. Based on STDG, we mathematically formulate an optimization problem of maximizing the offloading efficiency, subject to throughput requirement and buffer size constraint. The formulated problem is a linear-fractional problem and can be transformed into an equivalent linear program, whose solution reveals the maximum offloading ability that D2D achieves under QoS satisfaction. Trace-based simulations validate the superiority of our approach over three benchmark approaches. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) has been proposed as an alternative to orthogonal multiple access (OMA) in an effort to enhance the spectral efficiency of 5G cellular systems. However, the NOMA throughput gain relative to that of OMA has been shown to be modest. In this paper, we propose a novel NOMA scheme that exploits the partial overlap (i.e., similarity) among users bit sequences at the base station (BS). Specifically, users bit sequences are divided into blocks of short lengths, i.e., short bit sequences. Then, one user is selected and served during a given transmission time interval (TTI). Users whose bit sequences partially overlap with the bit sequence of the served user are also (partially) served during the same TTI. At the receiving end, the receiver corresponding to the served user recovers its entire bit sequence, whereas the partially served users recover their corresponding overlapping bit blocks and ignore the rest of the sequence. The performance of the proposed scheme is analyzed in terms of the overall throughput. We show that a throughput gain of up to three times that of existing OMA schemes can be achieved. Moreover, we show that the average rate per user decreases slightly as the number of users increases, whereas it linearly decreases with the number of users in existing NOMA schemes. We stress here that the proposed scheme completely differs from existing NOMA schemes as the latter schemes are based on power allocation at the BS where successive interference cancellation is normally used. The implication of this is that the proposed scheme provides substantial throughput gains without causing interference among users and without adopting a specific power allocation at the BS. [ABSTRACT FROM AUTHOR]

Covert wireless communications aim to hide the existence of transmission behavior from watchful adversaries to enhance security. In this paper, we propose a spectrum mask based covert communication strategy in Internet of Things (IoT) networks, where the overt channels are leveraged to enhance the covertness. Specifically, the legitimate IoT transmitter superimposes its own message on the overt channel to avoid being detected by the warden. We assume that proper Gaussian signaling (PGS) is adopted at the overt channel, and improper Gaussian signaling (IGS) is adopted at the legitimate transmitter to improve the covert transmission performance. To maximize the covert rate of the legitimate IoT system, a joint transmit power and IGS factor optimization problem is formulated under the constraints of covertness requirement. The metric of minimum error detection probability, that represents the worst-case for the legitimate transmitter, is utilized to measure the covertness. By exploiting the piece-wise monotonic properties of the objective function and the constraints, we derive the optimal transmit power and IGS factor pairs in both the IGS and PGS schemes. Finally, extensive numerical results are presented to demonstrate that the IGS scheme can improve the covert rate compared to the PGS scheme under a given covertness constraint. [ABSTRACT FROM AUTHOR]

Wireless transmissions are inherently vulnerable to jamming attacks. Frequency hopping (FH) and transmission rate adaptation (RA) have been separately used to mitigate jamming. When RA is used alone, it has been shown that a jammer who randomizes its power levels can force the transmitter to always operate at the lowest rate, by maintaining the average jamming power above a certain threshold. On the other hand, when only FH is used, a high throughput overhead is incurred due to frequent channel switching. In this paper, we propose to mitigate jamming by jointly optimizing the FH and RA techniques. This way, the transmitter can escape the jammer by changing its channel, adjusting its rate, or both. We consider a power-constrained “reactive-sweep” jammer who aims at degrading the throughput of the wireless link. The jammer sweeps through the set of channels, jamming a subset of them at a time, using the optimal jamming power. We model the interactions between the legitimate transmitter and jammer as a constrained zero-sum Markov game. The transmitter’s optimal defense strategy is derived by obtaining the equilibria of the constrained Markov game. This policy informs the transmitter when to hop to another channel and when to stay on the current channel. Furthermore, it gives the best transmission rate to use in both cases (hop or stay). The structure of the transmitter’s optimal policy is shown to be threshold type, whereby the transmitter stays on the same channel up to a certain number of time slots after which it hops. We analyze the “constrained Nash equilibrium” of the Markov game and show that the equilibrium defense strategy of the transmitter is deterministic. Numerical investigations show that the new scheme improves the average throughput and provides better jamming resiliency. [ABSTRACT FROM PUBLISHER]

Heterogeneous cellular networks (HetNets) are to be deployed for future wireless communications to meet the ever-increasing mobile traffic demand. However, the dense and random deployment of small cells and their uncoordinated operation raise important concerns about energy efficiency. On the other hand, discontinuous transmission (DTX) mode at the base station (BS) serves as an effective technology to improve energy efficiency of the overall system. In this paper, we investigate energy efficiency under a finite local delay constraint in the downlink HetNets with the random DTX scheme. Using a stochastic-geometry-based model, we derive the local delay and energy efficiency in a general case and obtain closed-form expressions in some special cases. These results give insights into the effect of key system parameters, such as path-loss exponents, BS densities, signal-to-interference-ratio (SIR) threshold, and mute probability on system performance. We also provide the low-rate and high-rate asymptotic behavior of the maximum energy efficiency. It is analytically shown that it is less energy efficient to apply the random DTX scheme in the low-rate regime. In the high-rate regime, however, a random DTX scheme is essential to achieve the finite local delay and higher energy efficiency. Finally, we extend the analysis to the load-aware DTX scheme, where the mute probability depends on the user activity level. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a spectrum refarming system where an OFDMA system shares the licensed band of a CDMA system. Both systems share the same cell site, but each has different base station (BS) antennas. Joint resource allocation problem is formulated to optimize the CDMA receive power, OFDMA transmit power, and subcarrier assignment. Conventional interference control to protect the primary CDMA system relies on the availability of cross-channel gains (CCGs) from each secondary OFDMA transmitter to the CDMA BS receiver. However, the CCGs are difficult to be obtained due to lack of intersystem cooperation. To address this problem, we first decouple the original problem into higher and lower-level problems via primal decomposition. Then, a robust lower-level resource allocation (R-LRA) scheme, which controls interference without using CCGs is proposed, with which CDMA users can be sufficiently protected. Thereafter, an enhanced R-LRA (ER-LRA) scheme is proposed to decrease the conservation of R-LRA scheme. Assisted by the CDMA inner power control and based on the ER-LRA, efficient algorithm is designed to solve the higher-level problem. Extensions of the ER-LRA for other scenarios are also studied. Simulation results are provided to validate the proposed schemes in facilitating and improving the spectrum sharing performance. [ABSTRACT FROM AUTHOR]

Coordinated multipoint (CoMP) is corroborated to be an effective technology in mitigating cochannel interference (CCI) and enhancing system performance in picocell systems, which consist of a large number of pico base stations (BSs). In picocell systems, effective CoMP clustering schemes could provide significant gains of system performance such as throughput and cell-edge spectrum efficiency (SE). Moreover, an intrinsic problem of densely deployed networks is the cost of signaling overhead and data exchange between BSs in clusters. In this paper, a novel semidynamic clustering scheme based on affinity propagation for CoMP-Pico is presented to maximize user SE and throughput under the constraint of backhaul cost. Our proposed scheme consists of online and offline stages that can achieve good performance and low complexity. Simulation results show that the proposed scheme yields significant gains of SE and throughput and low running time compared with the existing clustering schemes. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate multiuser scheduling with joint user pairing, resource allocation, and power control (PC) in Long-Term Evolution (LTE) uplink cellular networks. We first derive the received signal-to-interference-plus-noise ratio (SINR) in spatial multiuser single-carrier frequency-division multiple-access (SC-FDMA) systems with frequency-domain minimum mean square error (MMSE) equalization. Based on this, we formulate an optimization problem as joint multiuser pairing, resource allocation, and PC to maximize the weighted throughput of the system. We then divide it into a two-step optimization problem, which is suboptimal but significantly reduces the complexity. The two-step problem first performs optimal frequency resource allocation and user pairing for a given transmit power value and then adjusts the transmit power to maximize the weighted throughput when frequency resources are allocated and users are paired. With the help of high-interference indicators exchanged among multiple base stations (BSs), we develop an iterative distributed and low-complexity algorithm to further simplify the two-step problem. System-level simulation results show that the proposed algorithm can effectively mitigate interference and significantly outperforms the existing algorithms. [ABSTRACT FROM PUBLISHER]

Spectrum scarcity and intercell interference (ICI) are two fundamental limiting factors in wireless cellular systems. Soft frequency reuse (SFR) has been proposed as an effective way to manage the spectrum and reduce ICI in cellular systems. In a static SFR scheme, the allocations of transmit power or subcarriers in each cell are fixed prior to system deployment. This limits the potential performance of the SFR scheme. In this paper, we propose an intercell resource-allocation algorithm, which is referred to as the adaptive SFR algorithm (ASFR), that dynamically optimizes subcarrier and power allocations for multicell wireless networks to improve system capacity. The ASFR first finds the subcarrier and power allocations in each cell by using exhaustive search and greedy descend methods and then iteratively repeats among cells until a predefined convergence criterion is satisfied. The theoretical analysis proves the convergence of the ASFR algorithm. Simulation results show that the ASFR achieves a higher system throughput and better cell edge user performance than existing frequency reuse schemes. [ABSTRACT FROM PUBLISHER]

Wireless underground sensor networks (WUSNs) present a variety of new research challenges. Recently, a magnetoinductive (MI) waveguide technique has been proposed to cope with the very harsh propagation conditions in WUSNs. This relay-based approach allows for an extension of the transmission range, which can be quite limited if relays are not deployed. In this paper, tree-based WUSNs are considered. The objective of our work is to determine the optimal system parameters, topology, and deployment strategy in order to avoid bottlenecks in the system and achieve optimal network throughput. We compare two different deployment schemes: MI waveguides and direct MI transmission (no relays deployed) based connections between sensors. The two schemes are different in nature and propagation characteristics. Therefore, different optimization techniques are utilized. The optimal set of system parameters is chosen to maximize the channel capacity of the worst link and therefore optimize the available data rate. The bottleneck throughput of the direct MI transmission based network can be then compared with the respective results of the MI waveguides based network. In several cases, we observe a better performance of the direct MI transmission based networks. [ABSTRACT FROM AUTHOR]

This paper considers two possible approaches, which enable multiple pairs of users to exchange information via multiple multiantenna relays within one time-slot to save communication bandwidth in low-latency communications. The first approach is to deploy full-duplexes for both users and relays to make their simultaneous signal transmission and reception possible. In the second approach, the users use a fraction of a time slot to send their information to the relays and the relays use the remaining complementary fraction of the time slot to send the beamformed signals to the users. The inherent loop self-interference in the duplexes and inter-full-duplexing-user interference in the first approach are absent in the second approach. Under both these approaches, the joint design of the users’ power allocation and relays’ beamformers to either optimize the users’ exchange of information or maximize the energy-efficiency subject to user quality-of-service (QoS) constraints in terms of minimal rate thresholds leads to complex nonconvex optimization problems. Path-following algorithms are developed for their computational solutions. Numerical examples show the advantages of the second approach over the first approach. [ABSTRACT FROM AUTHOR]

This paper focuses on the design of provably efficient online link scheduling algorithms for multi-hop wireless networks. We consider single-hop traffic and the one-hop interference model. The objective is twofold: 1) maximizing the throughput when the flow sources continuously inject packets into the network, and 2) minimizing the evacuation time when there are no future packet arrivals. The prior work mostly employs the link-based approach, which leads to throughput-efficient algorithms but often does not guarantee satisfactory evacuation time performance. In this paper, we propose a novel Node-based Service-Balanced (NSB) online scheduling algorithm. NSB aims to give scheduling opportunities to heavily congested nodes in a balanced manner, by maximizing the total weight of the scheduled nodes in each scheduling cycle, where the weight of a node is determined by its workload and whether the node was scheduled in the previous scheduling cycle(s). We rigorously prove that NSB guarantees to achieve an efficiency ratio no worse (or no smaller) than $2/3$ for the throughput and an approximation ratio no worse (or no greater) than $3/2$ for the evacuation time. It is remarkable that NSB is both throughput-optimal and evacuation-time-optimal if the underlying network graph is bipartite. Further, we develop a lower-complexity NSB algorithm, called LC-NSB, which provides the same performance guarantees as NSB. Finally, we conduct numerical experiments to elucidate our theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we propose a non orthogonal multiple access (NOMA) system using coexisting narrow and wide beams to increase total capacity. In our proposed system, a base station considers the state of user mobility and supports users with either a narrow or a wide beam according to the mobility state. The proposed NOMA system uses the beam gain between a narrow and a wide beam, as well as the power gain from the pathloss difference in NOMA scheme. The system is thus less influenced by user mobility at the point of NOMA pairing. In the proposed system, we consider two power allocation schemes, namely the max and fair power allocation methods, and propose a pairing algorithm to maximize the capacity by minimizing the interference between narrow and wide beam user. The result verifies that the proposed system improves sum throughput, compared with the OMA and conventional NOMA system. [ABSTRACT FROM AUTHOR]

The mounting content sharing among users has resulted in a considerable rise in wireless data traffic, pressurizing the cellular networks to undergo a suitable upheaval. A competent technology of the fifth-generation (5G) networks for efficiently supporting proximity-based applications is device-to-device (D2D) communication, underlaying cellular networks. Significant advances have been made till date, for allocating resources to D2D users in cellular networks, such that sharing of spectral resources between cellular and D2D users is carried out in a coordinated manner. In this paper, a sector-based radio resource allocation (SBRRA) algorithm for resource block (RB) allocation to D2D pairs has been proposed, where the number of resource blocks (RBs) is allocated to each D2D pair in an adaptive manner, based on the demanded application by each pair. Different applications demand a varying number of RBs, in accordance with their priority. This algorithm focuses on the use of sectored antennas at the base station, for a better performance and low complexity. Extensive simulations are carried out, considering real-time scenario, for ensuring satisfactory quality of service (QoS) and quality of experience (QoE) by the users. The efficiency of the proposed scheme is proved by comparing it with the RB allocation using hidden Markov model. [ABSTRACT FROM AUTHOR]

Spectrum aggregation (SA) across heterogeneous channels, including both dedicated and shared channels, provides the potential for improving spectrum utilization and fulfilling the requirement of broadband services. Heterogeneous SA brings new technical challenges on multisystem coexistence on shared channels and the resource allocation over heterogeneous channels. In this paper, we develop an analytical framework for heterogeneous SA from a queue stability perspective. To make all systems on the shared channels stable, we design a resource allocation algorithm for the coexistence of multiple systems. Specifically, we derive the closed-form modified water-filling power control for the single-pair case by Lyapunov optimization and prove that it achieves the queue stability for all systems. Based on the results, we propose a low-complexity suboptimal resource allocation algorithm for multipair SA, which is a NP-hard problem. We partition user pairs into groups by using graph coloring and allocate the shared channels to pair groups according to the maximal weight bipartite matching model. The simulation results verify the queue stability and show that the proposed schemes outperform the conventional schemes. [ABSTRACT FROM PUBLISHER]

Interference neutralization (IN) is regarded as a promising interference management techniques for multi-hop wireless networks. Yet most existing results of IN are limited to two-hop networks such as the relay-aided cellular network. Little progress has been made so far in the exploration of IN in generic multi-hop (more than two hops) networks. This paper aims to bridge this gap by developing an optimization framework for IN in a generic multi-hop network with the objective of maximizing the end-to-end throughput of multiple coexisting communication sessions. We first derive a mathematical model for IN in a special one-hop network to characterize the capability of IN, and then generalize this model to a multi-hop network. Based on the IN model, we develop a cross-layer optimization framework for a multi-hop network with the objective of fully translating the benefits of IN to the end-to-end throughput of the multi-hop sessions. To evaluate the performance of IN in multi-hop networks, we compare its performance against the case where IN is not employed. Simulation results show that the use of IN can significantly (more than 50%) increase the session throughput and, more notably, the throughput gain of IN increases with the node density and traffic intensity in the network. [ABSTRACT FROM PUBLISHER]

A user-centric ultra-dense network (UUDN) is proposed as one of the promising solutions to provide very high area throughput density and flexible access service for users in the fifth-generation systems. On the one hand, network densification provides opportunities to cooperate among a large number of access points (APs) for serving a given user. On the other hand, the limited radio resources cause the serious competition among numerous APs and may degrade the network performance. Therefore, to support large number of connections and break through the restriction of limited frequency resource, non-orthogonal multiple access (NOMA), which supports multiple signals to transmit on the same frequency resource, is introduced into the UUDN. However, NOMA with network densification arises a series of challenges. And the method to group APs efficiently on the same frequency to support for a given user is a critical problem. Thus, in this paper, we propose a user-centric access framework for providing efficient access service and the flexible resource management in NOMA-based UUDN. Under the proposed framework, we then investigate the access scheme that organizes multiple APs into respective AP group (APG) cooperatively to provide access service for each user, aiming at maximizing the system energy efficiency. First, considering the users’ requirement and network environment, a grouping evaluation model is set up to organize APG efficiently. Then, we formulate the resource allocation problem of APG as a mix-integer non-linear programming problem, which is hard to tackle. For tractability purpose, we transform this problem and propose low-complexity algorithms based on matching and differ of convex programming theories to obtain a feasible solution. Extensive simulation results are presented to demonstrate the significant performance improvement compared with the existing schemes. [ABSTRACT FROM AUTHOR]

In this paper, we study the throughput and delay in wireless cognitive social networks. Specifically, we consider a common scenario for cognitive radio networks (CRNs) where the primary and secondary networks operate at the same time and space and share the spectrum. On this basis, we integrate a social relationship into the CRN where each source node selects its destination upon a rank-based model, which captures the social characteristic well. By applying a cellular time-division multiple-access scheduling scheme, we first characterize the distinct traffic pattern caused by the social relationships between nodes. Then, we derive the achievable throughput and delay for both primary and secondary networks under the new network setting. In addition, we also study the cognitive social networks with infrastructure where $l=o$ $(n)$ base stations are regularly deployed within the primary network. Given a probabilistic routing strategy, throughput of the proposed network is recalculated. Particularly, due to the social relationships between nodes, we reveal that a larger $l$ is required if we expect a significant capacity gain within the primary network compared with previous works. [ABSTRACT FROM PUBLISHER]

One of the key challenges in wireless networking is allocating the available radio resources to maximize key service delivery parameters such as the aggregate throughput and the multimedia quality of experience (QoE). We propose a novel and effective scheduling policy that allocates resource blocks, such that interference power is shifted toward capacity-saturated users, while improving the throughput of unsaturated users. The highlight of this paper is that the proposed scheme can dramatically improve the performance of cells that have a high discrepancy in its signal-to-noise ratio (SNR) distribution, which is typical in urban areas. The results show that a free-lunch (FL) solution is possible, whereby for negligible performance degradation in the saturated users, a large improvement in the nonsaturated users can be obtained. However, on average, the number of FL user pairings is low. By relaxing the degradation constraints, the non-FL (NFL) solution can yield a greater multiuser throughput gain. Motivated by a surge in mobile multimedia traffic, we further demonstrate that the proposed scheduling may have a profound impact on both energy efficiency and QoE of multimedia service delivery. [ABSTRACT FROM PUBLISHER]

Cooperative communications has received tremendous interests in wireless systems. The communication performance of a single source–destination pair can be enhanced via the help of relays in traditional cooperative communications. Recent advances in interference cancelation (IC) can further enhance the performance of parallel cooperative transmissions between multiple source–destination pairs. Although some works have been done on cooperative communications, most existing works are focused on link-level physical-layer issues. Consequently, the potential benefits of cooperative communications on network-level upper layer issues, such as topology control, are largely ignored in existing works. In this paper, we study the impacts of cooperative communications, particularly IC-based cooperative communications, on topology control in wireless ad hoc networks (WANETs). We propose a distributed cooperative topology control scheme with opportunistic IC (COIC) to improve network capacity in WANETs by jointly considering both upper layer network capacity and physical-layer cooperative communications with IC. We show that the benefits brought by cooperative communications are opportunistic, which rely on network structures and channel conditions. These opportunistic advantages have significant impacts on network capacity, and our proposed COIC can effectively capture these opportunities to substantially improve network capacity. [ABSTRACT FROM PUBLISHER]

Wireless mesh networks (WMNs) are emerging as a key solution to provide broadband and mobile wireless connectivity in a flexible and cost-effective way. In suburban areas, a common deployment model relies on orthogonal frequency division multiple access (OFDMA) communications between mesh routers (MRs), with one MR installed at each user premises. In this paper, we investigate a possible user cooperation path to implement strategic resource allocation in OFDMA WMNs, under the assumption that users want to control their interconnections. In this case, a novel strategic situation appears: How much an MR can demand, how much it can obtain, and how this shall depend on the interference with its neighbors. Strategic interference management and resource allocation mechanisms are needed to avoid performance degradation during congestion cases between MRs. In this paper, we model the problem as a bankruptcy game taking into account the interference between MRs. We identify possible solutions from cooperative game theory, namely the Shapley value and the nucleolus, and show through extensive simulations of realistic scenarios that they outperform two state-of-the-art OFDMA allocation schemes, namely, centralized-dynamic frequency planning, and frequency-ALOHA. In particular, the nucleolus solution offers best performance overall in terms of throughput and fairness, at a lower time complexity. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of a non-orthogonal multiple access (NOMA) network with simultaneous wireless information, and power transfer (SWIPT) based battery-assisted energy harvesting (EH) full-duplex relay (FDR). In each signalling interval, the base-station communicates directly to a near user (NU), and through an EH FDR to a far user (FU). Considering the power-splitting (PS) protocol with a non-linear EH model, we derive closed-form expressions for the NU, and FU outage probabilities. We also demonstrate how the battery energy, and PS parameter can be chosen to maximize the FU throughput while ensuring a desired NU throughput when there is imperfect interference cancellation at the NU. Computer simulation results validate the accuracy of the derived expressions, and demonstrate that augmenting the harvested energy with a small quantum of the relay's battery energy can considerably improve the FU performance. [ABSTRACT FROM AUTHOR]

Millimeter wave (mmWave) has been widely considered as a promising technology in the next generation wireless communication systems. Various beam-based directional transmission techniques have been proposed to compensate high pathloss caused by mmWave properties. However, mobility effect of users potentially causes severe inter-beam interferences, which has not been fully-investigated in existing studies. In this paper, we have analyzed different types of mobility-aware beam interference models. Additionally, the theoretical SINR is derived based on channel statistics and the trajectories of users. We propose a mobility-aware subband and beam resource allocation (MSBA) scheme for the mmWave subband-beam massive multi-input multi-output (SB-MMIMO) systems. The proposed MSBA benefits from reduced computation complexity for maximizing system throughput constrained by quality-of-service (QoS) demands of users. The first phase of MSBA scheme is responsible for resource block assignment; while the second phase allocates beamwidth and beam directions according to the analytical derivations. Numerical results show that the proposed MSBA scheme can effectively achieve the highest system throughput and the lowest complexity compared to existing schemes in open literatures. [ABSTRACT FROM AUTHOR]

In Long-Term Evolution (LTE) random access (RA) systems, upon an access failure, the user equipment not only performs a backoff to randomly spread the retransmission attempt over a certain time period but also increases the transmission power for the retransmission, which is called a power ramping (PR) scheme. This paper analyzes the RA performance of LTE-based two-tier small-cell networks, in which the PR scheme may be a source of uplink cross-tier interference to the macrocell and small cells. To reduce cross-tier interference, we propose a scheme for partial sharing (PS) of orthogonal random access preambles (RAPs), in which small cells are allowed to use a subset of RAPs, whereas the macrocell uses the whole set of RAPs. We compare the PS scheme with a full-sharing scheme, in which the entire set of RAPs is shared by the macrocell and small cells. Our study characterizes the RA performances of LTE-based two-tier small-cell networks in terms of throughput, access delay, mean power consumption, and RAP-dropping probability and shows the benefits of the PS scheme and its trade-off between throughput and access delay of small cells. [ABSTRACT FROM PUBLISHER]

In this paper, the problem of mode switching in multiple-input–multiple-output (MIMO) broadcast channels utilizing the Per-User Unitary Rate Control (PU2RC) transmission scheme is considered. Since there is no mathematical expression for the achievable rate of the PU2RC systems, it is proposed to approximate them using proper bounds. It is shown that certain simple feedback distributions will lead to tight bounds on the achievable rates of the PU2RC systems. The proposed bounds are used for the calculation of mode-switching points and maximization of the system rate under different multiplexing order conditions. The asymptotic behavior of the preferred modes is also studied under high-signal-to-noise-ratio (SNR) and low-SNR conditions, and it is shown that the single-user transmission mode is the preferred mode for both regimes. [ABSTRACT FROM PUBLISHER]