In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....
Yong Yang, Lili Wang, Dong Kun Noh, Hieu Khac Le, ...
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
— Relative bearing between robots is important in applications like pursuit-evasion [11] and SLAM [7]. This is also true in in sensor networks, where the bearing of one sensor no...
This paper deals with clustering of spatially distributed data using wireless sensor networks. A distributed low-complexity clustering algorithm is developed that requires one-hop...
Pedro A. Forero, Alfonso Cano, Georgios B. Giannak...
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...