B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
— In this paper, a distributed power control algorithm is proposed for wireless relay networks in interference-limited environments. The objective is to minimize the total transm...
—In this paper we present a technique for improving the location performance based on the Global Positioning System (GPS) for networks of nodes in harsh environments and demonstr...
Christopher L. Hutchens, Brian R. Sarbin, Alyse C....