Nor Kamariah Noordin

Nor Kamariah Noordin

Auto-generated profile, based on publicly available information

Nor Kamariah Noordin

Universiti Putra Malaysia

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 March 2019 in Electronics
Verified
Journal Article
Open access
PDF file
AAAhmed Al-hubaishi
Ahmed Al-hubaishi
NNNor Kamariah Noordin
Nor Kamariah Noordin
ASADUWATI SALI
ADUWATI SALI
SSShamala Subramaniam
Shamala Subramaniam
Ali Mohammed Mansoor AlsahagAli Mohammed Mansoor Alsahag
Ali Mohammed Mansoor Alsahag
The reuse of the same pilot group across cells to address bandwidth limitations in a network has resulted in pilot contamination. This causes severe inter-cell interference at the targeted cell. Pilot contamination is associated with multicell massive multiple-input multiple-output (MIMO) systems which degrades the system performance even when extra arrays of antennas are added to the network. In this paper, we propose an efficient pilot assignment (EPA) scheme to address this issue by maximizing the minimum uplink rate of the target cell’s users. To achieve this, we exploit the large-scale characteristics of the fading channel to minimize the amount of outgoing inter-cell interference at the target cell. Results from the simulation show that the EPA scheme outperforms both the conventional and the smart pilot assignment (SPA) schemes by reducing the effect of inter-cell interference. These results, show that the EPA scheme has significantly improved the system performance in terms of achievable uplink rate and cumulative distribution function (CDF) for both signal-to-interference-plus-noise ratio (SINR), and uplink rate.

19 April 2015 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
MMMuayad Khalil Murtadha
Muayad Khalil Murtadha
NNNor Kamariah Noordin
Nor Kamariah Noordin
BABorhanuddin Ali
Borhanuddin Ali
FHFazirulhisyam Hashim
Fazirulhisyam Hashim

21 January 2015 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
MMMuayad Khalil Murtadha
Muayad Khalil Murtadha
NNNor Kamariah Noordin
Nor Kamariah Noordin
BABorhanuddin Ali
Borhanuddin Ali

10 December 2018 in Sensors
Verified
Journal Article
Open access
PDF file
AAAbdulmajid Al-Mqdashi
Abdulmajid Al-Mqdashi
ASADUWATI SALI
ADUWATI SALI
NNNor Kamariah Noordin
Nor Kamariah Noordin
SHShaiful Hashim
Shaiful Hashim
Rosdiadee NordinRosdiadee Nordin
Rosdiadee Nordin
Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics.