Design and Evaluation of Network Reconfiguration Protocols for Mostly-Off Sensor Networks. Li, Y., Ye, W., Heidemann, J., & Kulkarni, R. Computer Networks, December, 2007. accepted in 2007, to appear in 2008
Design and Evaluation of Network Reconfiguration Protocols for Mostly-Off Sensor Networks [link]Paper  doi  abstract   bibtex   
A new class of sensor network applications is \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 active time in reconfiguration every time when they wake up. Therefore, new approaches are required to efficiently ``resume'' a sensor network that has been ``suspended'' for long time. This paper focuses on the key question of when the network can determine that all nodes are awake and ready to communicate. Existing approaches assume worst-case clock drift, and so must conservatively wait for minutes before starting an application. We propose two reconfiguration protocols to largely reduce the energy cost during the process. The first approach is \emphlow-power listening with flooding, where the network restarts quickly by flooding a control message as soon as the first node determines that the whole network is up. The second protocol uses \emphlocal update with suppression, where nodes only notify their one-hop neighbors, avoiding the cost of flooding. Both protocols are fully distributed algorithms. Through analysis, simulation and testbed experiments, 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).
@Article{Li07a,
	author = 	"Yuan Li and Wei Ye and John Heidemann and Rohit Kulkarni",
	title = 	"Design and Evaluation of Network Reconfiguration Protocols for Mostly-Off Sensor Networks",
	journal = 	"Computer Networks",
	year = 		2007,
	sortdate = "2007-12-01",
	project = "ilense, snuse, cisoft",
	jsubject = "chronological",
	month = dec,
	pages =		"to appear",
	note = "accepted in 2007, to appear in 2008",
	location =	"johnh: pafile",
	keywords =	"fabapp, fastbootmac, scp-mac",
	doi = "doi:10.1016/j.adhoc.2007.11.009",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Li07a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Li07a.pdf",
	abstract = "
A new class of sensor network applications is \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 active time in reconfiguration
every time when they wake up.  Therefore, new approaches are required
to efficiently ``resume'' a sensor network that has been ``suspended''
for long time.  This paper focuses on the key question of when the
network can determine that all nodes are awake and ready to
communicate.  Existing approaches assume worst-case clock drift, and
so must conservatively wait for minutes before starting an
application.  We propose two reconfiguration protocols to largely
reduce the energy cost during the process.  The first approach is
\emph{low-power listening with flooding}, where the network restarts
quickly by flooding a control message as soon as the first node
determines that the whole network is up.  The second protocol uses
\emph{local update with suppression}, where nodes only notify their
one-hop neighbors, avoiding the cost of flooding.  Both protocols are
fully distributed algorithms.  Through analysis, simulation and
testbed experiments, 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