Abstract
A single-hop wireless sensor network for distributed detection has been considered in the majority of the existing literature. However, a wireless sensor network for an event detection application with cheap and short range sensors is likely to be a multihop network. Here we consider a distributed detection problem in a multihop wireless sensor network with tree topology. We propose an optimum multibit decision fusion rule derived from the previously known optimum likelihood ratio for a single-hop network with star topology. Subsequently, we present an efficient multibit decision fusion rule for a multihop wireless sensor network with tree topology. Through numerical results, the proposed scheme is shown to achieve a significant improvement in detection accuracy over existing distributed detection schemes.
Highlights
Wireless sensor network (WSN) [1] is a network formed by a large number of sensor nodes deployed in the area of interest
For a WSN with tree topology, if the sensors detect binary value representing the occurrence of an event, the best scheme, as shown in [2], is when each intermediate node informs its parent about the actual number of its descendants observing “0” and the actual number of its descendants observing “1.”
Any non-leaf node has the following function: it senses the data and fuses the data sensed by itself with the data received from its children to form a summary, and it forwards the summary to its parent, while a leaf node observes the data and transmits it to its parent
Summary
Wireless sensor network (WSN) [1] is a network formed by a large number of sensor nodes deployed in the area of interest. For a WSN with tree topology, if the sensors detect binary value representing the occurrence of an event, the best scheme, as shown in [2], is when each intermediate node informs its parent about the actual number of its descendants observing “0” and the actual number of its descendants observing “1.” One of these numbers is required to be transmitted if every node has a priori knowledge of the number of descendants of its each child (this may not be feasible in a dynamic network).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
