Adeel Baig

Adeel Baig

Auto-generated profile, based on publicly available information

Adeel Baig

School of Electrical Engineering & Computer Science (SEECS), National University of Sciences & Technology (NUST), Islamabad, Pakistan

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
1 April 2018 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
MJMuhammad Aqib Javed
Muhammad Aqib Javed
MYMuhammad Shahzad Younis
Muhammad Shahzad Younis
SLSiddique Latif
Siddique Latif
Junaid QadirJunaid Qadir
Junaid Qadir
ABAdeel Baig
Adeel Baig

1 October 2010
Verified
Conference Paper
Closed access
SASalman Ali
Salman Ali
Junaid QadirJunaid Qadir
Junaid Qadir
ABAdeel Baig
Adeel Baig
Delay Tolerant Networks (DTN) are a class of networks that lack continuous connectivity between nodes due to limited wireless radio coverage, widely scattered mobile nodes, constrained energy resources, high levels of interference or due to some other similar channel impairment. Examples of such networks are those operating in mobile networks or extreme terrestrial environments, or simply as planned networks in space. The term disruption-tolerant network is also occasionally used in place of DTN. Routing in DTN is challenging because of frequent and long duration periods of non-connectivity. Several routing protocols have been proposed with strategies ranging from flooding to opportunistic approaches. Due to the diversity of available strategies, there is a need to properly classify and evaluate their performance with various angles. In this paper, we study state of the art routing protocols and give a comparison between them with respect to the characteristic features and methodology involved. The pros and cons of each, their performance and open research issues are also discussed.

1 October 2014 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
Junaid QadirJunaid Qadir
Junaid Qadir
ABAdeel Baig
Adeel Baig
AAAsad Ali
Asad Ali
QSQuratulain Shafi
Quratulain Shafi

13 June 2017 in Mobile Information Systems
Verified
Journal Article
Open access
PDF file
SHSyed Asad Hussain
Syed Asad Hussain
MIMuddesar Iqbal
Muddesar Iqbal
ASAtif Saeed
Atif Saeed
IRImran Raza
Imran Raza
HRHassan Raza
Hassan Raza
ABAdeel Baig
Adeel Baig
Vehicular Ad Hoc Networks (VANETs) are getting more popularity due to the potential Intelligent Transport Systems (ITS) technology. It provides many efficient network services such as safety warnings (collision warning), entertainment (video and voice), maps based guidance, and emergency information. VANETs most commonly use Road Side Units (RSUs) and Vehicle-to-Vehicle (V2V) referred to as Vehicle-to-Infrastructure (V2I) mode for data accessing. IEEE 802.11p standard which was originally designed for Wireless Local Area Networks (WLANs) is modified to address such type of communication. However, IEEE 802.11p uses Distributed Coordination Function (DCF) for communication between wireless nodes. Therefore, it does not perform well for high mobility networks such as VANETs. Moreover, in RSU mode timely provision of data/services under high density of vehicles is challenging. In this paper, we propose a RSU-based efficient channel access scheme for VANETs under high traffic and mobility. In the proposed scheme, the contention window is dynamically varied according to the times (deadlines) the vehicles are going to leave the RSU range. The vehicles with shorter time deadlines are served first and vice versa. Simulation is performed by using the Network Simulator (NS-3) v. 3.6. The simulation results show that the proposed scheme performs better in terms of throughput, backoff rate, RSU response time, and fairness.

31 May 2019 in IEEE Access
Verified
Journal Article
Open access
MAMuhammad Atif
Muhammad Atif
SLSiddique Latif
Siddique Latif
RARizwan Ahmad
Rizwan Ahmad
AKAdnan K. Kiani
Adnan K. Kiani
Junaid QadirJunaid Qadir
Junaid Qadir
WAWaseem Abbas
Waseem Abbas
Cyber-Physical Systems (CPS) were envisaged as a way to manipulate objects in the physical world through computer intelligence. This is usually done by providing a communication bridge between actuation and computing elements. This sought-after control is hampered not only by the unavoidable certainty found the physical world but also by limitations of contemporary communication networks. These limitations hamper fine-grained control of elements that may be separated by large-scale distances. In this regard, soft computing is an emerging paradigm that can help to manage the unreliability of CPS by using techniques including fuzzy systems, neural network, evolutionary computation, probabilistic reasoning, and rough sets. We present a comprehensive contemporary review of soft computing techniques for CPS dependability modeling, analysis, and improvement. This paper provides an overview of CPS applications, explores the foundations of dependability engineering, and highlights the potential role of soft computing techniques for CPS dependability with various case studies, while also identifying common pitfalls and future directions. In addition, this paper provides a comprehensive survey on the use of various soft computing techniques for making CPS dependable. This paper is timely due to the increasingly central role that CPS are beginning to play in modern societies and the need to leverage all the relevant methodologies and tools (such as those provided by soft computing) for the development of highly dependable CPS.

1 October 2012
Verified
Conference Paper
Closed access
YSYasir Saleem
Yasir Saleem
ABAdnan Bashir
Adnan Bashir
EAEjaz Ahmed
Ejaz Ahmed
Junaid QadirJunaid Qadir
Junaid Qadir
ABAdeel Baig
Adeel Baig
During the past few years, cognitive radio networks (CRNs) have emerged as a solution for the problems created due to fixed spectrum allocation such as inefficient usage of licensed spectrum. CRNs aim at solving this problem by exploiting the spectrum holes (the spectrum not being used by primary radio nodes at a particular time) and allocating the spectrum dynamically. In this paper, we address the problem of dynamic channel assignment for cognitive radio users in multi-radio multichannel cognitive radio networks (MRMC-CRNs). We propose an efficient spectrum-aware dynamic channel assignment (SA-DCA) strategy for such networks. SA-DCA utilizes available channels and assigns them to multiple radio interfaces of cognitive radio nodes based on primary radio unoccupancy, minimum interference to primary radio nodes, maximum connectivity and minimum interference between cognitive radio nodes. We perform simulations in NS-2 and compare the performance of SA-DCA with two related strategies. Simulation results show that SA-DCA assigns channels efficiently and results in significantly reduced interference to primary radio nodes and increased packet delivery ratio in MRMC-CRNs.