—In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetim...
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
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 ...
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 ...
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...