Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks. Xu, Y., Heidemann, J., & Estrin, D. Technical Report 527, USC/Information Sciences Institute, October, 2000. 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
{"_id":"pvsPR2Ydhso5ocikc","bibbaseid":"xu-heidemann-estrin-adaptiveenergyconservingroutingformultihopadhocnetworks-2000","author_short":["Xu, Y.","Heidemann, J.","Estrin, D."],"bibdata":{"bibtype":"techreport","type":"Research Report","author":[{"firstnames":["Ya"],"propositions":[],"lastnames":["Xu"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]},{"firstnames":["Deborah"],"propositions":[],"lastnames":["Estrin"],"suffixes":[]}],"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","number":"527","month":"October","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 \\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. ","bibtex":"@TechReport{Xu00a,\n\tauthor = \t\"Ya Xu and John Heidemann and Deborah Estrin\",\n\ttitle = \t\"Adaptive Energy-Conserving Routing for\n Multihop Ad Hoc Networks\",\n\tinstitution = \t\"USC/Information Sciences Institute\",\n\tyear = \t\t2000,\n\tsortdate = \"2000-10-01\",\n\tproject = \"ilense, nocredit, scadds\",\n\tjsubject = \"sensornet_subtransport\",\n\ttype =\t\t\"Research Report\",\n\tnumber =\t527,\n\tmonth =\t\toct,\n\tlocation =\t\"johnh: pafile\",\n\tlocation =\t\"johnh: folder: xxx\",\n\tkeywords =\t\"vint, networks simulation, data diffusion,\n adaptive fidelity\",\n\turl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.html\",\n\tpsurl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.ps.gz\",\n\tpdfurl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.pdf\",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tcopyrightholder = \"authors\",\n\tabstract = \"\nIn this paper, we present two algorithms for routing in\nenergy-constrained, ad hoc, wireless networks. Nodes running our\nalgorithms can trade off energy dissipation and data delivery quality\naccording to application requirements. Our algorithms work above\nexisting on-demand ad hoc routing protocols, such as AODV and DSR,\nwithout modification to the underlying routing protocols. Our major\ncontributions are: algorithms that \\emph{turn off} the radio to reduce\nenergy consumption with the involvement of \\emph{application-level\ninformation}, and the additional \\emph{use of node deployment density}\nto adaptively adjust routing fidelity to extend network lifetime.\nAlgorithm analysis and simulation studies show that our\nenergy-conserving algorithms can consume as little as 50\\% of the\nenergy of an unmodified ad hoc routing protocol. Moreover, simulations\nof adaptive fidelity suggest that greater node density can be used to\nincrease network lifetime; in one example a four-fold increase in\ndensity doubles network lifetime.\n\",\n}\n\n","author_short":["Xu, Y.","Heidemann, J.","Estrin, D."],"bibbaseid":"xu-heidemann-estrin-adaptiveenergyconservingroutingformultihopadhocnetworks-2000","role":"author","urls":{"Paper":"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.html"},"keyword":["vint","networks simulation","data diffusion","adaptive fidelity"],"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":["vint","networks simulation","data diffusion","adaptive fidelity"],"search_terms":["adaptive","energy","conserving","routing","multihop","hoc","networks","xu","heidemann","estrin"],"title":"Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks","year":2000}