{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:39:00Z","timestamp":1773931140125,"version":"3.50.1"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2015CB358700, 2011CBA00300, 2011CBA00301"],"award-info":[{"award-number":["2015CB358700, 2011CBA00300, 2011CBA00301"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1318294, CCF-1514383, CCF-1637546, CCF-1815316"],"award-info":[{"award-number":["CNS-1318294, CCF-1514383, CCF-1637546, CCF-1815316"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61202009, 61033001, 61361136003"],"award-info":[{"award-number":["61202009, 61033001, 61361136003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2019,10,31]]},"abstract":"<jats:p>\n            <jats:italic>Energy<\/jats:italic>\n            is often the most constrained resource for battery-powered wireless devices, and most of the energy is often spent on\n            <jats:italic>transceiver usage<\/jats:italic>\n            (i.e., transmitting and receiving packets) rather than computation. In this article, we study the\n            <jats:italic>energy complexity<\/jats:italic>\n            of fundamental problems in several models of wireless radio networks. It turns out that energy complexity is very sensitive to whether the devices can generate random bits and their ability to\n            <jats:italic>detect collisions<\/jats:italic>\n            . We consider four collision detection models: Strong-CD (in which transmitters and listeners detect collisions), Sender-CD (in which only transmitters detect collisions), Receiver-CD (in which only listeners detect collisions), and No-CD (in which no one detects collisions).\n          <\/jats:p>\n          <jats:p>The take-away message of our results is quite surprising. For randomized algorithms, there is an exponential gap between the energy complexity of Sender-CD and Receiver-CD:<\/jats:p>\n          <jats:p>Randomized: No-CD = Sender-CD &gt; Receiver-CD = Strong-CD<\/jats:p>\n          <jats:p>\n            and for deterministic algorithms, there is another exponential gap in energy complexity,\n            <jats:italic>but in the reverse direction<\/jats:italic>\n            :\n          <\/jats:p>\n          <jats:p>Deterministic: No-CD = Receiver-CD &gt; Sender-CD = Strong-CD<\/jats:p>\n          <jats:p>\n            Precisely, the randomized energy complexity of Leader Election is \u0398(log\n            <jats:sup>*<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            ) in Sender-CD but \u0398(log(log\n            <jats:sup>*<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            )) in Receiver-CD, where\n            <jats:italic>n<\/jats:italic>\n            is the number of devices, which is unknown to the devices at the beginning; the deterministic complexity of Leader Election is \u0398(log\n            <jats:italic>N<\/jats:italic>\n            ) in Receiver-CD but \u0398(log log\n            <jats:italic>N<\/jats:italic>\n            ) in Sender-CD, where\n            <jats:italic>N<\/jats:italic>\n            is the size of the ID space.\n          <\/jats:p>\n          <jats:p>\n            There is a tradeoff between time and energy. We provide a new upper bound on the time-energy tradeoff curve for randomized algorithms. A critical component of this algorithm is a new deterministic Leader Election algorithm for\n            <jats:italic>dense<\/jats:italic>\n            instances, when\n            <jats:italic>n<\/jats:italic>\n            = \u0398(\n            <jats:italic>N<\/jats:italic>\n            ), with inverse Ackermann energy complexity.\n          <\/jats:p>","DOI":"10.1145\/3341111","type":"journal-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T12:20:59Z","timestamp":1570450859000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Exponential Separations in the Energy Complexity of Leader Election"],"prefix":"10.1145","volume":"15","author":[{"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsvi","family":"Kopelowitz","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seth","family":"Pettie","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruosong","family":"Wang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhan","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90015-W"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02259748"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/171540.171571"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 5th International Conference on Systems and Networks Communications. 83--87","author":"Barnes M.","year":"2010"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201916)","author":"Bender M. A.","year":"1974"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818936.2818949"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 48th ACM Symposium on Theory of Computing (STOC\u201916)","author":"Bender M. A."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO\u201916)","author":"Brandes P."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC\u201917)","author":"Censor-Hillel K."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC\u201918)","author":"Chang Y.-J."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 49th ACM SIGACT Symposium on Theory of Computing (STOC\u201917)","author":"Chang Y.-J."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 16th International Conference on Principles of Distributed Systems (OPODIS\u201912)","author":"Chlebus B. S."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 24th International Symposium on Distributed Computing (DISC\u201910)","author":"Cornejo A."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC\u201916)","author":"Czumaj A."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC\u201917)","author":"Czumaj A."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS\u201903)","author":"Czumaj A."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC\u201912)","author":"Daum S."},{"key":"e_1_2_1_19_1","first-page":"215","article-title":"On a problem of graph theory. Studia Sci","volume":"1","author":"Erd\u0151s P.","year":"1966","journal-title":"Math. Hung."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN\u201906)","author":"Farach-Colton M."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (PODC\u201913)","author":"Ghaffari M."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0172-x"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP\u201916) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"55","author":"Ghaffari M.","year":"2016"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA\u201914)","author":"Gilbert S."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 29th International Symposium on Distributed Computing (DISC\u201915)","author":"Gilbert S."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214125"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC\u201902)","author":"Jurdzinski T.","year":"1825"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 8th International Conference on Computing and Combinatorics (COCOON\u201902)","author":"Jurdzinski T."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 8th International European Conference on Parallel Computing (Euro-Par\u201902)","author":"Jurdzinski T."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.783"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC\u201902)","author":"Jurdzinski T."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 42nd International Conference on Parallel Processing. 399--408","author":"Kardas M."},{"key":"e_1_2_1_33_1","first-page":"23","article-title":"On a problem of graph theory","volume":"2","author":"Katona G.","year":"1967","journal-title":"Studia Scient. Math. Hung."},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC\u201911)","author":"King V.","year":"1993"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0126-7"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP\u201909)","author":"Kowalski D. R."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the 11th European Symposium on Algorithms (ESA\u201903)","author":"Kuty\u0142owski M."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2012.2221233"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.877942"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.877833"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_18"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN\u201905)","author":"Polastre J.","year":"2005"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the 24th International Symposium on Distributed Computing (DISC\u201910)","author":"Schneider J."},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 47th IEEE Conference on Vehicular Technology","volume":"3","author":"Sivalingam K. M.","year":"1997"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341111","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:24Z","timestamp":1750199904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10,31]]}},"alternative-id":["10.1145\/3341111"],"URL":"https:\/\/doi.org\/10.1145\/3341111","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,4]]},"assertion":[{"value":"2018-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}