Arunesh Kumar Mishra
@dhsgsu.ac.in
Research Scholar Department of Chemistry
Dr. Harisingh Gour Central University Sagar
EDUCATION
Research Scholar (Doctoral Fellow)
RESEARCH, TEACHING, or OTHER INTERESTS
Organic Chemistry, Chemistry, Electrochemistry, Classics
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
Arunesh K. Mishra, Pratibha Mishra, Anil K. Bahe, Atish Roy, Megha Das, and Ratnesh Das
CRC Press
Pratibha Mishra, Arunesh K. Mishra, Megha Das, and Ratnesh Das
CRC Press
Sarvesh Kumar Pandey, Elangannan Arunan, Ratnesh Das, Atish Roy, and Arunesh Kumar Mishra
Frontiers Media SA
In the advancement of novel materials, chemistry plays a vital role in developing the realm where we survive. Superalkalis are a group of clusters/molecules having lower ionization potentials (IPs) than that of the cesium atom (3.89 eV) and thus, show excellent reducing properties. However, the chemical industry and material science both heavily rely on such reducing substances; an in silico approach-based design and characterization of superalkalis have been the focus of ongoing studies in this area along with their potential applications. However, although superalkalis have been substantially sophisticated materials over the past couple of decades, there is still room for enumeration of the recent progress going on in various interesting species using computational experiments. In this review, the recent developments in designing/modeling and characterization (theoretically) of a variety of superalkali-based materials have been summarized along with their potential applications. Theoretically acquired properties of some novel superalkali cations (Li3+) and C6Li6 species, etc. for capturing and storing CO2/N2 molecules have been unveiled in this report. Additionally, this report unravels the first-order polarizability-based nonlinear optical (NLO) response features of numerous computationally designed novel superalkali-based materials, for instance, fullerene-like mixed-superalkali-doped B12N12 and B12P12 nanoclusters with good UV transparency and mixed-valent superalkali-based CaN3Ca (a high-sensitivity alkali-earth-based aromatic multi-state NLO molecular switch, and lead-founded halide perovskites designed by incorporating superalkalis, supersalts, and so on) which can indeed be used as a new kind of electronic nanodevice used in designing hi-tech NLO materials. Understanding the mere interactions of alkalides in the gas and liquid phases and the potential to influence how such systems can be extended and applied in the future are also highlighted in this survey. In addition to offering an overview of this research area, it is expected that this review will also provide new insights into the possibility of expanding both the experimental synthesis and the practical use of superalkalis and their related species. Superalkalis present the intriguing possibility of acting as cutting-edge construction blocks of nanomaterials with highly modifiable features that may be utilized for a wide-ranging prospective application.
Ratnesh DAS, Atish ROY, Anil BAHE, Aayushı CHANDERIYA, Hemlata DANGİ, Pratibha MİSHRA, and Arunesh MİSHRA
Journal of the Turkish Chemical Society, Section A: Chemistry
Arunesh MİSHRA, Pratibha MİSHRA, and Ratnesh DAS
Journal of the Turkish Chemical Society, Section A: Chemistry
In the last decades, two serious coronaviruses have appeared in humans and animals, SARS-CoV (severe acute respiratory syndrome) and MERS-CoV (middle east respiratory syndrome) are also contagious viruses that causes ARDS stands for acute respiratory distress syndrome. SARS-CoV in 2003 and MERS-CoV in 2012 are characterized as a high mortality rate. This novel human respiratory coronaviruses, also known as SARS n-CoV or SARS-CoV-2, are needed to rapidly provide therapeutic options to reduce and prevent the spread of this outbreak. For such infections, there are currently no scientifically approved precautions or anti-viral products authorized.;therefore, effective remedial and preventive strategies have to be developed that can be easily applied to this newly emerging epidemic. In addition to all these, some therapeutic options are also being evaluated that are used for Covid-19, which includes inhibitory virus molecules or molecules that target specific replication and transcription enzymes. Since the drugs remdesivir, lopinavir-ritonavir, favipiravir, camostat mesylate, chloroquine, and hydroxychloroquine were originate closely stand high successful in controlling infection, Covid-19 looks promising. The research on Covid-19, discuss the efficacy of the several drug and vaccines against Covid-19 and previous outbreaks of SARS and MERS, and provide recommendations for new modes of treatment, assessment, and clinical research on such terrible epidemic. This paper will summarize and discuss the main biological characteristics of SARS-CoV-2 and the current scenario of emerging Covid-19 infections, as well as explain the current therapeutic medications treating Covid-19, based on the clinical trial data. © 2021, Turkish Chemical Society. All rights reserved.
J Hare, D Agrawal, A Mishra, S Banerjee, and A Akella
IEEE
We present the design and implementation of Scepter, a system with explicit infrastructure support to reduce energy consumption and improve battery life of mobile devices. Scepter focuses on effective techniques that can reduce the total number of bits transmitted to communicate the same information from a mobile device to a base station. Scepter combines multiple techniques into a single unified architecture by utilizing a stateful proxy located within the infrastructure close to the wireless base station. Scepter intentionally introduces asymmetries in wireless communication tasks between a mobile device and the stateful proxy to provide greater energy advantages to the mobile device. In this work, we have implemented all capabilities of Scepter as various kernel- and user-level enhancements. Our detailed evaluation demonstrates the performance advantages of Scepter. In various experiments with different wireless conditions and traffic patterns, Scepter improves the energy consumption of these devices between 15% and 54%.
Vivek Shrivastava, Nabeel Ahmed, Shravan Rayanchu, Suman Banerjee, Srinivasan Keshav, Konstantina Papagiannaki, and Arunesh Mishra
ACM Press
Enterprise WLANs have made a dramatic shift towards centralized architectures in the recent past. The reasons for such a change have been ease of management and better design of various control and security functions. The data path of WLANs, however, continues to use the distributed, random-access model, as defined by the popular DCF mechanism of the 802.11 standard. While theoretical results indicate that a centrally scheduled data path can achieve higher efficiency than its distributed counterpart, the likely complexity of such a solution has inhibited practical consideration. In this paper, we take a fresh, implementation and deployment oriented, view in understanding data path choices in enterprise WLANs. We perform extensive measurements to characterize the impact of various design choices, like scheduling granularity on the performance of a centralized scheduler, and identify regions where such a centralized scheduler can provide the best gains.
Our detailed evaluation with scheduling prototypes deployed on two different wireless testbeds indicates that DCF is quite robust in many scenarios, but centralization can play a unique role in 1) mitigating hidden terminals - scenarios which may occur infrequently, but become pain points when they do and 2) exploiting exposed terminals - scenarios which occur more frequently, and limit the potential of successful concurrent transmissions. Motivated by these results, we design and implement CENTAUR - a hybrid data path for enterprise WLANs, that combines the simplicity and ease of DCF with a limited amount of centralized scheduling from a unique vantage point. Our mechanisms do not require client cooperation and can support legacy 802.11 clients.
Arunesh Mishra, Shravan Rayanchu, Dheeraj Agrawal, and Suman Banerjee
ACM Press
Continuous mobility scenarios are those in which applications continue to use the radio interface while on the move. With the emergence of Voice-over-WiFi phones, WiFi-enabled music players, and many other such gadgets, continuous mobility is becoming a prevalent mode of operation for WiFi standards. We contend that the existing packetization structures employed in WiFi devices, is not the most suitable for these emerging class of continuous mobility applications. Therefore, in this paper, we suggest a new software-level, standards-compliant extension to the WiFi packetization techniques that provides greater agility and improved performance. In particular, we propose the notion of a multi-rate wireless packet, in which different segments of the same Protocol Data Unit (PDU) are modulated at different physical transmission rates. This is a departure from conventional modulation mechanisms in which the entire PDU is modulated using a single rate. In this paper, we (i) discuss some uses of such a packetization structure for continuous mobility applications, (ii) describe a practical approach to implementing multi-rate wireless packetization in the 802.11 context as a software-only modification that directly leverages current PHY and MAC layer implementations, and (iii) demonstrate the benefits of such an approach with some simple evaluation. We conclude by discussing some of the next steps needed to realize the full potential of this notion.
R. Gandhi, A. Mishra, and S. Parthasarathy
Institute of Electrical and Electronics Engineers (IEEE)
Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. In this paper, we consider the problem of collision-free broadcasting in ad hoc networks. Our objective is to minimize the latency and the number of transmissions in the broadcast. We show that minimum latency broadcasting is NP-complete for ad hoc networks. We also present a simple distributed collision-free broadcasting algorithm for broadcasting a message. For networks with bounded node transmission ranges, our algorithm simultaneously guarantees that the latency and the number of transmissions are within O(1) times their respective optimal values. Our algorithm and analysis extend to the case when multiple messages are broadcast from multiple sources. Experimental studies indicate that our algorithms perform much better in practice than the analytical guarantees provided for the worst case.
Vivek Shrivastava, Dheeraj Agrawal, Arunesh Mishra, Suman Banerjee, and Tamer Nadeem
ACM Press
A wide range of transmit power control (TPC) algorithms have been proposed in recent literature to reduce interference and increase capacity in 802.11 wireless networks. However, few of them have made it to practice. In many cases this gap is attributed to lack of suitable hardware support in wireless cards to implement these algorithms. In particular, many research efforts have indicated that wireless card vendors need to support power control mechanisms in a fine-grained manner - both in the number of possible power levels and the time granularity at which the controls can be applied. In this paper we claim that even if fine-grained power control mechanisms were to be made available by wireless card vendors, algorithms would not be able to properly leverage such degrees of control in typical indoor environments. We prove this claim through rigorous empirical analysis and then build a tunable empirical model (Model-TPC) that can determine the granularity of power control that is actually useful. To illustrate the importance of our solution, we conclude by demonstrating the impact of choice of power control granularity on Internet applications where wireless clients interact with servers on the Internet. We observe that the number of feasible power was found to be between 2-4 for most indoor environments. We believe that the results from this study can serve as the right set of assumptions to build practically realizable TPC algorithms in the future.
Gregory Smith, Anmol Chaturvedi, Arunesh Mishra, and Suman Banerjee
ACM Press
In this paper we describe specific challenges in virtualizing a wireless network and multiple strategies to address them. Among different possible wireless virtualization strategies, our current work in this domain is focussed on a Time-Division Multiplexing (TDM) approach. Hence, we we present our experiences in the design and implementation of such TDM-based wireless virtualization. Our wireless virtualization system is specifically targeted for multiplexing experiments on a large-scale 802.11 wireless testbed facility.
Nabeel Ahmed, Vivek Shrivastava, Arunesh Mishra, Suman Banerjee, Srinivasan Keshav, and Konstantina Papagiannaki
ACM Press
Wireless LANs are commonplace installations in enterprise environments. Their ease of use and deployment, however, are accompanied by a difficulty in their management and security. Proposed solutions to these problems are based on centralization; in the control plane through centralized authentication and allocation of channels and power levels, and in the data plane through time slotted medium access using centralized scheduling for interference mitigation. While centralization of some control plane tasks has been shown to be feasible, centralization on the data plane is significantly harder to realize. This is because it needs to take into account the inherent variability of the wireless medium while offering bounds on delay and jitter on the control paths. In this work, we present a study of the various problems that arise in centralization of the data plane in an enterprise WLAN. We believe that a pragmatic solution for data plane centralization is the key approachto provisioning an enterprise WLAN consisting of a dense deployment of APs.
A. Mishra, V. Brik, S. Banerjee, A. Srinivasan, and W. Arbaugh
IEEE
We propose an efficient client-based approach for channel management (channel assignment and load balancing) in 802.11-based WLANs that lead to better usage of the wireless spectrum. This approach is based on a “conflict set coloring” formulation that jointly performs load balancing along with channel assignment. Such a formulation has a number of advantages. First, it explicitly captures interference effects at clients. Next, it intrinsically exposes opportunities for better channel re-use. Finally, algorithms based on this formulation do not depend on specific physical RF models and hence can be applied efficiently to a wide-range of in-building as well as outdoor scenarios. We have performed extensive packet-level simulations and measurements on a deployed wireless testbed of 70 APs to validate the performance of our proposed algorithms. We show that in addition to single network scenarios, the conflict set coloring formulation is well suited for channel assignment where multiple wireless networks share and contend for spectrum in the same physical space. Our results over a wide range of both simulated topologies and in-building testbed experiments indicate that our approach improves application level performance at the clients by upto three times (and atleast 50%) in comparison to current best-known techniques.
Arunesh Mishra, Vivek Shrivastava, Suman Banerjee, and William Arbaugh
Association for Computing Machinery (ACM)
Many wireless channels in different technologies are known to have partial overlap. However, due to the interference effects among such partially overlapped channels, their simultaneous use has typically been avoided. In this paper, we present a first attempt to model partial overlap between channels in a systematic manner. Through the model, we illustrate that the use of partially overlapped channels is not always harmful. In fact, a careful use of some partially overlapped channels can often lead to significant improvements in spectrum utilization and application performance. We demonstrate this through analysis as well as through detailed application-level and MAC-level measurements. Additionally, we illustrate the benefits of our developed model by using it to directly enhance the performance of two previously proposed channel assignment algorithms --- one in the context of wireless LANs and the other in the context of multi-hop wireless mesh networks. Through detailed simulations, we show that use of partially overlapped channels in both these cases can improve end-to-end application throughput by factors between 1.6 and 2.7 in different scenarios, depending on wireless node density. We conclude by observing that the notion of partial overlap can be the right model of flexibility to design efficient channel access mechanisms in the emerging software radio platforms.
Dheeraj Agrawal, Arunesh Mishra, Kevin Springborn, Suman Banerjee, and Samnrat Ganguly
IEEE
Most wireless meshes will have to operate within the crowded unlicensed spectrum that is also shared by numerous uncoordinated 802.11 hotspots. This creates an unpredictable and variable spectrum space that mesh networks need to co-exist within. We propose a novel method for adapting to such external interference by dynamically changing the assignment of channels to the backbone links, yet retaining the same "logical" network-wide channel assignment. Called Connected- component based Adaption, this method ensures two important properties, (i) Allows distributed changes to the channels used by backbone links depending on local interference, and (ii) Allows a centralized algorithm to dictate the high-level channel and route assignments used by the network as a whole. We propose MeshChop as a randomized algorithm that uses channel hopping to achieve connected-component based adaptation. We show that MeshChop has minimal overheads and provides good link quality and throughput through dynamic adaptation. We present preliminary experimental results which show that MeshChop can achieve almost 80% improvement in throughput over non-adaptive schemes. We believe that component based adaptation using channel hopping is the right method to adapt to local interference conditions without causing network-wide changes.
Arunesh Mishra, Vivek Shrivastava, Dheeraj Agrawal, Suman Banerjee, and Samrat Ganguly
ACM Press
Wireless 802.11 hotspots have grown in an uncoordinated fashion with highly variable deployment densities. Such uncoordinated deployments, coupled with the difficulty of implementing coordination protocols, has often led to conflicting configurations (e.g., in choice of transmission power and channel of operation) among the corresponding Access Points (APs). Overall, such conflicts cause both unpredictable network performance and unfairness among clients of neighboring hotspots. In this paper, we focus on the fairness problem for uncoordinated deployments. We study this problem from the channel assignment perspective. Our solution is based on the notion of channel-hopping, and meets all the important design considerations for control methods in uncoordinated deployments - distributed in nature, minimal to zero coordination among APs belonging to different hotspots, simple to implement, and interoperable with existing standards. In particular, we propose a specific algorithm called MAXchop, which works efficiently when using only non-overlapping wireless channels, but is particularly effective in exploiting partially-overlapped channels that have been proposed in recent literature. We also evaluate how our channel assignment approach complements previously proposed carrier sensing techniques in providing further performance improvements. Through extensive simulations on real hotspot topologies and evaluation of a full implementation of this technique, we demonstrate the efficacy of these techniques for not only fairness, but also the aggregate throughput, metrics.We believe that this is the first work that brings into focus the fairness properties of channel hopping techniques and we hope that the insights from this research will be applied to other domains where a fair division of a system's resources is an important consideration.
M. Shin, J. Ma, A. Mishra, and W.A. Arbaugh
Institute of Electrical and Electronics Engineers (IEEE)
A variety of wireless technologies have been standardized and commercialized, but no single technology is considered the best because of different coverage and bandwidth limitations. Thus, interworking between heterogeneous wireless networks is extremely important for ubiquitous and high-performance wireless communications. Security in interworking is a major challenge due to the vastly different security architectures used within each network. The goal of this paper is twofold. First, we provide a comprehensive discussion of security problems and current technologies in 3G and WLAN systems. Second, we provide introductory discussions about the security problems in interworking, the state-of-the-art solutions, and open problems.
Arunesh Mishra, Nick L. Petroni, William A. Arbaugh, and Timothy Fraser
Wiley
In the past few years, wireless networks, specifically those based on the IEEE 802.11 standard, have experienced tremendous growth. However, numerous security problems have dampened this growth. The IEEE and vendors sensitive to these issues began a wholesale redesign of the security architecture, while simultaneously producing measures for mitigating existing problems. In this paper, we describe the past and future security architectures as well as the problems and concerns with both. Copyright © 2004 John Wiley & Sons, Ltd.