How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
Vipin does research in Telecommunications Engineering, Computer Engineering and Communication Engineering. Their most recent publication is 'Analysis of open source drivers for IEEE 802.11 WLANs.'
Tokens are popular in two factor authentication, where the first authentication credential is a fixed secret key s<sub>1</sub> associated with the user and the second authentication credential is a dynamic secret key s<sub>2</sub> generated by the token assigned to the user. Popular hardware tokens use a synchronized clock T along with a static sec...
The purpose of this study is to analyze the open source IEEE 802.11 wireless local area network (WLAN) stack implementation for further enhancement and implementations. We discuss the IEEE 802.11 WLAN implementation in the latest Linux kernel. This includes a functional breakdown of the driver and the overall flow of information via functions. We a...
In this article we propose a method for measuring internet connection stability which is fast and has negligible overhead for the process of its complexity. This method finds a relative value for representing the stability of internet connections and can also be extended for aggregated internet connections. The method is documented with help of a r...
Checking the integrity of a file on a remote untrusted or compromised server is to be achieved with minimal computational and storage requirements on part of a healthy verifier. Existing solutions are time and storage intensive. A fast protocol comprising of maximum period linear congruence generators and linear feedback shift registers with compac...
The nodes in a mobile ad hoc network (MANET) have limited processing power, memory and transmission range. The mobile nodes may dynamically enter or leave the ad hoc network. To improve the resilience of the ad-hoc networks to mobility, node and link failure, we propose an algorithm involving binary trees and a special form of cycles in the network...