Srikanth K. Iyer

Learn More
In a sensor network, the points in the operational area that are suitably sensed are a two-dimensional spatial coverage process. For randomly deployed sensor networks, typically, the network coverage of two-dimensional areas is analyzed. However, in many sensor network applications, e.g., tracking of moving objects, the sensing process on paths, rather than(More)
Genetic algorithms (GAs) are search heuristics used to solve global optimization problems in complex search spaces. We wish to show that the eeciency of GAs in solving a owshop problem can be improved signiÿcantly by tailoring the various GA operators to suit the structure of the problem. The owshop problem is one of scheduling jobs in an assembly line with(More)
We consider evolving exponential RGGs in one dimension and characterize the time dependent behavior of some of their topological properties. We consider two evolution models and study one of them detail while providing a summary of the results for the other. In the first model, the inter-nodal gaps evolve according to an exponential AR(1) process that makes(More)
We consider the clustering properties of one-dimensional sensor networks where the nodes are randomly deployed. Unlike most other work on randomly deployed networks, ours assumes that the node locations are drawn from a non uniform distribution. Specifically, we consider an exponential distribution. We first obtain the probability that there exists a path(More)
We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Θ(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Θ(√n) time units. We further extend our approach to a network with noisy links. While the(More)
Recently Jammalamadaka and Mangalam (2003) introduced a general censoring scheme called the " middle-censoring " scheme in non-parametric set up. In this paper we consider this middle censoring scheme when the lifetime distribution of the items are exponentially distributed and the censoring mechanism is independent and non-informative. In this set up, we(More)
In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for the signal-to-interference-plus-noise-ratio (SINR) model with node locations distributed according to a Poisson point(More)