Naveed Ul Hassan

Dr. Naveed Ul Hassan

Department of Electrical Engineering, Lahore University of Management Sciences, Lahore 54792, Pakistan
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 December 2019 in Information Fusion
Verified
Journal Article
Closed access
BLBilly Pik Lik Lau
Billy Pik Lik Lau
SMSumudu Hasala Marakkalage
Sumudu Hasala Marakkalage
YZYuren Zhou
Yuren Zhou
NHNaveed Ul Hassan
Naveed Ul Hassan
Chau YuenChau Yuen
Chau Yuen
UTU-Xuan Tan
U-Xuan Tan

9 February 2015 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
AAAyaz Ahmad
Ayaz Ahmad
SASadiq Ahmad
Sadiq Ahmad
MRMubashir Husain Rehmani
Mubashir Husain Rehmani
NHNaveed Ul Hassan
Naveed Ul Hassan
Wireless sensor networks (WSNs) use the unlicensed industrial, scientific, and medical (ISM) band for transmissions. However, with the increasing usage and demand of these networks, the currently available ISM band does not suffice for their transmissions. This spectrum insufficiency problem has been overcome by incorporating the opportunistic spectrum access capability of cognitive radio (CR) into the existing WSN, thus giving birth to CR sensor networks (CRSNs). The sensor nodes in CRSNs depend on power sources that have limited power supply capabilities. Therefore, advanced and intelligent radio resource allocation schemes are very essential to perform dynamic and efficient spectrum allocation among sensor nodes and to optimize the energy consumption of each individual node in the network. Radio resource allocation schemes aim to ensure QoS guarantee, maximize the network lifetime, reduce the internode and internetwork interferences, etc. In this paper, we present a survey of the recent advances in radio resource allocation in CRSNs. Radio resource allocation schemes in CRSNs are classified into three major categories, i.e., centralized, cluster-based, and distributed. The schemes are further divided into several classes on the basis of performance optimization criteria that include energy efficiency, throughput maximization, QoS assurance, interference avoidance, fairness and priority consideration, and hand-off reduction. An insight into the related issues and challenges is provided, and future research directions are clearly identified.

13 October 2015 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
RMRajarshi Mahapatra
Rajarshi Mahapatra
YNYogesh Nijsure
Yogesh Nijsure
GKGeorges Kaddoum
Georges Kaddoum
NHNaveed Ul Hassan
Naveed Ul Hassan
Chau YuenChau Yuen
Chau Yuen
Energy efficient (EE) communication has earned tremendous interest in recent years due to ever increasing number of wireless devices operating in shrinking cells, while demanding high data rates with high Quality of Services (QoS) and Quality of Expectation (QoE). To support these objectives, energy is consumed in every protocol layer. Establishing and maintaining a successful wireless communication link to simultaneously achieve all these objectives becomes challenging since the energy consumption requirements of the user and network are different for different objectives. Thus, there is a need for tradeoff techniques to achieve energy efficiency in each protocol layer. In this paper, we provide a survey of different tradeoff mechanisms proposed in the literature. The EE tradeoffs have been classified based on each protocol layer and discussed its affect in the network energy efficiency. These other QoS parameters include spectral efficiency, deployment, delay, routing, scheduling, bandwidth and coding etc. This survey also discusses the various EE techniques to improve energy-efficiency in infrastructure mode. Finally, the work provides an discussion, where impact of EE tradeoffs have been presented based on different wireless architecture towards realizing a green wireless communication network.

31 May 2016 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
XWXiumin Wang
Xiumin Wang
Chau YuenChau Yuen
Chau Yuen
NHNaveed Ul Hassan
Naveed Ul Hassan
NANing An
Ning An
WWWeiwei Wu
Weiwei Wu
Due to the low pollution and sustainable properties, using electric buses for public transportation systems has attracted considerable attention, whereas how to recharge the electric buses with long continuous service hours remains an open problem. In this paper, we consider the problem of placing electric vehicle (EV) charging stations at selected bus stops, to minimize the total installation cost of charging stations. Specifically, we study two EV charging station placement cases, with and without considering the limited battery size, which are called ECSP_LB and ECSP problems, respectively. The solution of the ECSP problem achieves the lower bound compared with the solution of the ECSP_LB problem, and the larger the battery size of the EV, the lower the overall cost of the charging station installation. For both cases, we prove that the placement problems under consideration are NP-hard and formulate them into integer linear programming. Specifically, for the ECSP problem we design a linear programming relaxation algorithm to get a suboptimal solution and derive an approximation ratio of the algorithm. Moreover, we derive the condition of the battery size when the ECSP problem can be applied. For the ECSP_LB problem, we show that, for a single bus route, the problem can be optimally solved with a backtracking algorithm, whereas for multiple bus routes we propose two heuristic algorithms, namely, multiple backtracking and greedy algorithms. Finally, simulation results show the effectiveness of the proposed schemes.

20 June 2014 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
YLYi Liu
Yi Liu
Chau YuenChau Yuen
Chau Yuen
SHShisheng Huang
Shisheng Huang
NHNaveed Ul Hassan
Naveed Ul Hassan
XWXiumin Wang
Xiumin Wang
SXShengli Xie
Shengli Xie
In a smart grid network, demand-side management plays a significant role in allowing consumers, incentivized by utilities, to manage their energy consumption. This can be done through shifting consumption to off-peak hours and thus reducing the peak-to-average ratio (PAR) of the electricity system. In this paper, we begin by proposing a demand-side energy consumption scheduling scheme for household appliances that considers a PAR constraint. An initial optimization problem is formulated to minimize the energy cost of the consumers through the determination of the optimal usage power and operation time of throttleable and shiftable appliances, respectively. We realize that the acceptance of consumers of these load management schemes is crucial to its success. Hence, we then introduce a multi-objective optimization problem which not only minimizes the energy cost but also minimizes the inconvenience posed to consumers. In addition to solving the proposed optimization problems in a centralized manner, two distributed algorithms for the initial and the multi-objective optimization problems are also proposed. Simulation results show that the proposed demand-side energy consumption schedule can provide an effective approach to reducing total energy costs while simultaneously considering PAR constraints and consumers' preferences.

11 March 2014 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YLYi Liu
Yi Liu
Chau YuenChau Yuen
Chau Yuen
XCXianghui Cao
Xianghui Cao
NHNaveed Ul Hassan
Naveed Ul Hassan
JCJiming Chen
Jiming Chen
A robust and resilient medium access control (MAC) protocol is crucial for numerous machine-type devices to concurrently access the channel in a machine-to-machine (M2M) network. Simplex (reservation- or contention-based) MAC protocols are studied in most literatures which may not be able to provide a scalable solution for M2M networks with large number of heterogeneous devices. In this paper, a scalable hybrid MAC protocol, which consists of a contention period and a transmission period, is designed for heterogeneous M2M networks. In this protocol, different devices with preset priorities (hierarchical contending probabilities) first contend the transmission opportunities following the convention-based p-persistent carrier sense multiple access (CSMA) mechanism. Only the successful devices will be assigned a time slot for transmission following the reservation-based time-division multiple access (TDMA) mechanism. If the devices failed in contention at previous frame, to ensure the fairness among all devices, their contending priorities will be raised by increasing their contending probabilities at the next frame. To balance the tradeoff between the contention and transmission period in each frame, an optimization problem is formulated to maximize the channel utility by finding the key design parameters: the contention duration, initial contending probability, and the incremental indicator. Analytical and simulation results demonstrate the effectiveness of the proposed hybrid MAC protocol.