scispace - formally typeset
M

Manal El Tanab

Researcher at Concordia University

Publications -  10
Citations -  264

Manal El Tanab is an academic researcher from Concordia University. The author has contributed to research in topics: Cognitive radio & Overhead (computing). The author has an hindex of 6, co-authored 9 publications receiving 191 citations. Previous affiliations of Manal El Tanab include Concordia University Wisconsin & Cairo University.

Papers
More filters
Journal ArticleDOI

Resource Allocation for Underlay Cognitive Radio Networks: A Survey

TL;DR: A taxonomy that categorizes the RA algorithms proposed in literature based on the approaches, criteria, common techniques, and network architecture is provided and the state-of-the-art resource allocation algorithms are reviewed according to the provided taxonomy.
Journal ArticleDOI

Machine-to-Machine Communications With Massive Access: Congestion Control

TL;DR: This paper proposes an efficient scalable overload control algorithm that can achieve full resource utilization that leads to reduced: access delay, energy consumption, and blocking probability, and provides a method for estimating the number of backlogged devices in the network.
Proceedings ArticleDOI

On the Distributed Resource Allocation of MIMO Cognitive Radio Networks

TL;DR: A distributed resource allocation algorithm for an underlay multiple-input multiple-output (MIMO) cognitive radio network and two different antenna selection techniques to allow the secondary communication via a single radio frequency (RF) chain are proposed.
Journal ArticleDOI

Distributed opportunistic scheduling for MIMO underlay cognitive radio networks

TL;DR: The proposed algorithm is proved theoretically and using simulations, to give a performance very close to that of a centralized one with lower delay and overhead and to show that the tightness of the bounds improves with the diversity order.
Proceedings ArticleDOI

A scalable overload control algorithm for massive access in machine-to-machine networks

TL;DR: This paper introduces a distributed scalable algorithm that is able to efficiently allocate the available network resources to massive number of devices with bounded delay and reduced overhead and achieves full resource utilization.