Abhishek Samanta

Learn More
Blind rendezvous is a fundamental problem in cognitive radio networks. The problem involves a collection of agents (radios) that wish to discover each other (i.e., rendezvous) in the blind setting where there is no shared infrastructure and they initially have no knowledge of each other. Time is divided into discrete slots and spectrum is divided into(More)
In sensor networks communication by broadcast methods involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collision namely ARBP, where the best achieved success rate is 90%. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage of(More)
We present a framework for non-asymptotic analysis of real-world wireless networks that captures protocol overhead, congestion bottlenecks, traffic heterogeneity and other real-world concerns. The framework introduces the definition of <i>symptotic</i><sup>1</sup> <i>scalability</i>, and a metric called <i>change impact value</i> (CIV) for comparing the(More)
In sensor networks communication by broadcast method involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collision namely ARBP, where the best achieved success rate is 90&#x025;. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage(More)
In the short span of less than a decade the mobile phone has become a ubiquitous feature of life in India. Everyone from the chai-wallah to the CEO has a cell-phone and in recent years many of these are smart-phones capable of running smart-apps. Our focus is on conceiving a practical and useful app that can aid in disaster prevention and actually(More)
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with applications in workflow systems and services research, which are duals of each other. The first problem looks at merging the maximum number of vertices in two DAGs (directed acyclic(More)
We present a framework for non-asymptotic analysis of real-world multi-hop wireless networks that captures protocol overhead, congestion bottlenecks, traffic heterogeneity and other real-world concerns. The framework introduces the concept of symptotic scalability to determine the number of nodes to which a network scales, and a metric called change impact(More)
In reality, perfect source of randomness is hard to find. So, for real life applications, an imperfect source X of min-entropy k is converted into usable m-bit cryptographic key for some underlying application P . If P has security δ (against some class of attackes) with uniform random m-bit key, our goal is to design a key derivation function (KDF) h that(More)
We present a framework for non-asymptotic analysis of realworld wireless networks that captures protocol overhead, congestion bottlenecks, traffic heterogeneity and other real-world concerns. The framework introduces the definition of symptotic 1 scalability, and a metric called change impact value (CIV) for comparing the impact of underlying system(More)