Learn More
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the <italic>positions</italic> of routers and a packet's destination to make packet forwarding decisions. GPSR makes <italic>greedy</italic> forwarding decisions using only information about a router's immediate neighbors in the network(More)
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are &#8220;optimistic&#8221; in the sense that they rely mainly on transaction backup as a control mechanism, &#8220;hoping&#8221; that(More)
In this paper, the <italic>red-blue pebble game</italic> is proposed to model the input-output complexity of algorithms. Using the pebble game formulation, a number of lower bound results for the I/O requirement are proven. For example, it is shown that to perform the n-point FFT or the ordinary n&#215;n matrix multiplication algorithm with O(S) memory, at(More)
f High-performance, special-purpose computer systems are typically used to meet specific application requirements or to off-load computations that are especially taxing to general-purpose computers. As hardware cost and size continue to drop and processing requirements become well-understood in areas such as signal and image processing, more special-purpose(More)
We apply sensor networks to the problem of tracking moving objects. We describe a publish-and-subscribe tracking method, called Scalable Tracking Using Networked Sensors (STUN), that scales well to large numbers of sensors and moving objects by using hierarchy. We also describe a method, called drain-and-balance (DAB), for building efficient tracking(More)