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...
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...