Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks. Xu, Y., Heidemann, J., & Estrin, D. Technical Report 527, USC/Information Sciences Institute, October, 2000.
Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks [link]Paper  abstract   bibtex   
In this paper, we present two algorithms for routing in energy-constrained, ad hoc, wireless networks. Nodes running our algorithms can trade off energy dissipation and data delivery quality according to application requirements. Our algorithms work above existing on-demand ad hoc routing protocols, such as AODV and DSR, without modification to the underlying routing protocols. Our major contributions are: algorithms that \emphturn off the radio to reduce energy consumption with the involvement of \emphapplication-level information, and the additional \emphuse of node deployment density to adaptively adjust routing fidelity to extend network lifetime. Algorithm analysis and simulation studies show that our energy-conserving algorithms can consume as little as 50% of the energy of an unmodified ad hoc routing protocol. Moreover, simulations of adaptive fidelity suggest that greater node density can be used to increase network lifetime; in one example a four-fold increase in density doubles network lifetime.
@TechReport{Xu00a,
	author = 	"Ya Xu and John Heidemann and Deborah Estrin",
	title = 	"Adaptive Energy-Conserving Routing for
                         Multihop Ad Hoc Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2000,
	sortdate = "2000-10-01",
	project = "ilense, nocredit, scadds",
	jsubject = "sensornet_subtransport",
	type =		"Research Report",
	number =	527,
	month =		oct,
	location =	"johnh: pafile",
	location =	"johnh: folder: xxx",
	keywords =	"vint, networks simulation, data diffusion,
                         adaptive fidelity",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.html",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.ps.gz",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
In this paper, we present two algorithms for routing in
energy-constrained, ad hoc, wireless networks.  Nodes running our
algorithms can trade off energy dissipation and data delivery quality
according to application requirements.  Our algorithms work above
existing on-demand ad hoc routing protocols, such as AODV and DSR,
without modification to the underlying routing protocols.  Our major
contributions are: algorithms that \emph{turn off} the radio to reduce
energy consumption with the involvement of \emph{application-level
information}, and the additional \emph{use of node deployment density}
to adaptively adjust routing fidelity to extend network lifetime.
Algorithm analysis and simulation studies show that our
energy-conserving algorithms can consume as little as 50\% of the
energy of an unmodified ad hoc routing protocol. Moreover, simulations
of adaptive fidelity suggest that greater node density can be used to
increase network lifetime; in one example a four-fold increase in
density doubles network lifetime.
",
}

Downloads: 0