scispace - formally typeset
Search or ask a question
Institution

Thapar University

EducationPatiāla, Punjab, India
About: Thapar University is a education organization based out in Patiāla, Punjab, India. It is known for research contribution in the topics: Cloud computing & Fuzzy logic. The organization has 2944 authors who have published 8558 publications receiving 130392 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: Trust aware Collaborative Learning Automata based Intrusion Detection System (T-CLAIDS) for VANETs is proposed and results obtained show that T-CLAIDs performs better than the other existing schemes with respect to parameters such as false alarm ratio, detection ratio and overhead generated.

111 citations

Journal ArticleDOI
TL;DR: An efficient and privacy-preserving DA scheme for the SG against internal attacks is proposed and shows that the proposed DA scheme not only overcome the key leakage problem in Fan et al.
Abstract: With fast advancements of communication, systems and information technologies, a smart grid (SG) could bring much convenience to users because it could provide a reliable and efficient energy service. The data aggregation (DA) scheme for the SG plays an important role in evaluating information about current energy usage. To achieve the goal of preserving users' privacy, many DA schemes for the SG have been proposed in last decade. However, how to withstand attacks of internal adversaries is not considered in those schemes. To enhance preservation of privacy, Fan et al. proposed a DA scheme for the SG against internal adversaries. In Fan et al.'s DA scheme, blinding factors are used in evaluating information about current energy usage and the aggregator cannot get the consumption information of any individual user. Fan et al. demonstrated that their scheme was secure against various attacks. However, we find that their scheme suffers from the key leakage problem, i.e., the adversary could extract the user's private key through the public information. To overcome such serious weakness, this paper proposes an efficient and privacy-preserving DA scheme for the SG against internal attacks. Analysis shows that the proposed DA scheme not only overcome the key leakage problem in Fan et al.'s DA scheme, but also has better performance.

111 citations

Journal ArticleDOI
Harish Garg1
TL;DR: A new decision‐making model with probabilistic information and using the concept of immediate probabilities has been developed to aggregate the information under the Pythagorean fuzzy set environment to show the utility of the developed method.
Abstract: In this article, a new decision‐making model with probabilistic information and using the concept of immediate probabilities has been developed to aggregate the information under the Pythagorean fuzzy set environment. In it, the existing probabilities have been modified by introducing the attitudinal character of the decision maker by using an ordered weighted average operator. Based on it, we have developed some new probabilistic aggregation operator with Pythagorean fuzzy information, namely probabilistic Pythagorean fuzzy weighted average operator, immediate probability Pythagorean fuzzy ordered weighted average operator, probabilistic Pythagorean fuzzy ordered weighted average, probabilistic Pythagorean fuzzy weighted geometric operator, immediate probability Pythagorean fuzzy ordered weighted geometric operator, probabilistic Pythagorean fuzzy ordered weighted geometric, etc. Furthermore, we extended these operators by taking interval‐valued Pythagorean fuzzy information and developed their corresponding aggregation operators. Few properties of these operators have also been investigated. Finally, an illustrative example about the selection of the optimal production strategy has been given to show the utility of the developed method.

111 citations

Journal ArticleDOI
TL;DR: A new authenticated key agreement protocol without bilinear pairing is designed that achieves mutual authentication, generates a securely agreed session key for secret communication, and supports privacy protection in fog-based VANETs.
Abstract: The maturity of cloud computing, the Internet of Things technology, and intelligent transportation system has promoted the rapid development of vehicular ad-hoc networks (VANETs). To keep pace with real-world demands (mobility, low latency, etc.) in a practical VANETs deployment, there have been attempts to integrate fog computing with VANETs. To facilitate secure interaction in fog-based VANETs, we design a new authenticated key agreement protocol without bilinear pairing. This protocol achieves mutual authentication, generates a securely agreed session key for secret communication, and supports privacy protection. We also give a strict formal security proof and demonstrate how the proposed protocol meets the security requirements in the fog-based VANETs. We then evaluate the efficiency of the proposed protocol, and it shows the practicality of the protocol.

111 citations

Journal ArticleDOI
TL;DR: An energy-aware model basis on the marine predators algorithm (MPA) is proposed for tackling the task scheduling in fog computing (TSFC) to improve the quality of service (QoS) required by users.
Abstract: To improve the quality of service (QoS) needed by several applications areas, the Internet of Things (IoT) tasks are offloaded into the fog computing instead of the cloud. However, the availability of ongoing energy heads for fog computing servers is one of the constraints for IoT applications because transmitting the huge quantity of the data generated using IoT devices will produce network bandwidth overhead and slow down the responsive time of the statements analyzed. In this article, an energy-aware model basis on the marine predators algorithm (MPA) is proposed for tackling the task scheduling in fog computing (TSFC) to improve the QoSs required by users. In addition to the standard MPA, we proposed the other two versions. The first version is called modified MPA (MMPA), which will modify MPA to improve their exploitation capability by using the last updated positions instead of the last best one. The second one will improve MMPA by the ranking strategy based reinitialization and mutation toward the best, in addition to reinitializing, the half population randomly after a predefined number of iterations to get rid of local optima and mutated the last half toward the best-so-far solution. Accordingly, MPA is proposed to solve the continuous one, whereas the TSFC is considered a discrete one, so the normalization and scaling phase will be used to convert the standard MPA into a discrete one. The three versions are proposed with some other metaheuristic algorithms and genetic algorithms based on various performance metrics such as energy consumption, makespan, flow time, and carbon dioxide emission rate. The improved MMPA could outperform all the other algorithms and the other two versions.

110 citations


Authors

Showing all 3035 results

NameH-indexPapersCitations
Gaurav Sharma82124431482
Vinod Kumar7781526882
Neeraj Kumar7658718575
Ashish Sharma7590920460
Dinesh Kumar69133324342
Pawan Kumar6454715708
Harish Garg6131111491
Rafat Siddique5818311133
Surya Prakash Singh5573612989
Abhijit Mukherjee5537810196
Ajay Kumar5380912181
Soumen Basu452477888
Sudeep Tanwar432635402
Yosi Shacham-Diamand422876463
Rupinder Singh424587452
Network Information
Related Institutions (5)
Indian Institute of Technology Roorkee
21.4K papers, 419.9K citations

96% related

Indian Institutes of Technology
40.1K papers, 652.9K citations

95% related

Indian Institute of Technology Delhi
26.9K papers, 503.8K citations

94% related

Indian Institute of Technology Kharagpur
38.6K papers, 714.5K citations

94% related

Anna University
19.9K papers, 312.6K citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202347
2022149
20211,237
20201,083
2019962
2018933