@InProceedings{Syed10a,
	  author = 	"Affan A. Syed and John Heidemann",
	  title = 	"Contention Analysis of MAC Protocols that Count",
	  booktitle = 	"Proceedings of the " # "Fifth" # " ACM International Workshop on UnderWater Networks ({WUWNet}) ",
	  year = 		2010,
	sortdate = "2010-09-01",
	project = "ilense, snuse, ortun, cisoft",
	jsubject = "sensornet_high_latency",
	  publisher =	"ACM",
	  address =	"Woods Hole, Massachusetts, USA",
	  month =		sep,
	  pages =		"2:1--2:8",
	  location =	"johnh: pafile",
	  keywords =	"t-lohi, analysis, queueing theory, limit",
	doi = "10.1145/1868812.1868814",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "ACM",
	copyrightterms = "	Permission to make digital or hard  	copies of portions of this work for personal or  	classroom use is granted without fee provided that  	the copies are not made or distributed for profit or  	commercial advantage and that copies bear this  	notice and the full citation on the first page in  	print or the first screen in digital  	media. Copyrights for components of this work owned  	by others than ACM must be honored. Abstracting with  	credit is permitted.   	otherwise, to republish, to post on servers, or to  	redistribute to lists, requires prior specific  	permission and/or a fee. Send written requests for  	republication to ACM Publications, Copyright &  	Permissions at the address above or fax +1 (212)  	869-0481 or email permissions@acm.org." ,
	url = "http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.html",
	pdfurl = "http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.pdf",
	slidesurl = "http://www.isi.edu/%7ejohnh/PAPERS/Syed10a_talk.pdf",
	abstract = "The key aspect in the design of any contention-based medium access
control (MAC) protocol is the mechanism to measure and resolve
simultaneous contention.  Generally, terrestrial wireless MACs can
only observe success or collision of a contention attempt through
carrier sense.  An implicit estimate of the number of contenders
occurs through repeated observation and changing back-off contention
window.  Recent work in underwater MAC protocols suggest there it is
possible to directly \emph{count} the number of contenders by
exploiting the spatio-temporal uncertainty inherent to high-latency
underwater acoustic medium.  Prior work has shown how to use counting
in underwater MACs, and how to optimize contention windows in radio
MACs.  In this paper, we quantify bounds to convergence time for MAC
protocols employing exact contender counting.  We show that perfect
countingallows \emph{contention to converge quickly},
\emph{independent of network density}, with an asymptotic limit of
\emph{3.6 contention rounds} on average.  We confirm this analysis
with simulation of a specific underwater MAC protocol, and suggest the
opportunity for the results to generalize for any radio-based MACs
that estimate contenders.",
}

{"_id":"FGkkKY4HgizTtnYbh","bibbaseid":"syed-heidemann-contentionanalysisofmacprotocolsthatcount-2010","author_short":["Syed, A. A.","Heidemann, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Affan","A."],"propositions":[],"lastnames":["Syed"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Contention Analysis of MAC Protocols that Count","booktitle":"Proceedings of the FifthACM International Workshop on UnderWater Networks (WUWNet) ","year":"2010","sortdate":"2010-09-01","project":"ilense, snuse, ortun, cisoft","jsubject":"sensornet_high_latency","publisher":"ACM","address":"Woods Hole, Massachusetts, USA","month":"September","pages":"2:1–2:8","location":"johnh: pafile","keywords":"t-lohi, analysis, queueing theory, limit","doi":"10.1145/1868812.1868814","myorganization":"USC/Information Sciences Institute","copyrightholder":"ACM","copyrightterms":"Permission to make digital or hard copies of portions of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page in print or the first screen in digital media. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Send written requests for republication to ACM Publications, Copyright & Permissions at the address above or fax +1 (212) 869-0481 or email permissions@acm.org.","url":"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.html","pdfurl":"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.pdf","slidesurl":"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a_talk.pdf","abstract":"The key aspect in the design of any contention-based medium access control (MAC) protocol is the mechanism to measure and resolve simultaneous contention. Generally, terrestrial wireless MACs can only observe success or collision of a contention attempt through carrier sense. An implicit estimate of the number of contenders occurs through repeated observation and changing back-off contention window. Recent work in underwater MAC protocols suggest there it is possible to directly \\emphcount the number of contenders by exploiting the spatio-temporal uncertainty inherent to high-latency underwater acoustic medium. Prior work has shown how to use counting in underwater MACs, and how to optimize contention windows in radio MACs. In this paper, we quantify bounds to convergence time for MAC protocols employing exact contender counting. We show that perfect countingallows \\emphcontention to converge quickly, \\emphindependent of network density, with an asymptotic limit of \\emph3.6 contention rounds on average. We confirm this analysis with simulation of a specific underwater MAC protocol, and suggest the opportunity for the results to generalize for any radio-based MACs that estimate contenders.","bibtex":"@InProceedings{Syed10a,\n\t author = \t\"Affan A. Syed and John Heidemann\",\n\t title = \t\"Contention Analysis of MAC Protocols that Count\",\n\t booktitle = \t\"Proceedings of the \" # \"Fifth\" # \" ACM International Workshop on UnderWater Networks ({WUWNet}) \",\n\t year = \t\t2010,\n\tsortdate = \"2010-09-01\",\n\tproject = \"ilense, snuse, ortun, cisoft\",\n\tjsubject = \"sensornet_high_latency\",\n\t publisher =\t\"ACM\",\n\t address =\t\"Woods Hole, Massachusetts, USA\",\n\t month =\t\tsep,\n\t pages =\t\t\"2:1--2:8\",\n\t location =\t\"johnh: pafile\",\n\t keywords =\t\"t-lohi, analysis, queueing theory, limit\",\n\tdoi = \"10.1145/1868812.1868814\",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tcopyrightholder = \"ACM\",\n\tcopyrightterms = \"\tPermission to make digital or hard \tcopies of portions of this work for personal or \tclassroom use is granted without fee provided that \tthe copies are not made or distributed for profit or \tcommercial advantage and that copies bear this \tnotice and the full citation on the first page in \tprint or the first screen in digital \tmedia. Copyrights for components of this work owned \tby others than ACM must be honored. Abstracting with \tcredit is permitted. \totherwise, to republish, to post on servers, or to \tredistribute to lists, requires prior specific \tpermission and/or a fee. Send written requests for \trepublication to ACM Publications, Copyright & \tPermissions at the address above or fax +1 (212) \t869-0481 or email permissions@acm.org.\" ,\n\turl = \"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.html\",\n\tpdfurl = \"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.pdf\",\n\tslidesurl = \"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a_talk.pdf\",\n\tabstract = \"The key aspect in the design of any contention-based medium access\ncontrol (MAC) protocol is the mechanism to measure and resolve\nsimultaneous contention. Generally, terrestrial wireless MACs can\nonly observe success or collision of a contention attempt through\ncarrier sense. An implicit estimate of the number of contenders\noccurs through repeated observation and changing back-off contention\nwindow. Recent work in underwater MAC protocols suggest there it is\npossible to directly \\emph{count} the number of contenders by\nexploiting the spatio-temporal uncertainty inherent to high-latency\nunderwater acoustic medium. Prior work has shown how to use counting\nin underwater MACs, and how to optimize contention windows in radio\nMACs. In this paper, we quantify bounds to convergence time for MAC\nprotocols employing exact contender counting. We show that perfect\ncountingallows \\emph{contention to converge quickly},\n\\emph{independent of network density}, with an asymptotic limit of\n\\emph{3.6 contention rounds} on average. We confirm this analysis\nwith simulation of a specific underwater MAC protocol, and suggest the\nopportunity for the results to generalize for any radio-based MACs\nthat estimate contenders.\",\n}\n\n","author_short":["Syed, A. A.","Heidemann, J."],"bibbaseid":"syed-heidemann-contentionanalysisofmacprotocolsthatcount-2010","role":"author","urls":{"Paper":"http://www.isi.edu/%7ejohnh/PAPERS/Syed10a.html"},"keyword":["t-lohi","analysis","queueing theory","limit"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":["t-lohi","analysis","queueing theory","limit"],"search_terms":["contention","analysis","mac","protocols","count","syed","heidemann"],"title":"Contention Analysis of MAC Protocols that Count","year":2010}