Parminder Singh

Work place: Chandigarh Engineering College, Landran (Mohali), Punjab, 140307, India



Research Interests: Theoretical Computer Science, Computer systems and computational processes, Computational Science and Engineering, Applied computer science


Parminder Singh is a young dynamic personality with a proven record of a good academician and researcher having an outstanding academic record. He has done his Doctrate in the field of Network Security. He had completed his M.Tech in Computer Science and Engineering from Punjab Technical University, Jalandhar. He is currently working as an Assistant Professor of Information Technology in CEC Landran. He has more than Ten years of rich experience as an academician and researcher. He has published over 70 Journal and conference papers in the areas of Networking, Wireless Networks, sensor computing and Network security. He has also contributed various articles published in Elsevier Book and Springer Berlin Heidelberg. He has served/serving in International conferences as a general steering committee member, and presented Expert Lectures in the areas Wireless Networks and sensor computing. He has received faculty excellence and research awards in the year 2011, 2013 and 2015 from his Institution for excellence in research, teaching and service.

Author Articles
Load Balancing Optimization Based on Deep Learning Approach in Cloud Environment

By Amanpreet Kaur Bikrampal Kaur Parminder Singh Mandeep Singh Devgan Harpreet Kaur Toor

DOI:, Pub. Date: 8 Jun. 2020

Load balancing is a significant aspect of cloud computing which is essential for identical load sharing among resources like servers, network interfaces, hard drives (storage) and virtual machines (VMs) hosted on physical servers. In cloud computing, Deep  Learning (DL) techniques can be used to achieve QoS such as improve resource utilization and throughput; while reduce latency, response time and cost, balancing load across machines, thus, increasing the system reliability. DL results in effective and accurate decision making of intelligent resource allocation to the incoming requests, thereby, choosing the most suitable resource to complete them.  However, in previous researches on load balancing, there is limited application of DL approaches. In this paper, the significance of DL approaches have been analysed in the area of cloud computing.  A Framework for Workflow execution in cloud environment has been proposed and implemented, namely, Deep Learning- based Deadline-constrained, Dynamic VM Provisioning and Load Balancing (DLD-PLB). Optimal schedule for VMs has been generated using Deep Learning based technique. The Genome workflow tasks have been taken as input to the suggested framework. The results for makespan and cost has been computed for the proposed framework and has been compared with our earlier proposed framework for load balancing optimization - Hybrid approach based Deadline-constrained, Dynamic VM Provisioning and Load Balancing (HDD-PLB)” framework for Workflow execution. The earlier proposed approaches for load balancing were based on hybrid Predict-Earliest-Finish Time (PEFT) with ACO for underutilized VM optimization and hybrid PEFT-Bat approach for optimize the utilization of overflow VMs.

[...] Read more.
Efficient Authentication and Privacy Mechanism to protect legitimate Vehicles in IEEE 802.11p Standard

By Deepak Verma Parminder Singh

DOI:, Pub. Date: 8 Jan. 2019

VANETs is the open model which stimulate in academia and industry oriented researches. However, the model is open and there are many violations in a communication of vehicle to vehicle (V2V) and Vehicle to Infrastructure (V2I). Any anonymous user may extract the useful information. Researchers have proposed many research proposal and solved issues related to VANET. The security is the major concern and to avoid mishappening in driving the vehicle. We proposed the authentication system that provides safety of the driver during travel on the roads. The proposed results deliver the following features: 1) Reliability of VANET model 2) Road Safety 3) Privacy of the vehicles 4) Authentication of message delivery to adjacent nodes. Finally, we provide a view point of how to detect the attacks and withdraw malicious node more efficiently.

[...] Read more.
Improving Energy of Modified Multi-Level LEACH Protocol by Triggering Random Channel Selection

By Jaspreet Kaur Parminder Singh

DOI:, Pub. Date: 8 Dec. 2016

The energy has undergone a major concern in wireless sensor networks. One direction of the LEACH protocol would be towards a future in which four levels will continue to dominate. The other direction would be towards to improve these levels further and increasingly smaller amount of energy consumption. The support provided by the LEACH protocol has been crucial in which upgrade these levels and build smart distributed network. The previous scenario is not motivated by the scientific altruism. They are large number of clients in the proposed scenario and therefore have a good reason to encourage a scalable alternative for communication. LEACH protocol to take a leaf out of the proposed scenario and it has a good energy saver, less energy consumption. The proposed scenario needs to be better understanding the catalytic role played by the previous three levels LEACH protocol. It should also see whether there is scope for deploying more nodes through collaboratively proposed protocol with three level protocols.

[...] Read more.
Favorable Trail Detection using ACO-Bellman Algorithm in VANETs

By Yogesh Parminder Singh

DOI:, Pub. Date: 8 Jan. 2016

Vehicular ad hoc networks (VANETs) are the networks, which configured themselves, where the nodes are moving vehicles. These provide the communications required to deploy Intelligent Transportation Systems (ITS). A major dispute in VANETs is distribution of efficient and computable information because during communication nodes may leave or join the network dynamically. There is no guarantee about node availability at any given time, which leads to traffic problem, congestion problem. Therefore trailing the favorable path is a challengeable issue. Multiple routing algorithms have been developed for routing solution. In this paper the swarm-based algorithm has been presented, which helps to find out the optimal route using Bellman Ford algorithm. Ant colonization searches out the path using pheromones level. Higher the pheromone count of a route gives the optimal choice of path that can be used for packet delivery. Bellman Ford Algorithm optimizes the paths found by Ant Colony Optimization (ACO) by comparing the distance of source to all the nodes of network or cost given to the networks.

[...] Read more.
Appraisement of IEEE 802.11s based Mesh Networks with Mean Backoff Algorithm

By Shafi Jasuja Parminder Singh

DOI:, Pub. Date: 8 Oct. 2015

Wireless mesh networks, consisting of mesh routers and mesh clients are very robust, reliable and easily maintained networks. The current work is based on IEEE 802.11 standard amendment IEEE 802.11s specific for mesh topology based networks to improve the connectivity and coverage. It aims to control the shared medium access among the stations using Distributed Coordination Function (DCF) MAC protocol for reducing collisions and delays, thereby increasing throughput of the network.. The actual Binary Exponential Backoff (BEB) algorithm as implemented in IEEE 802.11 resets the contention window to its least value after an acknowledged transmission. From the previous works it has been observed that this sudden reset to minimum value of contention window does not ensure a reduction in collisions. It may lead to more contention in the network thereby increasing delays and affecting its throughput. The proposed work presents a Mean Backoff Algorithm in order to solve this flaw of BEB algorithm. The proposed algorithm aims to bring the contention window to some appropriate value in order to cope up with the unfairness caused due to its minimum value on successful transmission.

[...] Read more.
An Efficient Novel Key Management Scheme for Enhancing User Authentication in A WSN

By Harjot Bawa Parminder Singh Rakesh Kumar

DOI:, Pub. Date: 8 Jan. 2013

The Wireless Sensor Networks are energy constrained and are normally low cost and low power devices. These nodes are deployed over a specific area for specific goals. Due to energy and memory constraints, secure communication among these sensors is challenging management issue. In order to ensure security, proper connectivity among nodes and resilience against node capture, we propose a scheme called as Random Pre-Key distribution scheme which takes advantage of the binomial key pattern while creating and distributing keys. The value of keys would develop the number of patterns, which is given by the binomial distribution, which would be helpful in maintaining a key pool which is all though random in nature and following a pattern leads to more probability of network connection links. This paper provides a secured communication in WSNs environment and pairing user authentication has been proposed. We employ the idea of dividing the sensor network field into scattered nodes. Inside the scenario, one of the sensor nodes is selected as a server sensor node which is responsible for delivering the key. The novelty of the proposed scenario lies behind the idea of incorporating the sensor nodes along with the proper user authentications. We calculate the throughput involving a periodic traffic and obtained results from the xgraph utility with the use of Network Simulator. The results of this key scheme are obtained and show that improvement in terms of connectivity.

[...] Read more.
Other Articles