{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:47:51Z","timestamp":1781585271050,"version":"3.54.5"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"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":[[2005,11]]},"abstract":"<jats:p>Wireless sensor networks hold a very promising future. The nodes of wireless sensor networks (WSN) have a small energy supply and limited bandwidth available. Since radio communication is expensive in terms of energy consumption, the nodes typically spend most of their energy reserve on wireless communication (rather than on CPU processing) for data dissemination and retrieval. Therefore, the role of energy conserving data communication protocols and services in WSN can not be overemphasized. Caching data at locations that minimize packet transmissions in the network reduces the power consumption in the network, and hence extends its lifetime. Finding locations of the nodes for caching data to minimize communication cost corresponds to finding the nodes of a weighted Minimum Steiner tree whose edge weights depend on the edge's Euclidean length and its data traffic rate. We call this tree a Steiner Data Caching Tree (SDCT). We prove that an optimal SDCT is binary, and that at-least two of the three internal angles formed at the Steiner points are equal. We derive expressions that determine the exact location of a Steiner point for a set of three nodes based on their location and their data refresh rate requirements. Based on these (optimality) results, we present a dynamic distributed energy-conserving application-layer service for data caching and asynchronous multicast. We present the results of simulation of our service that verifies its power saving properties.<\/jats:p>","DOI":"10.1145\/1105688.1105690","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:07:09Z","timestamp":1139238429000},"page":"178-203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Energy-conserving data cache placement in sensor networks"],"prefix":"10.1145","volume":"1","author":[{"given":"K. Shashi","family":"Prabh","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tarek F.","family":"Abdelzaher","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.490746"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Berman P. and Ramaiyer V. 1994. Improved approximations for the steiner tree problem. In Selected Papers from the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. Academic Press New York 381--408.   Berman P. and Ramaiyer V. 1994. Improved approximations for the steiner tree problem. In Selected Papers from the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. Academic Press New York 381--408.","DOI":"10.1006\/jagm.1994.1041"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 1st International Conference on Mobile Systems, Applications, and Services (MobiSys","author":"Bhattacharya S.","year":"2003"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Charikar M."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2003.1233530"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Cieslik D. 1998. Steiner Minimal Trees. Kluwer Academic Publishers Dordrecht The Netherlands.  Cieslik D. 1998. Steiner Minimal Trees. Kluwer Academic Publishers Dordrecht The Netherlands.","DOI":"10.1007\/978-1-4757-6585-4"},{"key":"e_1_2_1_7_1","unstructured":"Crossbow Technology Inc. 2004. http:\/\/www.xbow.com\/.  Crossbow Technology Inc. 2004. http:\/\/www.xbow.com\/."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","article-title":"The complexity of computing steiner minimal trees","volume":"32","author":"Garey M. R.","year":"1977","journal-title":"SIAM J. Applied Math."},{"key":"e_1_2_1_9_1","volume-title":"Glomosim: A scalable network simulation environment. Tech. Rep. 990027. Dept. Computer Science","author":"Gerla M.","year":"1999"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services. ACM","author":"He T."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 6th Annual ACM\/IEEE International Conference on Mobile Computing and Networking (MOBICOM). ACM","author":"Intanagonwiwat C."},{"key":"e_1_2_1_12_1","unstructured":"Intel. 2004. http:\/\/www.intel.com\/research\/exploratory\/heterogeneous.htm.  Intel. 2004. http:\/\/www.intel.com\/research\/exploratory\/heterogeneous.htm."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 6th Annual ACM\/IEEE International Conference on Mobile Computing and Networking (MOBICOM). ACM","author":"Karp B."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 23rd International Conference on Distributed Computing Systems. IEEE Computer Society","author":"Kim S."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. ACM","author":"Malpani N."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. IEEE Computer Society Press","author":"Perkins C. E."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA). ACM","author":"Ratnasamy S."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Robins G."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 1st ACM SIGCOMM Workshop on Hot Topics in Networks (HotNets","author":"Shenker S.","year":"2002"},{"key":"e_1_2_1_20_1","volume-title":"RMST: Reliable data transport in sensor networks. In Proceedings of the 1st International Workshop on Sensor Net Protocols and Applications","author":"Stann F.","year":"2003"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 1st European Workshop on Wireless Sensor Networks (EWSN'04)","author":"Szewczyk R."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 8th Annual International Conference on Mobile Computing and Networking. ACM","author":"Ye F."}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1105688.1105690","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1105688.1105690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:03Z","timestamp":1750262883000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1105688.1105690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["10.1145\/1105688.1105690"],"URL":"https:\/\/doi.org\/10.1145\/1105688.1105690","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]},"assertion":[{"value":"2005-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}