By Topic

A communication architecture for reaching consensus in decision for a large network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yao-Win Hong ; Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY ; A. Scaglione ; P. K. Varshney

One of the most challenging aspects in applying decentralized detection in sensor networks is the efficient exchange of small messages required for data fusion. In this work, we propose a novel communication architecture for a canonical decentralized detection problem where the sensor nodes exchange continuously their local decisions until consensus is reached among all nodes. Our methodology capitalizes on the observation that the information embedded in the exchanged messages decreases to zero as the decisions gradually converge. By using a data-driven multiple access scheme, we show that the number of channel accesses required for each round of message exchange decreases, following the same trend as the aggregate entropy of the sensor decisions. The main contribution is to show that data-driven multiple access strategies can overcome the backlog of communications that many distributed computing algorithms generate in a wireless network setting

Published in:

IEEE/SP 13th Workshop on Statistical Signal Processing, 2005

Date of Conference:

17-20 July 2005