{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:58Z","timestamp":1750306498404,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,3,10]],"date-time":"2016-03-10T00:00:00Z","timestamp":1457568000000},"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":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2016,3,21]]},"abstract":"<jats:p>We consider the group-communication maintenance problem between a set of<jats:italic>k<\/jats:italic>mobile agents that are tracked by a static sensor network. We develop a scalable deterministic distributed algorithm for maintaining a Steiner tree of the agents so that group communication between them can be provided with the minimum total cost possible. The main idea is that our algorithm maintains a virtual tree of mobile agents that can be immediately converted to an actual Steiner tree at all times. Our algorithm achieves the Steiner tree with total length at most<jats:italic>O<\/jats:italic>(log<jats:italic>k<\/jats:italic>) times the length of the optimal Steiner tree in the constant-doubling graph model. The total communication cost (the number of messages) to maintain the Steiner tree is only<jats:italic>O<\/jats:italic>(min{log<jats:italic>n<\/jats:italic>, log<jats:italic>D<\/jats:italic>}) times the optimal communication cost, where<jats:italic>n<\/jats:italic>and<jats:italic>D<\/jats:italic>, respectively, are the number of nodes and the diameter of the constant-doubling network. We also develop improved algorithms for the mobile<jats:italic>k<\/jats:italic>-center, sparse-aggregation, and distributed-matching problems. Experimental evaluation results show the benefits of our algorithms compared to previous algorithms. These four problems are NP-hard and, to the best of our knowledge, our algorithms are the first near-optimal deterministic algorithms for maintaining approximate solutions to these important network problems with low maintenance costs in a distributed setting.<\/jats:p>","DOI":"10.1145\/2854155","type":"journal-article","created":{"date-parts":[[2016,3,14]],"date-time":"2016-03-14T13:24:02Z","timestamp":1457961842000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks"],"prefix":"10.1145","volume":"12","author":[{"given":"Gokarna","family":"Sharma","sequence":"first","affiliation":[{"name":"Kent State University, Kent, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,3,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573969"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Nikhil Bansal Niv Buchbinder Anupam Gupta and Joseph Seffi Naor. 2007. An O(log2k)-competitive algorithm for metric bipartite matching. In ESA. 522--533. Nikhil Bansal Niv Buchbinder Anupam Gupta and Joseph Seffi Naor. 2007. An O(log 2 k)-competitive algorithm for metric bipartite matching. In ESA. 522--533.","DOI":"10.1007\/978-3-540-75520-3_47"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Y. Bartal. 1996. Probabilistic approximation of metric spaces and its algorithmic applications. In FOCS. 184--193. Y. Bartal. 1996. Probabilistic approximation of metric spaces and its algorithmic applications. In FOCS. 184--193.","DOI":"10.1109\/SFCS.1996.548477"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294260"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432628"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2004.22"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984645"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236414"},{"key":"e_1_2_1_11_1","unstructured":"Jie Gao Leonidas Guibas Nikola Milosavljevic and Dengpan Zhou. 2009. Distributed resource management and matching in sensor networks. In IPSN. 97--108. Jie Gao Leonidas Guibas Nikola Milosavljevic and Dengpan Zhou. 2009. Distributed resource management and matching in sensor networks. In IPSN. 97--108."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.001"},{"key":"e_1_2_1_13_1","unstructured":"Michael R. Garey and David S. Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. Michael R. Garey and David S. Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Magn\u00fas M. Halld\u00f3rsson and Pradipta Mitra. 2011. Nearly optimal bounds for distributed wireless scheduling in the SINR model. In ICALP. 625--636. Magn\u00fas M. Halld\u00f3rsson and Pradipta Mitra. 2011. Nearly optimal bounds for distributed wireless scheduling in the SINR model. In ICALP. 625--636.","DOI":"10.1007\/978-3-642-22012-8_50"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0037-x"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060649"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"e_1_2_1_18_1","unstructured":"Robert Krauthgamer and James R. Lee. 2004. Navigating nets: Simple algorithms for proximity search. In SODA. 798--807. Robert Krauthgamer and James R. Lee. 2004. Navigating nets: Simple algorithms for proximity search. In SODA. 798--807."},{"key":"e_1_2_1_19_1","first-page":"1954","article-title":"Efficient location tracking using sensor networks","volume":"3","author":"Kung H. T.","year":"2003","journal-title":"WCNC"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-012-0447-y"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.115"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460412.1460427"},{"key":"e_1_2_1_24_1","unstructured":"Thomas Moscibroda Roger Wattenhofer and Yves Weber. 2006a. Protocol design beyond graph-based models. In HotNets. Thomas Moscibroda Roger Wattenhofer and Yves Weber. 2006a. Protocol design beyond graph-based models. In HotNets."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132939"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Arik Motskin Ian Downes Branislav Kusy Omprakash Gnawali and Leonidas J. Guibas. 2011. Network warehouses: Efficient information distribution to mobile users. In INFOCOM. 2069--2077. Arik Motskin Ian Downes Branislav Kusy Omprakash Gnawali and Leonidas J. Guibas. 2011. Network warehouses: Efficient information distribution to mobile users. In INFOCOM. 2069--2077.","DOI":"10.1109\/INFCOM.2011.5935015"},{"key":"e_1_2_1_27_1","unstructured":"Gabriel Robins and Alexander Zelikovsky. 2000. Improved Steiner tree approximation in graphs. In SODA. 770--779. Gabriel Robins and Alexander Zelikovsky. 2000. Improved Steiner tree approximation in graphs. In SODA. 770--779."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0097-1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Gokarna Sharma and Costas Busch. 2013. Optimal nearest neighbor queries in sensor networks. In ALGOSENSORS. 260--277. Gokarna Sharma and Costas Busch. 2013. Optimal nearest neighbor queries in sensor networks. In ALGOSENSORS. 260--277.","DOI":"10.1007\/978-3-642-45346-5_19"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCOSS.2014.12"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.5.1_122"},{"key":"e_1_2_1_33_1","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi H.","year":"1980","journal-title":"Mathematica Japonica"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Dengpan Zhou and Jie Gao. 2010. Maintaining approximate minimum Steiner tree and k-center for mobile agents in a sensor network. In INFOCOM. 511--515. Dengpan Zhou and Jie Gao. 2010. Maintaining approximate minimum Steiner tree and k-center for mobile agents in a sensor network. In INFOCOM. 511--515.","DOI":"10.1109\/INFCOM.2010.5462182"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854155","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:47Z","timestamp":1750225727000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,10]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3,21]]}},"alternative-id":["10.1145\/2854155"],"URL":"https:\/\/doi.org\/10.1145\/2854155","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2016,3,10]]},"assertion":[{"value":"2015-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}