{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:55:56Z","timestamp":1759118156490,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T00:00:00Z","timestamp":1316044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2011,9,15]]},"abstract":"<jats:p>Carrier-Sense Multiple-Access (CSMA) protocols form a popular class of random-access schemes for regulating node activity in wireless networks. We compare the continuous and the time-slotted versions of this protocol in the saturated regime, and show that continuous CSMA has higher aggregate throughput than the slotted protocol, but this comes at the cost of fairness, i.e., the throughput is not evenly distributed across all nodes. We then release the saturation assumption and consider a multi-hop scenario where packets are forwarded through the network and nodes may occasionally empty. We study end-to-end throughput of both continuous and slotted CSMA, and show that slotted CSMA has a higher throughput than the continuous protocol.<\/jats:p>","DOI":"10.1145\/2034832.2034840","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T13:48:54Z","timestamp":1316526534000},"page":"35-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing slotted and continuous CSMA"],"prefix":"10.1145","volume":"39","author":[{"given":"Seva","family":"Shneer","sequence":"first","affiliation":[{"name":"HeriotWatt University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter M.","family":"van de Ven","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,9,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.280"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011427"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.251"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092768"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1986.1146399"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.09.003"},{"key":"e_1_2_1_7_1","first-page":"23","volume-title":"Proc. Infocom","author":"Wang X.","year":"2005"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034832.2034840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2034832.2034840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:39Z","timestamp":1750240119000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034832.2034840"}},"subtitle":["throughputs and fairness"],"short-title":[],"issued":{"date-parts":[[2011,9,15]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,9,15]]}},"alternative-id":["10.1145\/2034832.2034840"],"URL":"https:\/\/doi.org\/10.1145\/2034832.2034840","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2011,9,15]]},"assertion":[{"value":"2011-09-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}