This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
The localization requirements for mobile nodes in wireless (sensor) networks are increasing. However, most research works are based on range measurements between nodes which are o...
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...