Jagdeep Singh

Dr. Jagdeep Singh

Department of Computer Science and Engineering, Sant Longowal Institute of Engineering and Technology, Sangrur, India
orcid
SM-IEEE | AICTE Certified Master Trainer | Assistant Profess...

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
4 March 2021 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
SDSanjay Kumar Dhurandher
Sanjay Kumar Dhurandher
Jagdeep SinghJagdeep Singh
Jagdeep Singh
Petros NicopolitidisPetros Nicopolitidis
Petros Nicopolitidis
RKRaghav Kumar
Raghav Kumar
GGGeetanshu Gupta
Geetanshu Gupta

1 March 2022 in Internet of Things
Verified
Journal Article
Closed access
Jagdeep SinghJagdeep Singh
Jagdeep Singh
IWIsaac Woungang
Isaac Woungang
SDSanjay Kumar Dhurandher
Sanjay Kumar Dhurandher
KKKhuram Khalid
Khuram Khalid

31 August 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
NGNitin Gupta
Nitin Gupta
Jagdeep SinghJagdeep Singh
Jagdeep Singh
SDSanjay Kumar Dhurandher
Sanjay Kumar Dhurandher
ZHZhu Han
Zhu Han
Industrial Internet of Things (IoT) and Industry 4.0 enable interconnection among various devices. An opportunistic IoT network is an ad hoc network that is formed by the nodes (e.g., smart vehicles and mobile phones) by utilizing various short radio range techniques. In this kind of network, information forwarding and dissemination among other smart devices is based upon the opportunistic contact nature mainly due to network dynamics and user mobility. Routing plays an important part in these kinds of networks since there does not exist a pre-established route (Tyagi and Kumar, 2013). Nodes are often selected dynamically based upon many parameters such that messages can be delivered successfully to the destination devices or sinks. However, these intermediate nodes are often selfish because routing these packets costs energy. In the case of incomplete cooperation and asymmetric information, message delivery can be severely degraded, which increases the network delay affecting the overall network performance. Therefore, this work proposes an incentive design mechanism based on the contract theory to reward intermediate nodes appropriately to forward the messages. The contract theory is used to model the forwarding-forwarder node interaction as a labor market with private information. First, the users are classified into a finite number of types according to their ability of forwarding the message, and the service trading between the forwarding and forwarder nodes is properly modeled. Furthermore, the necessary and sufficient conditions are derived to provide the incentives to the nodes involved in the message forwarding. Extensive simulations show that the proposed mechanism is effective in providing incentives and outperforms other benchmark schemes in terms of delivery probability, average latency, and overhead ratio.

28 October 2020 in Information
Verified
Journal Article
Open access
PDF file
KKKhuram Khalid
Khuram Khalid
IWIsaac Woungang
Isaac Woungang
SDSanjay Kumar Dhurandher
Sanjay Kumar Dhurandher
Jagdeep SinghJagdeep Singh
Jagdeep Singh
Joel RodriguesJoel Rodrigues
Joel Rodrigues
Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

18 February 2020 in International Journal of Communication Systems
Verified
Journal Article
Closed access
PDF file
SDSanjay K. Dhurandher
Sanjay K. Dhurandher
Jagdeep SinghJagdeep Singh
Jagdeep Singh
IWIsaac Woungang
Isaac Woungang
RKRaghav Kumar
Raghav Kumar
GGGeetanshu Gupta
Geetanshu Gupta

29 November 2024 in Sensors
Verified
Journal Article
Open access
PDF file
Jagdeep SinghJagdeep Singh
Jagdeep Singh
SDSanjay Kumar Dhurandher
Sanjay Kumar Dhurandher
IWIsaac Woungang
Isaac Woungang
Han-Chieh ChaoHan-Chieh Chao
Han-Chieh Chao
In opportunistic IoT (OppIoT) networks, non-cooperative nodes present a significant challenge to the data forwarding process, leading to increased packet loss and communication delays. This paper proposes a novel Context-Aware Trust and Reputation Routing (CATR) protocol for opportunistic IoT networks, which leverages the probability density function of the beta distribution and some contextual factors, to dynamically compute the trust and reputation values of nodes, leading to efficient data dissemination, where malicious nodes are effectively identified and bypassed during that process. Simulation experiments using the ONE simulator show that CATR is superior to the Epidemic protocol, the so-called beta-based trust and reputation evaluation system (denoted BTRES), and the secure and privacy-preserving structure in opportunistic networks (denoted PPHB+), achieving an improvement of 22%, 15%, and 9% in terms of average latency, number of messages dropped, and average hop count, respectively, under varying number of nodes, buffer size, time to live, and message generation interval.