Ashok K. Agrawala - Academia.edu (original) (raw)

Ashok K. Agrawala

Uploads

Papers by Ashok K. Agrawala

Research paper thumbnail of Equivalence of Hough curve detection to template matching

Communications of The ACM, Nov 1, 1977

Research paper thumbnail of Modeling context and situations in pervasive computing environments

arXiv (Cornell University), Mar 24, 2015

Research paper thumbnail of Two Conversational Languages for Control-Theoretical Computations in the Time-Sharing Mode

Research paper thumbnail of Multiscale Analysis for Wireless LAN Traffic Characterization

Research paper thumbnail of Capacity and Variability Analysis of the IEEE 802.11 MAC Protocol

Research paper thumbnail of Information Dynamics: An Information-Centric Approach to System Design

Research paper thumbnail of On the Optimality of WLAN Location Determination Systems

Research paper thumbnail of A Study of Permutations Permissible by LIFO Service Disciplines

Research paper thumbnail of Scheduling in Real-Time Distributed Systems - A Review

Research paper thumbnail of Time-based location techniques using inexpensive, unsynchronized clocks in wireless networks

Research paper thumbnail of Scheduling aperiodic and sporadic tasks in hard real-time systems

Research paper thumbnail of Energy-Efficient Reliable Paths for On-Demand Routing Protocols

Research paper thumbnail of Temporal Analysis on Topics Using Word2Vec

arXiv (Cornell University), Sep 23, 2022

Research paper thumbnail of Ýòòññ Êêêð¹ììññ Ë Blockinùððòò Ò ×øöööùøøø Òúúöóòññòø×

Research paper thumbnail of Energy Efficient IP-Connectivity with IEEE 802.11 for Home M2M Networks

The Computer Journal, 2017

Research paper thumbnail of A guide to major job accounting systems

Research paper thumbnail of A cooperative framework to scale multi-party applications

We define a framework to implement multi-party applications in which cooperation between applicat... more We define a framework to implement multi-party applications in which cooperation between application peers is leveraged to achieve scalability. In this framework, the peers cooperate by devoting a part of their own resources to be used by other peers of the same application group. Through detailed analysis, simulations, and implementations, we demonstrate that applications implemented using this approach can achieve significant performance benefits. There are two major aspects to scalably implement cooperative applications—resource provisioning and management, and handling the impact of peer failures on application performance. In this thesis we define efficient techniques to address both these aspects. Resource limitation is the most typical reason that constrain the scalability of applications. Therefore we first study resource provisioning and management at application peers. We do this using two examples. The first example application is the group key distribution problem that arises in secure group communication systems. Our proposed solution to this problem is based on the cooperative approach and is, therefore, fundamentally different from all existing solutions to this problem. We perform detailed comparisons with best-known existing techniques to demonstrate that our proposed scheme incurs the least processing, storage and communication overheads. As a second example we examine the one-many data transfer problem. We proposed a scalable solution to this problem using a cooperative approach known as application-layer multicast. This solution constructs provably efficient data delivery structures, guarantees low control overheads, and is the most scalable application-layer multicast protocol known today. Next we study the impact of peer failures on application performance. While the cooperative model for multi-party applications enables scalability, it adds dependencies between application peers. Consequently failures of some peers affect the performance at other peers. Efficient failure recovery techniques, therefore, form an important component of cooperation-based implementations of multi-party applications. We examine this aspect of cooperative applications using the application-layer multicast example. We define a simple, robust, low-overhead data recovery technique that efficiently handles failures of application peers. (Abstract shortened by UMI.)

Research paper thumbnail of Locus: robust and calibration-free indoor localization, tracking and navigation for multi-story buildings

Journal of Location Based Services, 2015

A fundamental goal of indoor localisation technology is to achieve the milestone of combining min... more A fundamental goal of indoor localisation technology is to achieve the milestone of combining minimal cost with accuracy sufficient enough for general consumer applications. To achieve this, current indoor positioning systems need either extensive calibration or expensive hardware. Moreover, very few systems built so far have addressed floor determination in multi-story buildings. In this paper, we explain a Wi-fi-based indoor localisation, tracking and navigation system for multi-story buildings called Locus. Locus determines a device’s floor as well as location on that floor using existing knowledge of infrastructure, and without requiring any calibration or proprietary hardware. It is an inexpensive solution with minimum set-up and maintenance expenses, is scalable, readily deployable and robust to environmental changes. Experimental results in three different buildings spanning multiple floors show that it can determine the floor with 95.33% accuracy and the location on the floor with an error of 6.49 m on an average in real-life practical environments. We also demonstrate its utility via two location-based applications for indoor navigation and tracking in emergency scenarios.

Research paper thumbnail of Bootstrapped Discovery and Ranking of Relevant Services and Information in Context-aware Systems

Proceedings of the 12th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, 2015

Research paper thumbnail of Learning techniques in multi-armed bandits

Research paper thumbnail of Equivalence of Hough curve detection to template matching

Communications of The ACM, Nov 1, 1977

Research paper thumbnail of Modeling context and situations in pervasive computing environments

arXiv (Cornell University), Mar 24, 2015

Research paper thumbnail of Two Conversational Languages for Control-Theoretical Computations in the Time-Sharing Mode

Research paper thumbnail of Multiscale Analysis for Wireless LAN Traffic Characterization

Research paper thumbnail of Capacity and Variability Analysis of the IEEE 802.11 MAC Protocol

Research paper thumbnail of Information Dynamics: An Information-Centric Approach to System Design

Research paper thumbnail of On the Optimality of WLAN Location Determination Systems

Research paper thumbnail of A Study of Permutations Permissible by LIFO Service Disciplines

Research paper thumbnail of Scheduling in Real-Time Distributed Systems - A Review

Research paper thumbnail of Time-based location techniques using inexpensive, unsynchronized clocks in wireless networks

Research paper thumbnail of Scheduling aperiodic and sporadic tasks in hard real-time systems

Research paper thumbnail of Energy-Efficient Reliable Paths for On-Demand Routing Protocols

Research paper thumbnail of Temporal Analysis on Topics Using Word2Vec

arXiv (Cornell University), Sep 23, 2022

Research paper thumbnail of Ýòòññ Êêêð¹ììññ Ë Blockinùððòò Ò ×øöööùøøø Òúúöóòññòø×

Research paper thumbnail of Energy Efficient IP-Connectivity with IEEE 802.11 for Home M2M Networks

The Computer Journal, 2017

Research paper thumbnail of A guide to major job accounting systems

Research paper thumbnail of A cooperative framework to scale multi-party applications

We define a framework to implement multi-party applications in which cooperation between applicat... more We define a framework to implement multi-party applications in which cooperation between application peers is leveraged to achieve scalability. In this framework, the peers cooperate by devoting a part of their own resources to be used by other peers of the same application group. Through detailed analysis, simulations, and implementations, we demonstrate that applications implemented using this approach can achieve significant performance benefits. There are two major aspects to scalably implement cooperative applications—resource provisioning and management, and handling the impact of peer failures on application performance. In this thesis we define efficient techniques to address both these aspects. Resource limitation is the most typical reason that constrain the scalability of applications. Therefore we first study resource provisioning and management at application peers. We do this using two examples. The first example application is the group key distribution problem that arises in secure group communication systems. Our proposed solution to this problem is based on the cooperative approach and is, therefore, fundamentally different from all existing solutions to this problem. We perform detailed comparisons with best-known existing techniques to demonstrate that our proposed scheme incurs the least processing, storage and communication overheads. As a second example we examine the one-many data transfer problem. We proposed a scalable solution to this problem using a cooperative approach known as application-layer multicast. This solution constructs provably efficient data delivery structures, guarantees low control overheads, and is the most scalable application-layer multicast protocol known today. Next we study the impact of peer failures on application performance. While the cooperative model for multi-party applications enables scalability, it adds dependencies between application peers. Consequently failures of some peers affect the performance at other peers. Efficient failure recovery techniques, therefore, form an important component of cooperation-based implementations of multi-party applications. We examine this aspect of cooperative applications using the application-layer multicast example. We define a simple, robust, low-overhead data recovery technique that efficiently handles failures of application peers. (Abstract shortened by UMI.)

Research paper thumbnail of Locus: robust and calibration-free indoor localization, tracking and navigation for multi-story buildings

Journal of Location Based Services, 2015

A fundamental goal of indoor localisation technology is to achieve the milestone of combining min... more A fundamental goal of indoor localisation technology is to achieve the milestone of combining minimal cost with accuracy sufficient enough for general consumer applications. To achieve this, current indoor positioning systems need either extensive calibration or expensive hardware. Moreover, very few systems built so far have addressed floor determination in multi-story buildings. In this paper, we explain a Wi-fi-based indoor localisation, tracking and navigation system for multi-story buildings called Locus. Locus determines a device’s floor as well as location on that floor using existing knowledge of infrastructure, and without requiring any calibration or proprietary hardware. It is an inexpensive solution with minimum set-up and maintenance expenses, is scalable, readily deployable and robust to environmental changes. Experimental results in three different buildings spanning multiple floors show that it can determine the floor with 95.33% accuracy and the location on the floor with an error of 6.49 m on an average in real-life practical environments. We also demonstrate its utility via two location-based applications for indoor navigation and tracking in emergency scenarios.

Research paper thumbnail of Bootstrapped Discovery and Ranking of Relevant Services and Information in Context-aware Systems

Proceedings of the 12th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, 2015

Research paper thumbnail of Learning techniques in multi-armed bandits

Log In