@TechReport{Li04b,
	author = 	"Yuan Li and Wei Ye and John Heidemann",
	title = 	"Energy and Latency Control in Low Duty Cycle {MAC} Protocols",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = "2007-05-01",
	project = "ilense, macss, cisoft",
	jsubject = "sensornet_subtransport",
	number =	"ISI-TR-2004-595",
	month =		sep,
	location =	"johnh: folder: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.pdf",
	otherurl = "http://www-scf.usc.edu/%7eyuanl/myresearch/smac_schedules.pdf",
	copyrightholder = "authors",
	myorganization = 	"USC/Information Sciences Institute",
	abstract = "
Recently, several MAC protocols such as S-MAC and T-MAC have exploited
scheduled sleep/wakeup cycles to conserve energy in sensor
networks. Until now, most protocols have assumed all nodes in the
network were configured to follow the same schedule, or they assumed
border nodes would follow multiple schedules, but did not evaluate
those cases. This paper develops two new algorithms to control and
exploit the presence of multiple schedules to reduce energy
consumption and latency. The first one is
the \emph{global schedule algorithm} (GSA).
Through experiments, we demonstrate that, because of
radio propagation vagaries, large sensor networks have very ragged,
overlapping borders where many nodes listen to two or more
schedules. GSA is a fully distributed algorithm that allows a large
network to converge on a single global schedule to conserve
energy. Secondly, we demonstrate that strict schedules incur a latency
penalty in a multi-hop network when packets must wait for the next
schedule for transmission.  To reduce latency in multi-hop paths we
develop the \emph{fast path algorithm} (FPA). FPA provides fast data
forwarding paths by adding additional wake-up periods on the nodes
along paths from sources to sinks. We evaluate both algorithms through
experiments on Berkeley motes and demonstrate that the protocols
accomplish their goals of reducing energy consumption and latency in
large sensor networks.
",
}

{"_id":"jHThkxWMA75KDEKvZ","bibbaseid":"li-ye-heidemann-energyandlatencycontrolinlowdutycyclemacprotocols-2004","author_short":["Li, Y.","Ye, W.","Heidemann, J."],"bibdata":{"bibtype":"techreport","type":"techreport","author":[{"firstnames":["Yuan"],"propositions":[],"lastnames":["Li"],"suffixes":[]},{"firstnames":["Wei"],"propositions":[],"lastnames":["Ye"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Energy and Latency Control in Low Duty Cycle MAC Protocols","institution":"USC/Information Sciences Institute","year":"2004","sortdate":"2007-05-01","project":"ilense, macss, cisoft","jsubject":"sensornet_subtransport","number":"ISI-TR-2004-595","month":"September","location":"johnh: folder: pafile","url":"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.html","pdfurl":"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.pdf","otherurl":"http://www-scf.usc.edu/%7eyuanl/myresearch/smac_schedules.pdf","copyrightholder":"authors","myorganization":"USC/Information Sciences Institute","abstract":"Recently, several MAC protocols such as S-MAC and T-MAC have exploited scheduled sleep/wakeup cycles to conserve energy in sensor networks. Until now, most protocols have assumed all nodes in the network were configured to follow the same schedule, or they assumed border nodes would follow multiple schedules, but did not evaluate those cases. This paper develops two new algorithms to control and exploit the presence of multiple schedules to reduce energy consumption and latency. The first one is the \\emphglobal schedule algorithm (GSA). Through experiments, we demonstrate that, because of radio propagation vagaries, large sensor networks have very ragged, overlapping borders where many nodes listen to two or more schedules. GSA is a fully distributed algorithm that allows a large network to converge on a single global schedule to conserve energy. Secondly, we demonstrate that strict schedules incur a latency penalty in a multi-hop network when packets must wait for the next schedule for transmission. To reduce latency in multi-hop paths we develop the \\emphfast path algorithm (FPA). FPA provides fast data forwarding paths by adding additional wake-up periods on the nodes along paths from sources to sinks. We evaluate both algorithms through experiments on Berkeley motes and demonstrate that the protocols accomplish their goals of reducing energy consumption and latency in large sensor networks. ","bibtex":"@TechReport{Li04b,\n\tauthor = \t\"Yuan Li and Wei Ye and John Heidemann\",\n\ttitle = \t\"Energy and Latency Control in Low Duty Cycle {MAC} Protocols\",\n\tinstitution = \t\"USC/Information Sciences Institute\",\n\tyear = \t\t2004,\n\tsortdate = \"2007-05-01\",\n\tproject = \"ilense, macss, cisoft\",\n\tjsubject = \"sensornet_subtransport\",\n\tnumber =\t\"ISI-TR-2004-595\",\n\tmonth =\t\tsep,\n\tlocation =\t\"johnh: folder: pafile\",\n\turl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.html\",\n\tpdfurl =\t\"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.pdf\",\n\totherurl = \"http://www-scf.usc.edu/%7eyuanl/myresearch/smac_schedules.pdf\",\n\tcopyrightholder = \"authors\",\n\tmyorganization = \t\"USC/Information Sciences Institute\",\n\tabstract = \"\nRecently, several MAC protocols such as S-MAC and T-MAC have exploited\nscheduled sleep/wakeup cycles to conserve energy in sensor\nnetworks. Until now, most protocols have assumed all nodes in the\nnetwork were configured to follow the same schedule, or they assumed\nborder nodes would follow multiple schedules, but did not evaluate\nthose cases. This paper develops two new algorithms to control and\nexploit the presence of multiple schedules to reduce energy\nconsumption and latency. The first one is\nthe \\emph{global schedule algorithm} (GSA).\nThrough experiments, we demonstrate that, because of\nradio propagation vagaries, large sensor networks have very ragged,\noverlapping borders where many nodes listen to two or more\nschedules. GSA is a fully distributed algorithm that allows a large\nnetwork to converge on a single global schedule to conserve\nenergy. Secondly, we demonstrate that strict schedules incur a latency\npenalty in a multi-hop network when packets must wait for the next\nschedule for transmission. To reduce latency in multi-hop paths we\ndevelop the \\emph{fast path algorithm} (FPA). FPA provides fast data\nforwarding paths by adding additional wake-up periods on the nodes\nalong paths from sources to sinks. We evaluate both algorithms through\nexperiments on Berkeley motes and demonstrate that the protocols\naccomplish their goals of reducing energy consumption and latency in\nlarge sensor networks.\n\",\n}\n\n\n","author_short":["Li, Y.","Ye, W.","Heidemann, J."],"bibbaseid":"li-ye-heidemann-energyandlatencycontrolinlowdutycyclemacprotocols-2004","role":"author","urls":{"Paper":"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.html"},"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":[],"search_terms":["energy","latency","control","low","duty","cycle","mac","protocols","li","ye","heidemann"],"title":"Energy and Latency Control in Low Duty Cycle MAC Protocols","year":2004}