{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:52Z","timestamp":1750306672146,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>Motivated by the need to judiciously allocate scarce sensing resources to attain the highest benefit for the applications that sensor networks serve, in this article we develop a flexible solutions methodology for maximizing the overall reward attained, subject to constraints on the resource demands under fairly general reward or demand functions. We map a broad class of related problems for data fusion in wireless sensor networks into an integer programming problem and provide an iterative Lagrangian relaxation technique to solve it. Each iteration step involves solving for a maximum-weight independent set of an appropriately constructed graph, which, in many cases, can be obtained in polynomial time. We apply our methodology to the problem of tracking targets moving over a period of time through a nonhomogeneous, energy-constrained sensor field. With rewards represented by the quality of information attained in tracking, we study its trade-offs and relationship with energy consumption and periodic measurement taking. We finally illustrate other applications of our framework in sensor networks.<\/jats:p>","DOI":"10.1145\/2594768","type":"journal-article","created":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T12:18:28Z","timestamp":1399983508000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Solutions Framework for Optimal Multitask Resource Assignments for Data Fusion in Wireless Sensor Networks"],"prefix":"10.1145","volume":"10","author":[{"given":"Srikanth","family":"Hariharan","sequence":"first","affiliation":[{"name":"AT&amp;T Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chatschik","family":"Bisdikian","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lance M.","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Army Research Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien","family":"Pham","sequence":"additional","affiliation":[{"name":"Army Research Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.10.007"},{"volume-title":"Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO'08)","author":"Berger A.","key":"e_1_2_2_2_1","unstructured":"A. Berger , V. Bonifaci , F. Grandoni , and G. Schafer . 2008. Budgeted matching and budgeted matroid intersection via the gasoline puzzle . In Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO'08) . 273--287. A. Berger, V. Bonifaci, F. Grandoni, and G. Schafer. 2008. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. In Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO'08). 273--287."},{"key":"e_1_2_2_3_1","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis. 1997. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Saddle River NJ.   D. P. Bertsekas and J. N. Tsitsiklis. 1997. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Saddle River NJ."},{"volume-title":"Proceedings of the 12th International Conference on Information Fusion (FUSION'09)","author":"Bisdikian C.","key":"e_1_2_2_4_1","unstructured":"C. Bisdikian , L. Kaplan , M. Srivastava , D. Thornley , D. Verma , and R. Young . 2009. Building principles for a quality of information specification for sensor information . In Proceedings of the 12th International Conference on Information Fusion (FUSION'09) . C. Bisdikian, L. Kaplan, M. Srivastava, D. Thornley, D. Verma, and R. Young. 2009. Building principles for a quality of information specification for sensor information. In Proceedings of the 12th International Conference on Information Fusion (FUSION'09)."},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"R. Burkard M. Dellamico and S. Martello. 2009. Assignment Problems. SIAM Philadelphia PA.   R. Burkard M. Dellamico and S. Martello. 2009. Assignment Problems. SIAM Philadelphia PA.","DOI":"10.1137\/1.9780898717754"},{"key":"e_1_2_2_6_1","volume-title":"Proc. SPIE","volume":"7694","author":"Burman J.","unstructured":"J. Burman , J. Hespanha , U. Madhow , D. Klein , J. Isaacs , S. Venkateswaran , and T. Pham . 2010. Heterogeneous sensor networks: A bio-inspired overlay architecture . Proc. SPIE , vol. 7694 . J. Burman, J. Hespanha, U. Madhow, D. Klein, J. Isaacs, S. Venkateswaran, and T. Pham. 2010. Heterogeneous sensor networks: A bio-inspired overlay architecture. Proc. SPIE, vol. 7694."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.893968"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2006.884007"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0263"},{"volume-title":"Proceedings of the 14th International Conference on Information Fusion (FUSION'11)","author":"Hariharan S.","key":"e_1_2_2_10_1","unstructured":"S. Hariharan , C. Bisdikian , L. M. Kaplan , and T. Pham . 2011. QoI-based resource allocation for multi-target tracking in energy constrained sensor networks . In Proceedings of the 14th International Conference on Information Fusion (FUSION'11) . S. Hariharan, C. Bisdikian, L. M. Kaplan, and T. Pham. 2011. QoI-based resource allocation for multi-target tracking in energy constrained sensor networks. In Proceedings of the 14th International Conference on Information Fusion (FUSION'11)."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2107502.2107534"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11718"},{"volume-title":"Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS'03)","author":"Isler V.","key":"e_1_2_2_14_1","unstructured":"V. Isler , J. Spletzer , S. Khanna , and C. J. Taylor . 2003. Target tracking with distributed sensors: The focus of attention problem . In Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS'03) . V. Isler, J. Spletzer, S. Khanna, and C. J. Taylor. 2003. Target tracking with distributed sensors: The focus of attention problem. In Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS'03)."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007095"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2006.1603409"},{"volume-title":"Complexity of Computer Communications","author":"Karp R.","key":"e_1_2_2_17_1","unstructured":"R. Karp . 1972. Reducibility among combinatorial problems . In Complexity of Computer Communications , Plenum Press , New York , 85--103. R. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Communications, Plenum Press, New York, 85--103."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93980-1_13"},{"volume-title":"Proceedings of the 17th IEEE International Conference on Computer Communications and Networks (ICCCN'05)","author":"Kushwaha M.","key":"e_1_2_2_19_1","unstructured":"M. Kushwaha , I. Amundson , P. Volgyesi , P. Ahammad , G. Simon , X. Koutsoukos , A. Ledeczi , and S. Sastry . 2005. Multi-modal target tracking using heterogeneous sensor networks . In Proceedings of the 17th IEEE International Conference on Computer Communications and Networks (ICCCN'05) . M. Kushwaha, I. Amundson, P. Volgyesi, P. Ahammad, G. Simon, X. Koutsoukos, A. Ledeczi, and S. Sastry. 2005. Multi-modal target tracking using heterogeneous sensor networks. In Proceedings of the 17th IEEE International Conference on Computer Communications and Networks (ICCCN'05)."},{"key":"e_1_2_2_20_1","first-page":"481","article-title":"Markov chain monte carlo data association for multi-target tracking","volume":"54","author":"Oh S.","year":"2004","unstructured":"S. Oh , S. Russell , and S. Sastry . 2004 . Markov chain monte carlo data association for multi-target tracking . IEEE Trans. Autom. Control 54 , 3, 481 -- 497 . S. Oh, S. Russell, and S. Sastry. 2004. Markov chain monte carlo data association for multi-target tracking. IEEE Trans. Autom. Control 54, 3, 481--497.","journal-title":"IEEE Trans. Autom. Control"},{"key":"e_1_2_2_21_1","first-page":"235","article-title":"The maximum weight independent set problem for data association in multiple hypothesis tracking. In Proceedings of the 8th International Conference on Optimization and Cooperative Control Strategies","volume":"381","author":"Papageorgiou D. J.","year":"2009","unstructured":"D. J. Papageorgiou and M. R. Salpukas . 2009 . The maximum weight independent set problem for data association in multiple hypothesis tracking. In Proceedings of the 8th International Conference on Optimization and Cooperative Control Strategies . Lecture Notes in Computer Science , vol. 381 , Spring er, 235 -- 255 . D. J. Papageorgiou and M. R. Salpukas. 2009. The maximum weight independent set problem for data association in multiple hypothesis tracking. In Proceedings of the 8th International Conference on Optimization and Cooperative Control Strategies. Lecture Notes in Computer Science, vol. 381, Springer, 235--255.","journal-title":"Lecture Notes in Computer Science"},{"volume-title":"Iterative Combinatorial Auctions","author":"Parkes D. C.","key":"e_1_2_2_22_1","unstructured":"D. C. Parkes . 2006. Iterative Combinatorial Auctions . MIT Press , Cambridge, MA , 41--77. D. C. Parkes. 2006. Iterative Combinatorial Auctions. MIT Press, Cambridge, MA, 41--77."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008669120497"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704455"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/3003463"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1777406.1777415"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030448"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2007.4301218"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860093.1860118"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594768","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2594768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:53Z","timestamp":1750230053000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.1145\/2594768"],"URL":"https:\/\/doi.org\/10.1145\/2594768","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"2011-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}