Please use this identifier to cite or link to this item:
|Title:||Blind Adaptive Weighted Aggregation Scheme for Event Detection in Multihop Wireless Sensor Networks|
|Citation:||WIRELESS PERSONAL COMMUNICATIONS,58(3)581-597|
|Abstract:||The problem of decision fusion for event detection in Wireless Sensor Networks is the prime focus of this paper. Our proposed algorithm focuses on single hop (star) and multihop (tree) topologies, which are commonly deployed wireless sensor network topologies. In order to minimize the overall energy consumption in the network, a transmission constraint of one-bit is imposed on each sensor node. This poses a challenging problem of designing a one-bit decision fusion rule at every fusion center, which improves the overall detection accuracy at the sink node. The absence of apriori knowledge of each sensor's local performance indices, makes the existing optimum fusion rule infeasible. Moreover, in the absence of a training sequence of true event occurrences, existing Adaptive distributed detection techniques also become inapplicable. In this setup, the key contribution of this paper is a Least Mean Squares based Blind Adaptive Weighted Aggregation Scheme (Blind-AdWAS) for Wireless Sensor Networks with tree topology. We extend our earlier work (Jagyasi et al. in Proceedings of 11th international symposium on wireless personal multimedia communication, 2008) to include an analysis of the effect of Rayleigh flat fading channel on Blind-AdWAS in comparison with existing channel-aware optimum and sub- optimum aggregation schemes. Even in the absence of any channel knowledge or knowledge of performance indices, Blind-AdWAS demonstrates robustness in event detection performance.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.