{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:33:12Z","timestamp":1760131992182,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0347460CNS-0240398"],"award-info":[{"award-number":["CNS-0347460CNS-0240398"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p>\n            The minimum-energy multicast tree problem aims to construct a multicast tree rooted at the source node and spanning all the destination nodes such that the sum of transmission power at non-leaf nodes is minimized. However, aggressive power assignment at non-leaf nodes, although conserving more energy, results in multicast trees that suffer from higher hop count and jeopardizes delay-sensitive applications, signifying a clear tradeoff between energy efficiency and delay. This article formulates these issues as a\n            <jats:italic>constrained Steiner tree<\/jats:italic>\n            problem, and describes a distributed constrained Steiner tree algorithm, which jointly conserves energy and bounds delay for multicast routing in ad hoc networks. In particular, the proposed algorithm concurrently constructs a constrained Steiner tree, performs transmission power assignment at non-leaf nodes, and strives to minimize the sum of transmission power of non-leaf nodes, subject to the given maximum hop count constraint. Simulation results validate the effectiveness and reveal the characteristics of the proposed algorithm.\n          <\/jats:p>","DOI":"10.1145\/1342171.1342174","type":"journal-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T16:08:32Z","timestamp":1207066112000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing"],"prefix":"10.1145","volume":"3","author":[{"given":"Chien-Chung","family":"Shen","sequence":"first","affiliation":[{"name":"University of Delaware, Newark, DE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Li","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaiporn","family":"Jaikaeo","sequence":"additional","affiliation":[{"name":"Kasetsart University, Bangkok, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinay","family":"Sridhara","sequence":"additional","affiliation":[{"name":"Qualcomm, San Diego, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,3,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.819173"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/554879"},{"volume-title":"Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM","year":"2003","author":"Cartigny J.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms Second Edition. The MIT Press Cambridge.   Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms Second Edition. The MIT Press Cambridge."},{"volume-title":"Swarm Intelligence Symposium","author":"Gosavi S.","key":"e_1_2_1_5_1"},{"volume-title":"Proceedings of the International Symposium of Parallel Architectures, Algorithms and Networks (ISPAN), 335--340","author":"Huang T.-L.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"volume-title":"2nd International Conference on Computer Communication (ICCC). 343--349","author":"Kompella V.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.1599406"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"volume-title":"IEEE Workshop on High Performance Switching and Routing (HPSR)","author":"Pan D.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1470824"},{"key":"e_1_2_1_13_1","first-page":"1","article-title":"Ad hoc multicast routing algorithm with swarm intelligence","volume":"10","author":"Shen C.-C.","year":"2005","journal-title":"ACM Mobile Netw. Appl. J."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Singh G. Das S. Gosavi S. and Pujar S. 2004. Ant colony algorithms for Steiner trees: an application to routing in sensor networks. In Recent Developments in Biologically Inspired Computing L. N. de Castro and F. J. von Zuben Eds. Idea Group Inc. Chapter 6.  Singh G. Das S. Gosavi S. and Pujar S. 2004. Ant colony algorithms for Steiner trees: an application to routing in sensor networks. In Recent Developments in Biologically Inspired Computing L. N. de Castro and F. J. von Zuben Eds. Idea Group Inc. Chapter 6.","DOI":"10.4018\/978-1-59140-312-8.ch008"},{"volume-title":"12th International Conference on Computer Communication (ICCC). 833--838","author":"Wi S.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020716919751"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.857148"},{"key":"e_1_2_1_18_1","unstructured":"Yi Y. Lee S.-J. Su W. and Gerla M. 2002. On-demand multicast routing protocol (ODMRP) for ad hoc networks. http:\/\/www.ietf.org\/proceedings\/02nov\/I-D\/draft-ietf-manet-odmrp-04.txt.  Yi Y. Lee S.-J. Su W. and Gerla M. 2002. On-demand multicast routing protocol (ODMRP) for ad hoc networks. http:\/\/www.ietf.org\/proceedings\/02nov\/I-D\/draft-ietf-manet-odmrp-04.txt."}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1342171.1342174","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1342171.1342174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:20Z","timestamp":1750253960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1342171.1342174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1145\/1342171.1342174"],"URL":"https:\/\/doi.org\/10.1145\/1342171.1342174","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2008,3]]},"assertion":[{"value":"2006-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}