We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
Abstract. We propose a lightweight localisation approach for supporting distance and range queries in ad hoc wireless sensor networks. In contrast to most previous localisation app...
Urs Bischoff, Martin Strohbach, Mike Hazas, Gerd K...
Many real-world applications for sensor networks require event sampling with sufficient resolution over both spatial and temporal dimensions. When the deployed nodes are insuffi...
—The problems of energy efficient sensor network configuration and local fusion of sensed data have been addressed separately in the previous works. In this paper, we propose t...
Xiaodong Wang, Demin Wang, Yun Wang, Dharma P. Agr...