Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure

DOI10.1109/TC.2008.22zbMath1373.68106OpenAlexW2096088963WikidataQ111520012 ScholiaQ111520012MaRDI QIDQ4589597

Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai, Chin-Hsien Tsai

Publication date: 10 November 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2008.22

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12)

Related Items (2)

Scalable continuous object detection and tracking in sensor networks ⋮ Optimal nearest neighbor queries in sensor networks

This page was built for publication: Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure