Partially-Distributed Resource Allocation in Small-Cell Networks

We propose a four-stage hierarchical resource allocation scheme for the downlink of a large-scale small-cell network in the context of orthogonal frequency-division multiple access (OFDMA). Since interference limits the capabilities of such networks, resource allocation and interference management are crucial. However, obtaining the globally optimum resource allocation is exponentially complex and mathematically intractable. Here, we develop a partially decentralized algorithm to obtain an effective solution. The three major advantages of our work are: 1) as opposed to a fixed resource allocation, we consider load demand at each access point (AP) when allocating spectrum; 2) to prevent overloaded APs, our scheme is dynamic in the sense that as the users move from one AP to the other, so do the allocated resources, if necessary, and such considerations generally result in huge computational complexity, which brings us to the third advantage: 3) we tackle complexity by introducing a hierarchical scheme comprising four phases: user association, load estimation, interference management via graph coloring, and scheduling. We provide mathematical analysis for the first three steps modeling the user and AP locations as Poisson point processes. Finally, we provide results of numerical simulations to illustrate the efficacy of our scheme.Comment: Accepted on May 15, 2014 for publication in the IEEE Transactions on Wireless Communication

Approximations of the aggregated interference statistics for outage analysis in massive MTC

This paper presents several analytic closed-form approximations of the aggregated interference statistics within the framework of uplink massive machine-type-communications (mMTC), taking into account the random activity of the sensors. Given its discrete nature and the large number of devices involved, a continuous approximation based on the Gram–Charlier series expansion of a truncated Gaussian kernel is proposed. We use this approximation to derive an analytic closed-form expression for the outage probability, corresponding to the event of the signal-to-interference-and-noise ratio being below a detection threshold. This metric is useful since it can be used for evaluating the performance of mMTC systems. We analyze, as an illustrative application of the previous approximation, a scenario with several multi-antenna collector nodes, each equipped with a set of predefined spatial beams. We consider two setups, namely single- and multiple-resource, in reference to the number of resources that are allocated to each beam. A graph-based approach that minimizes the average outage probability, and that is based on the statistics approximation, is used as allocation strategy. Finally, we describe an access protocol where the resource identifiers are broadcast (distributed) through the beams. Numerical simulations prove the accuracy of the approximations and the benefits of the allocation strategy.Peer ReviewedPostprint (published version

Allocation of control and data channels for Large-Scale Wireless Sensor Networks

Both IEEE 802.15.4 and 802.15.4a standards allow for dynamic channel allocation and use of multiple channels available at their physical layers but its MAC protocols are designed only for single channel. Also, sensor's transceivers such as CC2420 provide multiple channels and as shown in [1], [2] and [3] channel switch latency of CC2420 transceiver is just about 200$\mu$s. In order to enhance both energy efficiency and to shorten end to end delay, we propose, in this report, a spectrum-efficient frequency allocation schemes that are able to statically assign control channels and dynamically reuse data channels for Personal Area Networks (PANs) inside a Large-Scale WSN based on UWB technology

Hierarchical Resource Allocation Framework for Hyper-Dense Small Cell Networks

This paper considers joint power control and subchannel allocation for co-tier interference mitigation in extremely dense small cell networks, which is formulated as a combinatorial optimization problem. Since it is intractable to obtain the globally optimum assignment policy for existing techniques due to the huge computation and communication overheads in ultra-dense scenario, in this paper, we propose a hierarchical resource allocation framework to achieve a desirable solution. Speci cally, the solution is obtained by dividing the original optimization problem into four stages in partially distributed manner. First, we propose a divide-and-conquer strategy by invoking clustering technique to decompose the dense network into smaller disjoint clusters. Then, within each cluster, one of the small cell access points is elected as a cluster head to carry out intra-cluster subchannel allocation with a low-complexity algorithm. To tackle the issue of inter-cluster interference, we further develop a distributed learning-base coordination mechanism. Moreover, a local power adjustment scheme is also presented to improve the system performance. Numerical results verify the ef ciency of the proposed hierarchical scheme, and demonstrate that our solution outperforms the state-of-the-art methods, especially for hyper-dense networks