arXiv subjects

Ekram Hossain

Publications and source records attributed to Ekram Hossain.

178 records · Page 10Linked to original sources

arXiv2014

Joint Downlink Cell Association and Bandwidth Allocation for Wireless Backhauling in Two-Tier HetNets with Large-Scale Antenna Arrays

The problem of joint downlink cell association (CA) and wireless backhaul bandwidth allocation (WBBA) in two-tier cellular heterogeneous networks (HetNets) is considered. Large-scale antenna array is implemented at the macro base station (BS), while the small cells within the macro cell range are single-antenna BSs and they rely on over-the-air links to the macro BS for backhauling. A sum logarithmic user rate maximization problem is investigated considering wireless backhauling constraints. A duplex and spectrum sharing scheme based on co-channel reverse time-division duplex (TDD) and dynamic soft frequency reuse (SFR) is proposed for interference management in two-tier HetNets with large-scale antenna arrays at the macro BS and wireless backhauling for small cells. Two in-band WBBA scenarios, namely, unified bandwidth allocation and per-small-cell bandwidth allocation scenarios, are investigated for joint CA-WBBA in the HetNet. A two-level hierarchical decomposition method for relaxed optimization is employed to solve the mixed-integer nonlinear program (MINLP). Solutions based on the General Algorithm Modeling System (GAMS) optimization solver and fast heuristics are also proposed for cell association in the per-small-cell WBBA scenario. It is shown that when all small cells have to use in-band wireless backhaul, the system load has more impact on both the sum log-rate and per-user rate performance than the number of small cells deployed within the macro cell range. The proposed joint CA-WBBA algorithms have an optimal load approximately equal to the size of the large-scale antenna array at the macro BS. The cell range expansion (CRE) strategy, which is an efficient cell association scheme for HetNets with perfect backhauling, is shown to be inefficient when in-band wireless backhauling for small cells comes into play.

cs.NI↗

arXiv2014

Social Behavior in Bacterial Nanonetworks: Challenges and Opportunities

Molecular communication promises to enable communication between nanomachines with a view to increasing their functionalities and open up new possible applications. Due to some of the biological properties, bacteria have been proposed as a possible information carrier for molecular communication, and the corresponding communication networks are known as \textit{bacterial nanonetworks}. The biological properties include the ability for bacteria to mobilize between locations and carry the information encoded in Deoxyribonucleic Acid (DNA) molecules. However, similar to most organisms, bacteria have complex social properties that govern their colony. These social characteristics enable the bacteria to evolve through various fluctuating environmental conditions by utilizing cooperative and non-cooperative behaviors. This article provides an overview of the different types of cooperative and non-cooperative social behavior of bacteria. The challenges (due to non-cooperation) and the opportunities (due to cooperation) these behaviors can bring to the reliability of communication in bacterial nanonetworks are also discussed. Finally, simulation results on the impact of bacterial cooperative social behavior on the end-to-end reliability of a single-link bacterial nanonetwork are presented. The article concludes with highlighting the potential future research opportunities in this emerging field.

cs.ET↗

arXiv2014

Location-Aware Cross-Tier Coordinated Multipoint Transmission in Two-Tier Cellular Networks

Multi-tier cellular networks are considered as an effective solution to enhance the coverage and data rate offered by cellular systems. In a multi-tier network, high power base stations (BSs) such as macro BSs are overlaid by lower power small cells such as femtocells and/or picocells. However, co-channel deployment of multiple tiers of BSs gives rise to the problem of cross-tier interference that significantly impacts the performance of wireless networks. Multicell cooperation techniques, such as coordinated multipoint (CoMP) transmission, have been proposed as a promising solution to mitigate the impact of the cross-tier interference in multi-tier networks. In this paper, we propose a novel scheme for Location-Aware Cross-Tier Cooperation (LA-CTC) between BSs in different tiers for downlink CoMP transmission in two-tier cellular networks. On one hand, the proposed scheme only uses CoMP transmission to enhance the performance of the users who suffer from high cross-tier interference due to the co-channel deployment of small cells such as picocells. On the other hand, users with good signal-to-interference-plus-noise ratio (${\rm SINR}$) conditions are served directly by a single BS from any of the two tiers. Thus, the data exchange between the cooperating BSs over the backhaul network can be reduced when compared to the traditional CoMP transmission scheme. We use tools from stochastic geometry to quantify the performance gains obtained by using the proposed scheme in terms of outage probability, achievable data rate, and load per BS. We compare the performance of the proposed scheme with that of other schemes in the literature such as the schemes which use cooperation to serve all users and schemes that use range expansion to offload users to the small cell tier.

cs.NI↗

arXiv2014

Distributed Resource Allocation in 5G Cellular Networks

The 5G cellular wireless systems will have a multi-tier architecture consisting of macrocells, different types of licensed small cells and D2D networks to serve users with different quality-of-service (QoS) requirements in a spectrum efficient manner. Distributed resource allocation and interference management is one of the fundamental research challenges for such multi-tier heterogeneous networks. In this chapter, we consider the radio resource allocation problem in a multi-tier orthogonal frequency division multiple access (OFDMA)-based cellular (e.g., 5G LTE-A) network. In particular, we present three novel approaches for distributed resource allocation in such networks utilizing the concepts of stable matching, factor-graph based message passing, and distributed auction. We illustrate each of the modeling schemes with respect to a practical radio resource allocation problem. In particular, we consider a multi-tier network consisting a macro base station (MBS), a set of small cell base stations (SBSs) and corresponding small cell user equipments (SUEs), as well as D2D user equipments (DUEs). There is a common set of radio resources (e.g., resource blocks [RBs]) available to the network tiers (e.g., MBS, SBSs and DUEs). The SUEs and DUEs use the available resources (e.g., RB and power level) in an underlay manner as long as the interference caused to the macro tier (e.g., macro user equipments [MUEs]) remains below a given threshold. Followed by a brief theoretical overview of the modeling tools (e.g., stable matching, message passing and auction algorithm), we present the distributed solution approaches for the resource allocation problem in the aforementioned network setup. We also provide a brief qualitative comparison in terms of various performance metrics such as complexity, convergence, algorithm overhead etc.

cs.NI↗

arXiv2014

Distributed Resource Allocation for Relay-Aided Device-to-Device Communication: A Message Passing Approach

Device-to-device (D2D) communication underlaying cellular wireless networks is a promising concept to improve user experience and resource utilization by allowing direct transmission between two cellular devices. In this paper, performance of network-assisted D2D communication is investigated where D2D traffic is carried through relay nodes. Considering a multi-user and multi-relay network, we propose a distributed solution for resource allocation with a view to maximizing network sum-rate. An optimization problem is formulated for radio resource allocation at the relays. The objective is to maximize end-to-end rate as well as satisfy the data rate requirements for cellular and D2D user equipments under total power constraint. Due to intractability of the resource allocation problem, we propose a solution approach using message passing technique where each user equipment sends and receives information messages to/from the relay node in an iterative manner with the goal of achieving an optimal allocation. Therefore, the computational effort is distributed among all the user equipments and the corresponding relay node. The convergence and optimality of the proposed scheme are proved and a possible distributed implementation of the scheme in practical LTE-Advanced networks is outlined. The numerical results show that there is a distance threshold beyond which relay-aided D2D communication significantly improves network performance with a small increase in end-to-end delay when compared to direct communication between D2D peers.

cs.NI↗

arXiv2014

Analytical Modeling of Mode Selection and Power Control for Underlay D2D Communication in Cellular Networks

Device-to-device (D2D) communication enables the user equipments (UEs) located in close proximity to bypass the cellular base stations (BSs) and directly connect to each other, and thereby, offload traffic from the cellular infrastructure. D2D communication can improve spatial frequency reuse and energy efficiency in cellular networks. This paper presents a comprehensive and tractable analytical framework for D2D-enabled uplink cellular networks with a flexible mode selection scheme along with truncated channel inversion power control. Different from the existing mode selection schemes where the decision on mode selection is made based only on the D2D link distance (i.e., distance between two UEs using D2D mode of communication), the proposed mode selection scheme for a UE accounts for both the D2D link distance and cellular link distance (i.e., distance between the UE and the BS). The developed framework is used to analyze and understand how the underlaying D2D communication affects the cellular network performance. Through comprehensive numerical analysis, we investigate the expected performance gains and provide guidelines for selecting the network parameters.

cs.NI↗

arXiv2014

Tier-Aware Resource Allocation in OFDMA Macrocell-Small Cell Networks

We present a joint sub-channel and power allocation framework for downlink transmission an orthogonal frequency-division multiple access (OFDMA)-based cellular network composed of a macrocell overlaid by small cells. In this framework, the resource allocation (RA) problems for both the macrocell and small cells are formulated as optimization problems. Numerical results confirm the performance gains of our proposed RA formulation for the macrocell over the traditional resource allocation based on minimizing the transmission power. Besides, it is shown that the formulation based on convex relaxation yields a similar behavior to the MINLP formulation. Also, the distributed solution converges to the same solution obtained by solving the corresponding convex optimization problem in a centralized fashion.

cs.NI↗

arXiv2014

Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication

Device-to-device (D2D) communication underlaying cellular networks allows mobile devices such as smartphones and tablets to use the licensed spectrum allocated to cellular services for direct peer-to-peer transmission. D2D communication can use either one-hop transmission (i.e., in D2D direct communication) or multi-hop cluster-based transmission (i.e., in D2D local area networks). The D2D devices can compete or cooperate with each other to reuse the radio resources in D2D networks. Therefore, resource allocation and access for D2D communication can be treated as games. The theories behind these games provide a variety of mathematical tools to effectively model and analyze the individual or group behaviors of D2D users. In addition, game models can provide distributed solutions to the resource allocation problems for D2D communication. The aim of this article is to demonstrate the applications of game-theoretic models to study the radio resource allocation issues in D2D communication. The article also outlines several key open research directions.

cs.NI↗

arXiv2014

Interference Statistics and Capacity Analysis for Uplink Transmission in Two-Tier Small Cell Networks: A Geometric Probability Approach

Small cell networks are evolving as an economically viable solution to ameliorate the capacity and coverage of state-of-the-art wireless cellular systems. Nonetheless, the dense and unplanned deployment of the small cells (e.g., femtocells, picocells) with restricted user access significantly increases the impact of interference on the overall network performance. To this end, this paper presents a novel framework to derive the statistics of the interference considering dedicated and shared spectrum access for uplink transmissions in two-tier small cell networks such as the macrocell-femtocell networks. The derived expressions are validated by the Monte-Carlo simulations. Numerical results are generated to assess the feasibility of shared and dedicated spectrum access in femtocells under varying traffic load and spectral reuse scenarios.

cs.IT↗

arXiv2014

Cellular Downlink Performance with Base Station Sleeping, User Association, and Scheduling

Base station (BS) sleeping has emerged as a viable solution to enhance the overall network energy efficiency by inactivating the underutilized BSs. However, it affects the performance of users in sleeping cells depending on their BS association criteria, their channel conditions towards the active BSs, and scheduling criteria and traffic loads at the active BSs. This paper characterizes the performance of cellular systems with BS sleeping by developing a systematic framework to derive the spectral efficiency and outage probability of downlink transmission to the sleeping cell users taking into account the aforementioned factors. In this context, we develop a user association scheme in which a typical user in a sleeping cell selects a BS with \textbf{M}aximum best-case \textbf{M}ean channel \textbf{A}ccess \textbf{P}robability (MMAP) which is calculated by all active BSs based on their existing traffic loads. We consider both greedy and round-robin schemes at active BSs for scheduling users in a channel. Once the association is performed, the exact access probability for a typical sleeping cell user and the statistics of its received signal and interference powers are derived to evaluate the spectral and energy efficiencies of transmission. For the sleeping cell users, we also consider the conventional \textbf{M}aximum \textbf{R}eceived \textbf{S}ignal \textbf{P}ower (MRSP)-based user association scheme along with greedy and round-robin schemes at the BSs. The impact of cell-zooming is incorporated in the derivations to analyze its feasibility in reducing the coverage holes created by BS sleeping. Numerical results show the trade-offs between spectral efficiency and energy efficiency in various network scenarios. The accuracy of the analysis is verified through Monte-Carlo simulations.

cs.NI↗

arXiv2014

Resource Allocation Under Channel Uncertainties for Relay-Aided Device-to-Device Communication Underlaying LTE-A Cellular Networks

Device-to-device (D2D) communication in cellular networks allows direct transmission between two cellular devices with local communication needs. Due to the increasing number of autonomous heterogeneous devices in future mobile networks, an efficient resource allocation scheme is required to maximize network throughput and achieve higher spectral efficiency. In this paper, performance of network-integrated D2D communication under channel uncertainties is investigated where D2D traffic is carried through relay nodes. Considering a multi-user and multi-relay network, we propose a robust distributed solution for resource allocation with a view to maximizing network sum-rate when the interference from other relay nodes and the link gains are uncertain. An optimization problem is formulated for allocating radio resources at the relays to maximize end-to-end rate as well as satisfy the quality-of-service (QoS) requirements for cellular and D2D user equipments under total power constraint. Each of the uncertain parameters is modeled by a bounded distance between its estimated and bounded values. We show that the robust problem is convex and a gradient-aided dual decomposition algorithm is applied to allocate radio resources in a distributed manner. Finally, to reduce the cost of robustness defined as the reduction of achievable sum-rate, we utilize the \textit{chance constraint approach} to achieve a trade-off between robustness and optimality. The numerical results show that there is a distance threshold beyond which relay-aided D2D communication significantly improves network performance when compared to direct communication between D2D peers.

cs.NI↗

arXiv2014

On Stochastic Geometry Modeling of Cellular Uplink Transmission with Truncated Channel Inversion Power Control

Using stochastic geometry, we develop a tractable uplink modeling paradigm for outage probability and spectral efficiency in both single and multi-tier cellular wireless networks. The analysis accounts for per user equipment (UE) power control as well as the maximum power limitations for UEs. More specifically, for interference mitigation and robust uplink communication, each UE is required to control its transmit power such that the average received signal power at its serving base station (BS) is equal to a certain threshold $ρ_o$. Due to the limited transmit power, the UEs employ a truncated channel inversion power control policy with a cutoff threshold of $ρ_o$. We show that there exists a transfer point in the uplink system performance that depends on the tuple: BS intensity ($λ$), maximum transmit power of UEs ($P_u$), and $ρ_o$. That is, when $P_u$ is a tight operational constraint with respect to [w.r.t.] $λ$ and $ρ_o$, the uplink outage probability and spectral efficiency highly depend on the values of $λ$ and $ρ_o$. In this case, there exists an optimal cutoff threshold $ρ^*_o$, which depends on the system parameters, that minimizes the outage probability. On the other hand, when $P_u$ is not a binding operational constraint w.r.t. $λ$ and $ρ_o$, the uplink outage probability and spectral efficiency become independent of $λ$ and $ρ_o$. We obtain approximate yet accurate simple expressions for outage probability and spectral efficiency which reduce to closed-forms in some special cases.

cs.IT↗

arXiv2014

Distributed and Centralized Hybrid CSMA/CA-TDMA Schemes for Single-Hop Wireless Networks

The strength of carrier-sense multiple access with collision avoidance (CSMA/CA) can be combined with that of time-division multiple access (TDMA) to enhance the channel access performance in wireless networks such as the IEEE 802.15.4-based wireless personal area networks (WPANs). In particular, the performance of legacy CSMA/CA-based medium access control (MAC) scheme in congested networks can be enhanced through a hybrid CSMA/CA-TDMA scheme while preserving the scalability property. In this paper, we present distributed and centralized channel access models which follow the transmission strategies based on Markov decision process (MDP) to access both contention period and contention-free period in an intelligent way. The models consider the buffer status as an indication of congestion provided that the offered traffic does not exceed the channel capacity. We extend the models to consider the hidden node collision problem encountered due to the signal attenuation caused by channel fading. The simulation results show that the MDP-based distributed channel access scheme outperforms the legacy slotted CSMA/CA scheme. This scheme also works efficiently in a network consisting of heterogeneous nodes. The centralized model outperforms the distributed model but requires the global information of the network.

cs.NI↗

arXiv2013

Resource Allocation for Network-Integrated Device-to-Device Communications Using Smart Relays

With increasing number of autonomous heterogeneous devices in future mobile networks, an efficient resource allocation scheme is required to maximize network throughput and achieve higher spectral efficiency. In this paper, performance of network-integrated device-to-device (D2D) communication is investigated where D2D traffic is carried through relay nodes. An optimization problem is formulated for allocating radio resources to maximize end-to-end rate as well as conversing QoS requirements for cellular and D2D user equipment under total power constraint. Numerical results show that there is a distance threshold beyond which relay-assisted D2D communication significantly improves network performance when compared to direct communication between D2D peers.

cs.NI↗

arXiv2010

Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks

Vehicle-to-roadside (V2R) communications enable vehicular networks to support a wide range of applications for enhancing the efficiency of road transportation. While existing work focused on non-cooperative techniques for V2R communications between vehicles and roadside units (RSUs), this paper investigates novel cooperative strategies among the RSUs in a vehicular network. We propose a scheme whereby, through cooperation, the RSUs in a vehicular network can coordinate the classes of data being transmitted through V2R communications links to the vehicles. This scheme improves the diversity of the information circulating in the network while exploiting the underlying content-sharing vehicle-to-vehicle communication network. We model the problem as a coalition formation game with transferable utility and we propose an algorithm for forming coalitions among the RSUs. For coalition formation, each RSU can take an individual decision to join or leave a coalition, depending on its utility which accounts for the generated revenues and the costs for coalition coordination. We show that the RSUs can self-organize into a Nash-stable partition and adapt this partition to environmental changes. Simulation results show that, depending on different scenarios, coalition formation presents a performance improvement, in terms of the average payoff per RSU, ranging between 20.5% and 33.2%, relative to the non-cooperative case.

cs.IT↗

arXiv2010

Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks

Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio (CR). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ability of checking complete spectrum usage. Due to hardware limitations, each cognitive radio node can only sense a relatively narrow band of radio spectrum. Consequently, the available channel sensing information is far from being sufficient for precisely recognizing the wide range of unoccupied channels. Aiming at breaking this bottleneck, we propose to apply matrix completion and joint sparsity recovery to reduce sensing and transmitting requirements and improve sensing results. Specifically, equipped with a frequency selective filter, each cognitive radio node senses linear combinations of multiple channel information and reports them to the fusion center, where occupied channels are then decoded from the reports by using novel matrix completion and joint sparsity recovery algorithms. As a result, the number of reports sent from the CRs to the fusion center is significantly reduced. We propose two decoding approaches, one based on matrix completion and the other based on joint sparsity recovery, both of which allow exact recovery from incomplete reports. The numerical results validate the effectiveness and robustness of our approaches. In particular, in small-scale networks, the matrix completion approach achieves exact channel detection with a number of samples no more than 50% of the number of channels in the network, while joint sparsity recovery achieves similar performance in large-scale networks.

cs.IT↗