We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
The control of robot swarming in a distributed manner is a difficult problem because global behaviors must emerge as a result of many local actions. This paper uses a bio-inspired ...
Wei-Min Shen, Peter M. Will, Aram Galstyan, Cheng-...
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
Many sensor nodes contain resource constrained microcontrollers where user level applications, operating system components, and device drivers share a single address space with no...