Gulshan Kumar

Bio: Gulshan Kumar is an academic researcher from Lovely Professional University. The author has contributed to research in topics: Wireless sensor network & Authentication. The author has an hindex of 11, co-authored 86 publications receiving 470 citations. Previous affiliations of Gulshan Kumar include University of Padua.

Proof-of-Work Consensus Approach in Blockchain Technology for Cloud and Fog Computing Using Maximization-Factorization Statistics

Abstract: In this paper, we discussed an efficient statistical method with proof-of-work consensus approach for cloud and fog computing. With this method, solution with precise probability in minimal time is realized. We have used the expectation maximization algorithm and polynomial matrix factorization. The advantages of this statistical method are the less iteration to converge to the consensus solution and easiness to configure the complete mathematical model as per the requirement. Moreover, the energy and memory consumption are also less which make this approach appealing for cloud and fog computing. The experimental results also show that the proposed approach is significantly efficient in terms of time and memory consumption. This novel approach seems beneficial for Internet-of-Things (IoT), one of the most fast-growing technologies in network computing.

Privacy Ensured ${e}$ -Healthcare for Fog-Enhanced IoT Based Applications

Abstract: The progress in network technology and hardware in conjunction with the Internet-of-Things (IoTs) has provided the comfortability for an easier human life at present. Apart from the so-called “smart” environments, including smart homes, smart city, smart agriculture, IoTs have been included recently in e-healthcare systems as well for real-time diagnosis and medical consultancy. To enhance the capabilities of IoT-based healthcare systems, fog layers have been employed and that have shown its worth by providing fast response time and low latency. However, such development is posing a severe challenge in preserving the privacy of the users which further addresses the security/privacy issues to some extent. Being in an infant stage, such technology has invariably run into fewer privacy controls. Therefore, our present work is about an e-healthcare framework dealing with electronic medical records (EMRs) which preserves the privacy issues. Moreover, we have experimented the proposed work with respect to response time and delay and have compared with recent works. The results show that the proposed work is efficient in providing privacy along with standard network parameters.

A Novel Trust Evaluation Process for Secure Localization Using a Decentralized Blockchain in Wireless Sensor Networks

Abstract: In this research paper, blockchain-based trust management model is proposed to enhance trust relationship among beacon nodes and to eradicate malicious nodes in Wireless Sensor Networks (WSNs). This composite trust evaluation involves behavioral-based trust as well as data-based trust. Various metrics such as closeness, honesty, intimacy and frequency of interaction are taken into account to compute behavioral-based trust of beacon nodes. Further, the composite (behavior and data) trust value of each beacon nodes is broadcast to Base Stations (BS) to generate a blockchain of trust values. Subsequently, the management model discards the beacon node with least trust value and that ensures reliability and consistency of localization in WSNs. The simulated results of the proposed algorithm are compared with the existing ones in terms of detection accuracy, False Positive Rate (FPR) and False Negative Rate (FNR) and Average Energy Consumption (AEC).

A Privacy-Preserving Secure Framework for Electric Vehicles in IoT Using Matching Market and Signcryption

Abstract: The present world of vehicle technology is inclined to develop Electric Vehicles (EVs) with various optimized features. These vehicles need frequent charging which takes a longer time to charge up. Therefore, scheduling of vehicles in charging stations is required. Besides, the information of the EVs and its location is also stored by the charging stations and therefore creates a concern of EV privacy. Various researches are going on to solve these problems; however, an efficient privacy-preserving solution is less practiced till date. In this paper, a framework for Electric Vehicle (EV) charging is discussed. The framework uses the concept of Matching Market to identify a charging station and uses the lattice-based cryptography for secure communications. The matching market considers multiple factors to provide the best allocation of charging station and cryptography ensures security and privacy preservation. The use of lattice-based cryptographic hash SWIFFT avoids heavy computation. This usage of matching market and lattice cryptography, more specifically signcryption for EV charging framework are the highlights of the solution and add-ons to the novel features. Overall, the presented framework is efficient in terms of computation and communication cost, satisfaction ratio, slot ratio, charging latency and load balancing index. The performance metrics are compared with recent developments in this field.

A Wireless Sensor Network.

Abstract: The Wireless sensor network play a vital role in collecting a Real – Time data, monitoring environmental conditions based on technology adoption. These sensor network is the combination of sensing, computation, and communication through a single tiny device. Here many tiny nodes assemble and configure themselves. It also controls actuators that extend control from cyberspace into the physical world. Here the sensor nodes communicate with the local peers rather than the high – power control tower or base station. Instead, of relying on a predeployed infrastructure, each individual sensor or actuator become part of the overall infrastructure. Here we have three hardware platforms that addresses the needs of wireless sensor netwoks. The operating system here uses an event based execution to support concurrency. The platform serves as a baseline and does not contain any hardware accelerators. . First platform serves as a baseline and it produces Operating system concepts for refining concurrency mechanisms. The second node validates the architectural designs and improve the communicational rates. The third node represents the full realization of the general architecture. Keywords— node, platform, concurrency.

Federated Learning With Blockchain for Autonomous Vehicles: Analysis and Design Challenges

Abstract: We propose an autonomous blockchain-based federated learning (BFL) design for privacy-aware and efficient vehicular communication networking, where local on-vehicle machine learning (oVML) model updates are exchanged and verified in a distributed fashion. BFL enables oVML without any centralized training data or coordination by utilizing the consensus mechanism of the blockchain. Relying on a renewal reward approach, we develop a mathematical framework that features the controllable network and BFL parameters (e.g., the retransmission limit, block size, block arrival rate, and the frame sizes) so as to capture their impact on the system-level performance. More importantly, our rigorous analysis of oVML system dynamics quantifies the end-to-end delay with BFL, which provides important insights into deriving optimal block arrival rate by considering communication and consensus delays. We present a variety of numerical and simulation results highlighting various non-trivial findings and insights for adaptive BFL design. In particular, based on analytical results, we minimize the system delay by exploiting the channel dynamics and demonstrate that the proposed idea of tuning the block arrival rate is provably online and capable of driving the system dynamics to the desired operating point. It also identifies the improved dependency on other blockchain parameters for a given set of channel conditions, retransmission limits, and frame sizes. 1 However, a number of challenges (gaps in knowledge) need to be resolved in order to realise these changes. In particular, we identify key bottleneck challenges requiring further investigations, and provide potential future reserach directions. 1 An early version of this work has been accepted for presentation in IEEE WCNC Wksps 2020 [1] .

A Survey on Mobile Augmented Reality With 5G Mobile Edge Computing: Architectures, Applications, and Technical Aspects

Abstract: The Augmented Reality (AR) technology enhances the human perception of the world by combining the real environment with the virtual space. With the explosive growth of powerful, less expensive mobile devices, and the emergence of sophisticated communication infrastructure, Mobile Augmented Reality (MAR) applications are gaining increased popularity. MAR allows users to run AR applications on mobile devices with greater mobility and at a lower cost. The emerging 5G communication technologies act as critical enablers for future MAR applications to achieve ultra-low latency and extremely high data rates while Multi-access Edge Computing (MEC) brings enhanced computational power closer to the users to complement MAR. This paper extensively discusses the landscape of MAR through the past and its future prospects with respect to the 5G systems and complementary technology MEC. The paper especially provides an informative analysis of the network formation of current and future MAR systems in terms of cloud, edge, localized, and hybrid architectural options. The paper discusses key application areas for MAR and their future with the advent of 5G technologies. The paper also discusses the requirements and limitations of MAR technical aspects such as communication, mobility management, energy management, service offloading and migration, security, and privacy and analyzes the role of 5G technologies.

BeCome: Blockchain-Enabled Computation Offloading for IoT in Mobile Edge Computing

Abstract: Benefiting from the real-time processing ability of edge computing, computing tasks requested by smart devices in the Internet of Things are offloaded to edge computing devices (ECDs) for implementation. However, ECDs are often overloaded or underloaded with disproportionate resource requests. In addition, during the process of task offloading, the transmitted information is vulnerable, which can result in data incompleteness. In view of this challenge, a blockchain-enabled computation offloading method, named BeCome, is proposed in this article. Blockchain technology is employed in edge computing to ensure data integrity. Then, the nondominated sorting genetic algorithm III is adopted to generate strategies for balanced resource allocation. Furthermore, simple additive weighting and multicriteria decision making are utilized to identify the optimal offloading strategy. Finally, performance evaluations of BeCome are given through simulation experiments.

A survey of blockchain consensus algorithms performance evaluation criteria

Abstract: How to reach an agreement in a blockchain network is a complex and important task that is defined as a consensus problem and has wide applications in reality including distributed computing, load balancing, and transaction validation in blockchains. Over recent years, many studies have been done to cope with this problem. In this paper, a comparative and analytical review on the state-of-the-art blockchain consensus algorithms is presented to enlighten the strengths and constraints of each algorithm. Based on their inherent specifications, each algorithm has a different domain of applicability that yields to propose several performance criteria for the evaluation of these algorithms. To overview and provide a basis of comparison for further work in the field, a set of incommensurable and conflicting performance evaluation criteria is identified and weighted by the pairwise comparison method. These criteria are classified into four categories including algorithms’ throughput, the profitability of mining, degree of decentralization and consensus algorithms vulnerabilities and security issues. Based on the proposed framework, the pros and cons of consensus algorithms are systematically analyzed and compared in order to provide a deep understanding of the existing research challenges and clarify the future study directions.