Analysis of outage probability for in‐band device‐to‐device communications underlaying cellular network

One of the key strategies for jointly increasing throughput and optimum resource allocation in 5G is device‐to‐device (D2D) communications, which can be obtained by minimizing the outage probability considered as an objective function of optimization problem. To minimize this objective function, we found that outage probability should be modeled by jointly considering the effect of interference, noise, and multipath phenomena. In this paper, the exact formulas for outage probability of in‐band D2D communications underlying cellular network are proposed. In the proposed model, additive white Gaussian noise and Rayleigh multipath fading are considered into 2 radio resource reuse scenarios. In the first scenario, each D2D pair is allowed to reuse radio resource block of one cellular user, whereas in the second scenario, 2 resources of 2 cellular users can be reused. The proposed formulas are compared to the approximate (nonexact) ones, which models additive white Gaussian noise by a constant variance. The numerical analysis for the first and second scenarios show that the approximate formulas and respected exact ones are in accordance with simulation results in MATLAB. Moreover, based on nonorthogonal multiple access approach, 2 approximations for the nonexact and the proposed formulas are extracted, which are acceptable for multiple resource reuse scenario. As a remarkable result, simulation results show that when the distance of the D2D pair from the respected cellular user is more than 71 m (2 times greater than average distance between the D2D nodes), multiple‐reuse scenarios offer higher throughput compared to 1‐reuse scenario in an acceptable outage probability.     

Performance analysis of a reuse partitioning technique for multi‐channel cellular systems supporting elastic services

For multi‐cell systems employing intra‐cell orthogonal communication channels, inter‐cell interference mitigation techniques are expected to be one of the key radio resource management functions. In this paper we propose and analyze a simple reuse partitioning technique (with random and coordinated resource block allocation in neighbor cells) that is able to reduce inter‐cell interference. We propose a model that is able to take into account that sessions dynamically enter and leave the system. Rigid sessions require a class‐specific fixed number of resource blocks, while elastic sessions can enter the system if a minimum number of resources are allocated to them. In this rather general setting (and using the example of a system employing frequency division for multiple access) we analyze the system performance in terms of the expected number of channel collisions, the session‐blocking probabilities, the signal‐to‐interference‐and‐noise ratio (SINR) and packet error rate performance. We present numerical results on the various trade‐offs between these measures (including the trade‐off between the reuse factor and the SINR performance) that provide insight into the behavior of multi‐channel cellular systems and help dimensionalize the parameters of a reuse partitioned system. Copyright © 2008 John Wiley & Sons, Ltd.     

Resource allocation strategies for full frequency reuse in tri‐sectorized multi‐cell orthogonal frequency division multiple access systems

In this paper, we propose several frequency reuse coordination schemes for interference management in orthogonal frequency division multiple access. The aim of these schemes, working together with time and frequency domain packet scheduling, is to achieve reuse of 1 at sector level in a tri‐sectorized base station scenario. Inter‐sector interference is strong at the frontier between sectors, and a tight coordination scheme needs be applied. To support this coordination scheme, the users' location information is then essential to determine if a user is prone to suffer strong inter‐sector interference. The performance of these resource allocation algorithms is compared with schemes based on fractional frequency reuse, where reuse of 1 at cell level is assumed. Copyright © 2012 John Wiley & Sons, Ltd.     

Adaptive modulation and decision feedback equalization for frequency‐selective MIMO channels

In this paper, an adaptive modulation scheme for the multiple‐input multiple‐output (MIMO) frequency‐selective channels is investigated. We consider a scenario with precoded block‐based transceivers over spatially correlated Rayleigh multipath MIMO channels. To eliminate the inter‐block interference, the zero‐padding is used. The receiver is equipped with a MIMO minimum‐mean‐squared‐error decision feedback equalizer. The precoder aims to force each subchannel to have an identical signal‐to‐interference‐plus‐noise ratio (SINR). To adjust the constellation size, the unbiased mean square error at the equalizer output is sent back to the transmitter. To simplify our analysis, the feedback channel is considered as instantaneous and error free. We first derive the probability density function of the overall SINR for flat fading and frequency‐selective channels. On the basis of the probability density function of the upper bound of the SINR, we evaluate the system performance. We present accurate closed‐form expressions of the average spectral efficiency, the average bit error rate and the outage probability. The derived expressions are compared with Monte Carlo simulation results. Furthermore, we analyze the effect of the channel spatial correlation. Copyright © 2013 John Wiley & Sons, Ltd.     

Dynamic resource allocation for Device‐to‐Device communication underlaying cellular networks

Future cellular networks such as IMT‐Advanced are expected to allow underlaying direct Device‐to‐Device (D2D) communication for spectrum efficiency. However, enabling D2D communication in a cellular network presents a challenge in resource allocation because of the potentially severe interference it may cause to the cellular network by reusing the spectrum with the cellular users. In this paper, we analyze the resource allocation problem in a single cell system when both cellular users and D2D users are present in the system. We first consider the scenario where cellular users and D2D users are allocated resource independently and propose an optimal algorithm and a heuristic algorithm, and then extend the methods to the scenario where cellular users and D2D users are allocated resource jointly. The number of permitted D2D pairs is selected as a performance measure because it is a more specific performance measure than spectrum efficiency. The proposed schemes maximize the number of permitted D2D communication pairs in a system meanwhile avoiding the strong interference from D2D links to the cellular links. Finally, the performance of the proposed methods is evaluated through the numerical simulation. The simulation results show that the proposed methods enhance the number of permitted D2D communication pairs significantly and that the performance of the proposed scheme for jointly allocation scenario is better than that of the proposed scheme for independently allocation scenario. Copyright © 2012 John Wiley & Sons, Ltd.     

Dynamic fractional frequency reuse (D‐FFR) for multicell OFDMA networks using a graph framework

A graph‐based framework is proposed in this paper to implement dynamic fractional frequency reuse (D‐FFR) in a multicell Orthogonal Frequency Division Multiple Access (OFDMA) network. FFR is a promising resource‐allocation technique that can effectively mitigate intercell interference (ICI) in OFDMA networks. The proposed D‐FFR scheme enhances the conventional FFR by enabling adaptive spectral sharing as per cell‐load conditions. Such adaptation has significant benefits in practical systems where traffic loads in different cells are usually unequal and time‐varying. The dynamic adaptation is accomplished via a graph framework in which the resource‐allocation problem is solved in two phases: (1) constructing an interference graph that matches the specific realization of FFR and the network topology and (2) coloring the graph by use of a heuristic algorithm. Various realizations of FFR can easily be incorporated in the framework by manipulating the first phase. The performance improvement enabled by the proposed D‐FFR scheme is demonstrated by computer simulation for a 19‐cell network with equal and unequal cell loads. In the unequal‐load scenario, the proposed D‐FFR scheme offers significant performance improvement in terms of cell throughput and service rate as compared to conventional FFR and previous interference management schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

A novel MAC protocol for IDMA‐based multi‐beam satellite communication systems

Considering the limitations of satellite communication systems and advantages of new emerging interleave‐division multiple access (IDMA) technology, IDMA is introduced into the satellite systems, providing a new solution for multiple access techniques of satellite systems. To further validate the IDMA into satellite systems, a novel medium access control (MAC) scheme is proposed. In the random access channel, the interleave‐division slotted ALOHA method is adopted to alleviate the collision of access requests. Furthermore, a novel minimum power allocation scheme based on signal‐to‐interference‐plus‐noise ratio (SINR) evolution is proposed to maximize the capacity of such an interference‐sensitive system. By virtue of SINR evolution, our proposed scheme can accurately estimate multi‐user detection efficiency with low computational cost and further reduce the transmitted power, illustrating the high power efficiency of IDMA. To further enhance the performance of the MAC protocol, an effective call admission control scheme considering the effect of power control error is designed and combined into our MAC protocol. Analysis and simulation results show that, by taking full advantage of the chip‐by‐chip multi‐user detection technique, the proposed IDMA MAC protocol achieves high throughput and low average packet delay simultaneously, with low onboard processing complexity in the multi‐beam satellite communication systems. Copyright © 2013 John Wiley & Sons, Ltd.     

Interference‐aware MAC scheduling and admission control for multiple mobile WBANs used in healthcare monitoring

In this paper, we address the problem of interference when multiple time division multiple access‐based wireless body area networks (WBANs) come in the proximity of one another. We propose a simple solution that creates common non‐conflicting schedule between these interfering WBANs. Our proposed scheme allows the reuse of maximum possible time slots among WBANs that are two‐hop neighbors of one another. A flow admission control scheme is applied to control the flows during the period of interference. We show that the percentage of flows admitted because of flow control decreases with the increase in the network size and flow rate. We simulated a scenario where WBANs move randomly within a simulation area with a certain speed and meet at a particular point. We show that the signal to interference noise ratio (SINR) value of WBANs changes as long as they are within the transmission range of one another. Also, we show that the exchanges of common schedule (which is dependent on the number of times the SINR value drops below the threshold) are required in order to improve the packet delivery ratio in WBANs. Copyright © 2014 John Wiley & Sons, Ltd.     

Distributed key management scheme for peer‐to‐peer live streaming services

Live media streaming over peer‐to‐peer (P2P) network structures is commonplace nowadays. However, with the large number of users in a typical P2P system, it is impractical to use the central server to process the key information update requests of all the users Accordingly, the present study proposes a distributed key management scheme in which the server is only required to transmit the key update information to a limited number of users. To further reduce the load on the server, the update information is distributed using a hop‐by‐hop approach. An effective method is proposed for protecting the key update information as it is propagated through the network. In addition, a technique is presented for ensuring the security of the certificates used in the system It is shown that the distributed key management scheme and authentication procedure ensure an efficient and secure P2P live streaming performance even in the event of high churn rates. Copyright © 2012 John Wiley & Sons, Ltd.     

A coordinated multi‐point‐based quality of service provision resource allocation scheme with inter‐cell interference mitigation

The paper investigates resource allocation via power control for inter‐cell interference (ICI) mitigation in an orthogonal frequency division multiple access‐based cellular network. The proposed scheme is featured by a novel subcarrier assignment mechanism at a central controller for ICI, which is further incorporated with an intelligent power control scheme. We formulate the system optimization task into a constrained optimization problem for maximizing accepted users' requirements. To improve the computation efficiency, a fast yet effective heuristic approach is introduced for divide and conquer. Simulation results demonstrate that the proposed resource allocation scheme can significantly improve the network capacity compared with a common approach by frequency reuse. Copyright © 2014 John Wiley & Sons, Ltd.     

Spatial Reuse Algorithm Using Interference Graph in Millimeter Wave Beamforming Systems

This paper proposes a graph‐theatrical approach to optimize spatial reuse by adopting a technique that quantizes the channel information into single bit sub‐messages. First, we introduce an interference graph to model the network topology. Based on the interference graph, the computational requirements of the algorithm that computes the optimal spatial reuse factor of each user are reduced to quasilinear time complexity, ideal for practical implementation. We perform a resource allocation procedure that can maximize the efficiency of spatial reuse. The proposed spatial reuse scheme provides advantages in beamforming systems, where in the interference with neighbor nodes can be mitigated by using directional beams. Based on results of system level measurements performed to illustrate the physical interference from practical millimeter wave wireless links, we conclude that the potential of the proposed algorithm is both feasible and promising.     

Exploring the accuracy of capturing snapshots in large‐scale P2P IPTV systems

With the growing maturity of peer‐to‐peer (P2P) technology, Internet protocol television (IPTV) applications based on that gained great success commercially and have attracted more and more attentions from both industry and academia. Currently, the active measurement method based on crawler technology is the most popular and effective one to study P2P IPTV systems. Existing measurement results revealed that accuracy of captured overlay snapshots depends on the crawling speed of crawler system. In order to capture more accurate overlay snapshots of P2P IPTV system, we developed a very fast and efficient distributed crawler system using the distributed architecture and peer degree‐rank mechanism. In this paper, we first introduce the architectures of PPTV channel‐list resource distribution and the whole system, which is the most popular and largest instance of P2P IPTV applications nowadays. Subsequently, this paper evaluates the crawling results of two dedicated crawlers capturing from peer‐list servers and ordinary peers, respectively. Finally, we propose a fast and accurate dedicated crawler system based on distributed architecture and peer degree rank for PPTV. The experiment results show that the performance of our distributed crawler system is much better than other existing crawler systems. Specifically, our distributed crawler can track a very popular channel with about 7200 online users in 30 s. It is also reasonable to believe that our distributed crawler system can capture complete overlay snapshots. To the best of our knowledge, our study work is the first to explore capturing accurate overlay snapshots of large‐scale P2P IPTV applications. Our crawler system can provide a good solution for capturing more accurate overlay snapshots of PPTV system and can also be used to help researchers to design crawler systems for other P2P IPTV systems. Copyright © 2015 John Wiley & Sons, Ltd.     

A self‐organized resource allocation scheme for heterogeneous macro‐femto networks

This paper investigates the radio resource management (RRM) issues in a heterogeneous macro‐femto network. The objective of femto deployment is to improve coverage, capacity, and experienced quality of service of indoor users. The location and density of user‐deployed femtos is not known a‐priori. This makes interference management crucial. In particular, with co‐channel allocation (to improve resource utilization efficiency), RRM becomes involved because of both cross‐layer and co‐layer interference. In this paper, we review the resource allocation strategies available in the literature for heterogeneous macro‐femto network. Then, we propose a self‐organized resource allocation (SO‐RA) scheme for an orthogonal frequency division multiple access based macro‐femto network to mitigate co‐layer interference in the downlink transmission. We compare its performance with the existing schemes like Reuse‐1, adaptive frequency reuse (AFR), and AFR with power control (one of our proposed modification to AFR approach) in terms of 10 percentile user throughput and fairness to femto users. The performance of AFR with power control scheme matches closely with Reuse‐1, while the SO‐RA scheme achieves improved throughput and fairness performance. SO‐RA scheme ensures minimum throughput guarantee to all femto users and exhibits better performance than the existing state‐of‐the‐art resource allocation schemes.Copyright © 2014 John Wiley & Sons, Ltd.     

Combined code reuse scheme with two‐dimensional OVSF codes assignment algorithm for uplink multi‐user/multi‐rate block spread multi‐cellular CDMA

The two‐dimensional (2D) block spread code division multiple access (CDMA) can avoid the uplink multiple‐access interference with low‐complexity single‐user detection in a slow fading channel and, therefore, is very attractive. In the 2D spreading, orthogonal variable spreading factor (OVSF) is used for spreading; an important problem is how to efficiently assign the limited resource of OVSF codes to users with different data rates, while meeting the requirement of quality of service in a multi‐cell environment. In this paper, it is shown that the code reuse can improve the code reuse efficiency and the proposed code reuse scheme combined with code assignment algorithm can allow flexible multi‐rate uplink transmission. The computer simulation confirms that the proposed code assignment algorithm improves the code reuse efficiency while achieving lower blocking probability than traditional CDMA. Copyright © 2012 John Wiley & Sons, Ltd.     

A group strategy‐proof incentive approach for eliminating selfish behaviors in peer‐to‐peer file allocation

In this paper, we formulate and solve the selfish allocation problem by using game theory, which is different from the previously studied researches in three ways that make it more accurately reflective of real world peer‐to‐peer (P2P) allocation: (i) we treat the nodes as strategic agents and treat the replica allocation as a deliberate auction where node is incentivized to give his true quality of service for obtaining the replica; (ii) our mechanism computes node utility for all possible replica destination and payments for those destination nodes, and the best appropriate node can be selected as the final placement destination; and (iii) we show how to carry out our scheme with a distributed algorithm that is a straightforward extension to P2P allocation method and causes an overhead in convergence time. Our design and analysis of a strategy proof, feasible, Vickrey–Clarke–Groves‐based auction scheme provides a new, promising direction in distributed algorithmic mechanism design, which has heretofore been focused mainly on P2P application. Copyright © 2013 John Wiley & Sons, Ltd.     

R‐11‐based power control approach for overlaid femtocell networks

Short range, low power, plug‐and‐play femtocell has carved a niche for itself because of its potential for higher rate indoor voice and data service, coverage enhancement over cell edges, high network capacity, and negligible greenhouse gas emission. The frequency reuse phenomenon in two‐tier cellular network subjects the cell‐edge macrouser to severe downlink interference from co‐channel deployed femtocells in the same province. Downlink power control approach is a recommended remedy to overcome such type of interferences. This paper proposes release‐11‐based maximum downlink power control (R‐11‐based MDPC) approach to protect macrouser's service from co‐channel interference. The feedback strategy incorporated in this paper is formulated by R‐11 of 3rd Generation Partnership Program for Long Term Evolution standard. Implementation of new R‐11‐based feedback strategy between femto‐base station and macro‐base station with MDPC approach ensures instantaneous power control with minimal feedback delay, higher signal‐to‐interference‐plus‐noise ratio (SINR), simple receiver module design, and better service availability. Simulation results of R‐11‐based MDPC approach clearly indicate reduced feedback delay, better power control with minimal interference, improved SINR, and negligible outage probability. Copyright © 2015 John Wiley & Sons, Ltd.     

Mitigating file‐sharing misbehavior with movement synchronization to increase end‐to‐end availability for delay sensitive streams in vehicular P2P devices

When dealing with wireless connectivity in a mobile peer‐to‐peer (MP2P) environment, there are many concerns about the offered efficiency and availability of the requested resources and concerns about practicality considerations. These considerations deal with the movement and deployment of continuous connectivity. The intermittent connectivity is a major factor for object sharing misbehavior because it aggravates the connectivity and reliability. MP2P environments are in need of specialized placement algorithms where structured index‐centric solutions will be able to provide efficiency and object location determination over intermittent connectivity and communication. Replication of any requested object and redundancy face the requests' failures because they create severe duplications, and aggravate the capacity of the end‐to‐end path. This work proposes a framework that enables mitigation between the file sharing misbehavior in contrast to the movement synchronization, and it quantifies the parameters that affect the end‐to‐end efficient transmission by taking into consideration the synchronization between moving peers to assign the requested resources in the end‐to‐end path. Resilience metrics are introduced to enable reliability in cooperative file sharing procedure. The proposed scheme considers synchronization and assignment of the moving mobile Infostation peer with certain object indices to a certain vehicle via a synchronized cooperative scheme where the file sharing process is performed through the message ferry mobile peer. In addition, a resource assignment cooperation engine is developed taking into consideration the social cooperation model and the end‐to‐end capacity of the relay path. The proposed resource exchange apparatus for file chunks' migration is performed to enable delay sensitive streaming. The proposed model is evaluated through experimental simulation taking measures for the throughput and the reliability offered and for the robustness for sharing resources of any capacity in dynamically changing MP2P wireless environments under synchronized movements. Copyright © 2012 John Wiley & Sons, Ltd.     

A tractable analytical model for interference characterization and minimum distance enforcement to reuse resources in three‐dimensional in‐building dense small cell networks

In this paper, we address mainly 2 important issues, namely, characterizing co‐channel interference and enforcing a minimum distance between femtocell base stations (FCBSs) for reusing resources in FCBSs deployed in a 3‐dimentional multi‐floor building. Each floor is modeled as a group of square‐grid apartments, with one FCBS per apartment. We propose a simple yet reasonable analytical model by using planar‐Wyner model for intra‐floor interference and linear‐Wyner model for inter‐floor interference modeling in a 3‐dimensional multi‐floor building to derive a minimum distance between co‐channel FCBSs for optimization constraints, namely, link level interference, spectral efficiency, and capacity. As opposed to orthogonal resource reuse and allocation (ORRA) where resources are reused once, using the proposed model, we develop 2 strategies for reusing resources more than once, that is, non‐ORRA, within a multi‐floor building. An algorithm of the proposed model is developed by including an application of the model to an ultra‐dense deployment of multi‐floor buildings. With an extensive numerical analysis and system level simulation, we demonstrate the capacity outperformance of non‐ORRA over ORRA by manifold. Further, with a fairly accurate yet realistic estimation, we show that the expected spectral efficiency of fifth‐generation networks can be achieved by applying the proposed model to an ultra‐dense deployment of FCBSs.     

The performance evaluation of spatial–temporal algorithms in W‐CDMA systems

Differing from FDMA, TDMA, and CDMA, space division multiple access (SDMA) uses space resources to improve communication system performance. Utilizing the smart antenna system is an approach to realize the SDMA technique. Smart antenna systems using the beamforming technique can reduce the co‐channel interference and multipath fading to increase the channel capacity and communication quality. In this study the smart antenna system and rake receiver are integrated. The performance of spatial–temporal structure applied to the W‐CDMA system is evaluated. From the cumulative distribution function simulation results, W‐CDMA system with spatial–temporal algorithm can exactly provide SINR gain to improve the system performance and capacity. Copyright © 2005 John Wiley & Sons, Ltd.     

Interference‐aware spectrum handover for cognitive radio networks

Cognitive radio (CR) is a promising technique for future wireless networks, which significantly improves spectrum utilization. In CR networks, when the primary users (PUs) appear, the secondary users (SUs) have to switch to other available channels to avoid the interference to PUs. However, in the multi‐SU scenario, it is still a challenging problem to make an optimal decision on spectrum handover because of the the accumulated interference constraint of PUs and SUs. In this paper, we propose an interference‐aware spectrum handover scheme that aims to maximize the CR network capacity and minimize the spectrum handover overhead by coordinating SUs’ handover decision optimally in the PU–SU coexisted CR networks. On the basis of the interference temperature model, the spectrum handover problem is formulated as a constrained optimization problem, which is in general a non‐deterministic polynomial‐time hard problem. To address the problem in a feasible way, we design a heuristic algorithm by using the technique of Branch and Bound. Finally, we combine our spectrum handover scheme with power control and give a convenient solution in a single‐SU scenario. Experimental results show that our algorithm can improve the network performance efficiently.Copyright © 2012 John Wiley & Sons, Ltd.