#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2004

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sukumar Ghosh, Kevin M. Lillis, Saurav Pandit, Sriram V. Pemmaraju
- OPODIS
- 2004

Topology control protocols attempt to reduce the energy consumption of nodes in an ad-hoc wireless network while maintaining sufficient network connectivity. Topology control protocols with various features have been proposed, but they all lack robustness and are extremely sensitive to faulty information from neighbors. For example, the XTC protocol (R.… (More)

- Kevin M. Lillis, Sriram V. Pemmaraju
- OPODIS
- 2005

Topology control is the problem of selecting neighbors for each node in a wireless network, so that the resulting network has a number of useful properties. More precisely, a topology control protocol P takes as input a network G and aims to construct a spanning subgraph GP , that is sparse, “energy minimizing” and has sufficient connectivity so as to… (More)

When a two-photon excited fluorescence (TPEF) microscope is used to image deep inside tissue, out-of-focus background can arise from both ballistic and nonballistic excitation. We propose a solution to largely reject TPEF background in thick tissue. Our technique is based on differential-aberration imaging with a deformable mirror. By introducing extraneous… (More)

- Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pirwani
- ADHOC-NOW
- 2007

We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance. QUDGs (short for Quasi Unit Disk Graphs) generalize Unit Disk Graphs and permit more realistic modeling of wireless networks, allowing for imperfect and non-uniform transmission… (More)

- Kevin M. Lillis, Sriram V. Pemmaraju
- WEA
- 2008

Greedy routing protocols for wireless sensor networks (WSNs) are fast and efficient but in general cannot guarantee message delivery. Hence researchers are interested in the problem of embedding WSNs in low dimensional space (e.g., R) in a way that guarantees message delivery with greedy routing. It is well known that Delaunay triangulations are such… (More)

- Kevin Lillis
- 2004

The first two papers ([21] and [33]) present a local algorithm for constructing a bounded degree planar spanner. Previous work produced only centralized methods for the construction of such topologies [1]. The third paper ([16]) presents a routing algorithm that currently provides the best technique for combining greedy and face routing in ad-hoc wireless… (More)

- ‹
- 1
- ›