DAO2: Overcoming Overall Storage Overflow in Intermittently Connected Sensor Networks

Many emerging sensor network applications operate in challenging environments wherein the base station is unavailable. Data generated from such intermittently connected sensor networks (ICSNs) must be stored inside the network for some unpredictable time before uploading opportunities become available. Consequently, sensory data could overflow the limited storage capacity available in the entire network, making discarding valuable data inevitable. To overcome such overall storage overflow in ICSNs, we propose and study a new algorithmic framework called
d
ata
a
ggregation for
o
verall storage
o
verflow (
$\text {DAO}^{2}$
). Utilizing spatial data correlation that commonly exists among sensory data,
$\text {DAO}^{2}$
employs data aggregation techniques to reduce the overflow data size while minimizing the total energy consumption in data aggregation. At the core of our framework are two new graph theoretical problems that have not been studied. We refer to them as
t
raveling
s
alesmen
p
lacement
p
roblem (
$\text {TSP}^{2}$
) and quota traveling salesmen placement problem (Q-
$\text {TSP}^{2}$
). Different from the well-known multiple traveling salesman problem (mTSP) and its variants, which mainly focus on the routing of multiple salesmen initially located at fixed locations,
$\text {TSP}^{2}$
and Q-
$\text {TSP}^{2}$
must decide the placement as well as the routing of the traveling salesmen. We prove that both problems are NP-hard and design approximation, heuristic, and distributed algorithms. Our algorithms outperform the state-of-the-art data aggregation work with base stations by up to 71.8% in energy consumption.