{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:37:02Z","timestamp":1760243822641,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2011,5,12]],"date-time":"2011-05-12T00:00:00Z","timestamp":1305158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>We consider a problem of retrieving the extreme value among sensed data under deadline constraints in wireless sensor networks with potential applications to alarm systems. The sensed data is mapped to a score which we adopt as a unified measure of the relative urgency of the data. The objective is to retrieve the data with the maximum score. We propose fully distributed schemes for contention based medium access and data combining. The proposed medium access scheme uses a randomized back-off which is controlled based on the score of the data to be transmitted. Data combining techniques are proposed to further suppress unnecessary traffic and reduce contention. The key observation is that one should aggressively prioritize packets with high score, up to an extent that does not incur excessive contention in channel access. Designed to capture such aspect, the proposed scheme is shown to substantially decrease the latency of the retrieval.<\/jats:p>","DOI":"10.3390\/s110505229","type":"journal-article","created":{"date-parts":[[2011,5,12]],"date-time":"2011-05-12T13:25:07Z","timestamp":1305206707000},"page":"5229-5252","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Retrieval of the Extreme Values under Deadline Constraints in Wireless Sensor Networks"],"prefix":"10.3390","volume":"11","author":[{"given":"Seung Jun","family":"Baek","sequence":"first","affiliation":[{"name":"Department of Computer and Communications, Korea University, Anam-dong Seongbuk-gu, 130-701, Seoul, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohan","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computer and Communications, Korea University, Anam-dong Seongbuk-gu, 130-701, Seoul, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyogu","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Digital Contents Convergence, Seoul National University, Seoul, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunhak","family":"Kim","sequence":"additional","affiliation":[{"name":"Electronics and Telecommunications Research Institute, 138 Gajeongno, Yuseong-gu, Daejeon, 305-700, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2011,5,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1109\/JSAC.2005.843543","article-title":"Computing and communicating functions over sensor networks","volume":"23","author":"Giridhar","year":"2005","journal-title":"IEEE J. Sel. Area. Commun"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/502059.502049","article-title":"Building efficient wireless sensor networks with low-level naming","volume":"35","author":"Heidemann","year":"2001","journal-title":"ACM SIGOPS Oper. Syst. Rev"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Intanagonwiwat, C, Govindan, R, and Estrin, D (2000, January 6\u201311). Directed diffusion: A scalable and robust communication paradigm for sensor networks. Boston, MA, USA.","DOI":"10.1145\/345910.345920"},{"key":"ref_4","unstructured":"Krishnamachari, L, Estrin, D, and Wicker, S (2002, January 2\u20135). The impact of data aggregation in wireless sensor networks. Vienna, Austria."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/MWC.2007.358967","article-title":"In-network aggregation techniques for wireless sensor networks: A survey","volume":"14","author":"Fasolo","year":"2007","journal-title":"IEEE Wirel. Commun"},{"key":"ref_6","unstructured":"Yu, Y, Krishnamachari, B, and Prasanna, V (, January March). Energy-latency tradeoffs for data gathering in wireless sensor networks. Hong Kong."},{"key":"ref_7","unstructured":"Prabhakar, B, Biyikoglu, U, and El Gamal, A (, January April). Energy-efficient transmission over a wireless link via lazy packet scheduling. Anchorage, AK, USA."},{"key":"ref_8","unstructured":"Annamalai, V, Gupta, S, and Schwiebert, L (, January March). On tree-based convergecasting in wireless sensor networks. New Orleans, LA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/11599463_14","article-title":"Minimum data aggregation time problem in wireless sensor networks","volume":"3794","author":"Chen","year":"2005","journal-title":"Mob. Ad-hoc Sens. Netw"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Huang, S, Wan, P, Vu, C, Li, Y, and Yao, F (2007, January 6\u201312). Nearly constant approximation for data aggregation scheduling in wireless sensor networks. Anchorage, AK, USA.","DOI":"10.1109\/INFCOM.2007.50"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ye, Z, Abouzeid, A, and Ai, J (2007, January 6\u201312). Optimal policies for distributed data aggregation in wireless sensor networks. Anchorage, AK, USA.","DOI":"10.1109\/INFCOM.2007.196"},{"key":"ref_12","unstructured":"Hariharan, S, and Shroff, N (, January December). Maximizing aggregated revenue in sensor networks under deadline constraints. Shanghai, China."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, J, Jia, X, and Xing, G (2010). Real-time data aggregation in contention-based wireless sensor networks. ACM Trans Sens Netw.","DOI":"10.1145\/1806895.1806897"},{"key":"ref_14","unstructured":"Lin, X, and Rasool, S (, January December). Constant-time distributed scheduling policies for ad hoc wireless networks. San Diego, CA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Sanghavi, S, Bui, L, and Srikant, R (2007, January 12\u201316). Distributed link scheduling with constant overhead. San Diego, CA, USA.","DOI":"10.1145\/1254882.1254920"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TNET.2009.2035046","article-title":"A distributed CSMA algorithm for throughput and utility maximization in wireless networks","volume":"18","author":"Jiang","year":"2010","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"ref_17","unstructured":"Jiang, L, and Walrand, J (, January May). Approaching throughput-optimality in a distributed CSMA algorithm: Collisions and stability. New Orleans, LA, USA."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1109\/TNET.2008.2010857","article-title":"Performance of random access scheduling schemes in multi-hop wireless networks","volume":"17","author":"Joo","year":"2009","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"6182","DOI":"10.1109\/TIT.2010.2081490","article-title":"Distributed random access algorithm: Scheduling and congestion control","volume":"56","author":"Jiang","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1846","DOI":"10.1109\/TNET.2009.2021609","article-title":"Low-complexity distributed scheduling algorithms for wireless networks","volume":"17","author":"Gupta","year":"2009","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"ref_21","unstructured":"Ni, J, Tan, B, and Srikant, R (, January March). Q-CSMA: Queue-length based CSMA\/CA algorithms for achieving maximum throughput and low delay in wireless networks. San Diego, CA, USA."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"7320","DOI":"10.3390\/s90907320","article-title":"Power conservation through energy efficient routing in wireless sensor networks","volume":"9","author":"Kandris","year":"2009","journal-title":"Sensors"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.adhoc.2010.09.001","article-title":"Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor Networks","volume":"9","author":"Kandris","year":"2011","journal-title":"Ad Hoc Netw"},{"key":"ref_24","unstructured":"Sharaf, MA, Beaver, J, Labrinidis, A, and Chrysanthis, PK (, January September). TiNA: A scheme for temporal coherency-aware in-network aggregation. San Diego, CA, USA."},{"key":"ref_25","unstructured":"Galluccio, L, Campbell, AT, and Palazzo, S (, January November). Concert: Aggregation-based congestion control for sensor networks. San Diego, CA, USA."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Galluccio, L, Palazzo, S, and Campbell, AT (2008, January 15\u201318). Efficient data aggregation in wireless sensor networks: An entropy-driven analysis. Cannes, France.","DOI":"10.1109\/PIMRC.2008.4699915"},{"key":"ref_27","unstructured":"Elson, J, Girod, L, and Estrin, D (, January December). Fine-grained network time synchronization using reference broadcasts. Boston, MA, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/49.840210","article-title":"Performance analysis of the IEEE 802.11 distributed coordination function","volume":"18","author":"Bianchi","year":"2000","journal-title":"IEEE J. Sel. Area. Commun"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/11\/5\/5229\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:56:04Z","timestamp":1760219764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/11\/5\/5229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,12]]},"references-count":28,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2011,5]]}},"alternative-id":["s110505229"],"URL":"https:\/\/doi.org\/10.3390\/s110505229","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2011,5,12]]}}}