Energy Efficient Decentralized Detection Based on Bit-optimal Multi-hop Transmission in One-dimensional Wireless Sensor Networks
Yasaman Keshtkarjahromi, Rashid Ansari, and Ashfaq Khokhar

TL;DR
This paper proposes an energy-efficient multi-hop wireless sensor network configuration for decentralized detection, optimizing path lengths and quantization bits to enhance network lifetime and detection accuracy in large networks.
Contribution
It introduces a novel multi-hop detection framework that balances energy consumption and detection performance, addressing limitations of parallel configurations in large-scale networks.
Findings
Significant energy savings compared to parallel configurations.
Improved detection accuracy in larger networks.
Enhanced network lifetime through optimized multi-hop paths.
Abstract
Existing information theoretic work in decentralized detection is largely focused on parallel configuration of Wireless Sensor Networks (WSNs), where an individual hard or soft decision is computed at each sensor node and then transmitted directly to the fusion node. Such an approach is not efficient for large networks, where communication structure is likely to comprise of multiple hops. On the other hand, decentralized detection problem investigated for multi-hop networks is mainly concerned with reducing number and/or size of messages by using compression and fusion of information at intermediate nodes. In this paper an energy efficient multi-hop configuration of WSNs is proposed to solve the detection problem in large networks with two objectives: maximizing network lifetime and minimizing probability of error in the fusion node. This optimization problem is considered under the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
