Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An introduction to signal detection and estimation (2nd ed.)
An introduction to signal detection and estimation (2nd ed.)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Towards radar-enabled sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Decentralized detection in sensor networks
IEEE Transactions on Signal Processing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Detection Performance Limits for Distributed Sensor Networks in the Presence of Nonideal Channels
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
A centralized energy-efficient routing protocol for wireless sensor networks
IEEE Communications Magazine
Information-directed routing in ad hoc sensor networks
IEEE Journal on Selected Areas in Communications
Cooperative routing for distributed detection in large sensor networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Reliable and energy efficient cooperative detection in wireless sensor networks
Computer Communications
Hi-index | 0.00 |
Energy-efficient routing for wireless sensor networks (WSNs) has been a topic of great interest for the last few years, but thus far routing for signal detection in WSNs has not attracted much attention. In particular, little research has focused on the Neyman-Pearson criterion which is the most well accepted metric for radar, sonar and related signal detection problems. In this paper, we formulate the problem of energy-efficient routing for signal detection under the Neyman-Pearson criterion, apparently for the first time. We hereby propose two different routing metrics that aim at a tradeoff between the detection performance and the energy consumption. In particular, the first one leads to a combinatorial problem of identifying a path which achieves the largest possible mean detection-probability-to-energy ratio, while the second one reduces to finding a route which minimizes the consumed energy while maintaining a predeter-mined detection probability. We further provide efficient algorithms for solving these problems based on state-of-the-art research from operations research. We also present simulation results which indicate the distinctive energy-performance balance achieved by each proposed routing metric.