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)
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 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)
—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%. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage of(More)
—With the maturation of online social networks (OSNs), people have begun to form online communities and look for assistance at a particular place and time from people they only know virtually. However, seeking for such help on existing OSN infrastructures has some disadvantages including loss of privacy (in terms of both location as well as the nature of(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)
  • 1