Discrete stochastic approximation algorithms for design of optimal sensor fusion rules Online publication date: Wed, 11-Apr-2007
by In Sock Jang, Xiaodong Wang, Vikram Krishnamurthy
International Journal of Sensor Networks (IJSNET), Vol. 2, No. 3/4, 2007
Abstract: The basic idea of distributed detection is to have a number of independent sensors, each to make a local decision (typically a binary one) and then to combine their decisions at a fusion centre to make a global decision. Fault-tolerance has been considered as one of the main characteristics of wireless sensor networks. A fusion rule in the form of an error correction code has been recently proposed for better fault-tolerance in distributed sensor networks. In this paper, we propose to employ the powerful discrete stochastic approximation techniques to optimise the code matrix, that is, the fusion rule, with the objective of minimising the probability of decision error. We consider both the standard stochastic approximation algorithm and two newly proposed ones for this application. Extensive simulation results are provided to demonstrate the effectiveness of the proposed design paradigm in obtaining optimal fusion rules in distributed wireless sensor networks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook