Nor Kamariah Noordin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nor Kamariah Noordin has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Aduwati Sali
Department of Computer and Communication Systems Engineering, Faculty of Engineering, WiPNET Research Centre, Universiti Putra Malaysia (UPM), Serdang, Selangor, Malaysia
2 shared publications - Borhanuddin Mohd Ali
Universiti Putra Malaysia
2 shared publications - Muayad Khalil Murtadha
Universiti Putra Malaysia
2 shared publications - AbdulMajid Al-Mqdashi
Faculty of Computer Science and Information Systems, Thamar University, Dhamar 87246, Yemen
1 shared publication - Ahmed S. Al-Hubaishi
Department of Computer and Communication Engineering, Universiti Putra Malaysia (UPM), Serdang 43400, Malaysia
1 shared publication - Ali Mohammed Mansoor
Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands
1 shared publication
Latest Publications
- Open Access
- 27 March 2019
- Published by MDPI AG in Electronics
- Vol. 8 (4) , 372
An Efficient Pilot Assignment Scheme for Addressing Pilot Contamination in Multicell Massive MIMO Systems
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.
- 27 March 2019
- Published by MDPI AG in Electronics
- Vol. 8 (4) , 372
Open AccessAn Efficient Pilot Assignment Scheme for Addressing Pilot Contamination in Multicell Massive MIMO Systems
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.
- Open Access
Efficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks
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.
Open AccessEfficient Matrix-Based Channel Hopping Schemes for Blind Rendezvous in Distributed Cognitive Radio Networks
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.
- 19 April 2015
- Published by Springer Nature in Wireless Networks
- Vol. 21 (8) , 2747-2763
Design and evaluation of distributed and dynamic mobility management approach based on PMIPv6 and MIH protocols
- 19 April 2015
- Published by Springer Nature in Wireless Networks
- Vol. 21 (8) , 2747-2763
Design and evaluation of distributed and dynamic mobility management approach based on PMIPv6 and MIH protocols
- 21 January 2015
- Published by Springer Nature in Wireless Personal Communications
- Vol. 82 (3) , 1351-1376
Survey and Analysis of Integrating PMIPv6 and MIH Mobility Management Approaches for Heterogeneous Wireless Networks
- 21 January 2015
- Published by Springer Nature in Wireless Personal Communications
- Vol. 82 (3) , 1351-1376
Survey and Analysis of Integrating PMIPv6 and MIH Mobility Management Approaches for Heterogeneous Wireless Networks