We consider a mobile, autonomous searcher that aims to find the source of a broadcast
message in a network of location-agnostic wireless sensor nodes. In certain types of …

In this paper we consider the problem of searching for a node or an object (ie, piece of data,
file, etc.) in a large wireless network. We consider the class of controlled flooding search …

In this paper, we address a fundamental problem concerning the best flooding strategy to
minimize cost and latency for target discovery in wireless networks. Should we flood the …

In this paper, we consider the problem of information discovery in wireless sensor networks
(WSNs), where the search initiator is unaware of any of the gamma locations of target …

In this paper, we consider the problem of information discovery in densely deployed and
delay-tolerant Wireless Sensor Network (WSN), where the initiator of search is unaware of …

We consider repeated one-shot queries for an identifiable object or named datum in a
wireless sensor network. If there is no underlying pattern, querying for such data can be an …

In this paper, we address how to design a distributed movement strategy for mobile
collectors, which can be either physical mobile agents or query/collector packets periodically …

We consider the mobile data gathering problem in large-scale wireless sensor networks with
static sensor nodes and a mobile patrol node. Based on the assumptions that (a) the sensor …

We consider the problem of a user searching for information over a sensor network, where
the user does not have prior knowledge of the location of the information. We consider three …

Given n sensors and m targets, a monitoring schedule is a partition of the sensor set such
that each part of the partition can monitor all targets. Monitoring schedules are used to …