Energy Efficient Network Reconfiguration for Mostly-Off Sensor Networks. Li, Y., Ye, W., & Heidemann, J. In Proceedings of the ThirdIEEE Conference on Sensor and Adhoc Communication and Networks , pages 527–535, Reston, Virginia, USA, September, 2006. IEEE.
Energy Efficient Network Reconfiguration for Mostly-Off Sensor Networks [link]Paper  doi  abstract   bibtex   
A new class of sensor network applications are \emphmostly off. Exemplified by Intel's FabApp, in these applications the network alternates between being off for hours or weeks, then activating to collect data for a few minutes. While configuration of traditional sensornet applications is occasional and so need not be optimized, these applications may spend half their time while awake configuring, so they require new approaches to \emphquickly restart after a long downtime, in effect, ``sensor network suspend and resume''. While there are many network services that may need to be restarted, this paper focuses on the key question of when the network can determine that all nodes are now awake and ready to interact. Current resume approaches assume worst-case clock drift and so must conservatively take minutes to reconfigure after a month-long sleep. We propose two energy efficient reconfiguration protocols to address this challenge. The first approach is \emphlow-power listening with flooding, where the network restarts quickly by flooding a control message as soon as one node can determine the whole network is up. The second protocol uses \emphlocal update with suppression, where nodes only notify their one-hop neighbors about the network state, avoiding the cost of flooding. Both protocols are fully distributed algorithms. Through analysis and simulations, we show that both protocols are more energy efficient than current approaches. Flooding works best in \emphsparse networks with 6 neighbors or less, while local update with suppression works best in \emphdense networks (more than 6 neighbors).
@InProceedings{Li06a,
	author = 	"Yuan Li and Wei Ye and John Heidemann",
	title = 	"Energy Efficient Network Reconfiguration for Mostly-Off Sensor Networks",
	booktitle = 	"Proceedings of the " # "Third" # " IEEE Conference on Sensor and Adhoc Communication and Networks ",
	year = 		2006,
	sortdate = "2006-09-01",
	project = "ilense, snuse, cisoft",
	jsubject = "sensornet_subtransport",
	publisher =	"IEEE",
	address =	"Reston, Virginia, USA",
	month =		sep,
	pages =		"527--535",
	location =	"johnh: pafile",
	keywords =	"fabapp, fastbootmac, scp-mac",
	doi = "10.1109/SAHCN.2006.288509",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Li06a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Li06a.pdf",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
A new class of sensor network applications are \emph{mostly off}.
Exemplified by Intel's FabApp, in these applications the network
alternates between being off for hours or weeks, then activating to
collect data for a few minutes.  While configuration of traditional
sensornet applications is occasional and so need not be optimized,
these applications may spend half their time while awake configuring,
so they require new approaches to \emph{quickly} restart after a long
downtime, in effect, ``sensor network suspend and resume''.  While
there are many network services that may need to be restarted, this
paper focuses on the key question of when the network can determine
that all nodes are now awake and ready to interact.  Current resume
approaches assume worst-case clock drift and so must conservatively
take minutes to reconfigure after a month-long sleep.  We propose two
energy efficient reconfiguration protocols to address this challenge.
The first approach is \emph{low-power listening with flooding}, where
the network restarts quickly by flooding a control message as soon as
one node can determine the whole network is up.  The second protocol
uses \emph{local update with suppression}, where nodes only notify
their one-hop neighbors about the network state, avoiding the cost of
flooding.  Both protocols are fully distributed algorithms.  Through
analysis and simulations, we show that both protocols are more energy
efficient than current approaches.  Flooding works best in
\emph{sparse} networks with 6 neighbors or less, while local update
with suppression works best in \emph{dense} networks (more than 6
neighbors).
",
}

Downloads: 0