{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:19Z","timestamp":1750307719597,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000105","name":"Office of Cyberinfrastructure","doi-asserted-by":"publisher","award":["___amp___num; CNS-0620245OCI-0636299"],"award-info":[{"award-number":["___amp___num; CNS-0620245OCI-0636299"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["___amp___num; CNS-0620245OCI-0636299"],"award-info":[{"award-number":["___amp___num; CNS-0620245OCI-0636299"]}],"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. Sen. Netw."],"published-print":{"date-parts":[[2009,5]]},"abstract":"<jats:p>\n            In wireless sensor network applications, the potential to use cooperation to resolve user queries remains largely untapped. Efficiently answering a user's questions requires identifying the correct set of nodes that can answer the question and enabling coordination between them. In this article, we propose a\n            <jats:italic>query domain<\/jats:italic>\n            abstraction that allows an application to dynamically specify the nodes best suited to answering a particular query. Selecting the ideal set of heterogeneous sensors entails answering two fundamental questions\u2014\n            <jats:italic>how<\/jats:italic>\n            are the selected sensors related to one another, and\n            <jats:italic>where<\/jats:italic>\n            should the resulting sensor coalition be located. We introduce two abstractions, the\n            <jats:italic>proximity function<\/jats:italic>\n            and the\n            <jats:italic>reference function<\/jats:italic>\n            , to precisely specify each of these concerns within a query. All nodes in the query domain must satisfy any provided proximity function, a user-defined function that constrains the relative relationship among the group of nodes (e.g., based on a property of the network or physical environment or on logical properties of the nodes). The selected set of nodes must also satisfy any provided reference function, a mechanism to scope the location of the query domain to a specified area of interest (e.g., within a certain distance from a specified reference point). In this article, we model these abstractions and present a set of protocols that accomplish this task with varying degrees of correctness. We evaluate their performance through simulation and highlight the tradeoffs between protocol overhead and correctness.\n          <\/jats:p>","DOI":"10.1145\/1525856.1525865","type":"journal-article","created":{"date-parts":[[2009,6,9]],"date-time":"2009-06-09T12:44:12Z","timestamp":1244551452000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["An interrelational grouping abstraction for heterogeneous sensors"],"prefix":"10.1145","volume":"5","author":[{"given":"Vasanth","family":"Rajamani","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]},{"given":"Sanem","family":"Kabadayi","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]},{"given":"Christine","family":"Julien","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[2009,6,4]]},"reference":[{"volume-title":"Proceedings of the International Conference on Distributed Computing Systems. 582--589","author":"Abdelzaher T.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11502593_12"},{"volume-title":"Proceedings of the International Conference on Mobile Ad-hoc and Sensor Systems. 578--581","author":"Hammer J.","key":"e_1_2_1_3_1"},{"volume-title":"Proceedings of the International Conference on System Sciences. 8020--8029","author":"Heinzelman W.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/356989.356998"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345920"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2007.2"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1098918.1098926"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958506"},{"volume-title":"Proceedings of the Wireless Communications and Networking Conference. 3495--3500","author":"Liang O.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061322"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570751"},{"volume-title":"What causes crop failure&quest","author":"Mendelsohn R.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","unstructured":"Millman G. 2004. Virtual vineyard. Accenture Outlook Journal.  Millman G. 2004. Virtual vineyard. Accenture Outlook Journal."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142680.1142691"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/10473220127411"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052199.1052213"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065040"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2003.08.001"},{"volume-title":"Proceedings of the Symposium on Networked Systems Design and Implementation.","author":"Welsh M.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/990064.990079"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601861"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1210669.1210672"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1525856.1525865","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1525856.1525865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:28Z","timestamp":1750253428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1525856.1525865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["10.1145\/1525856.1525865"],"URL":"https:\/\/doi.org\/10.1145\/1525856.1525865","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2009,5]]},"assertion":[{"value":"2007-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}