By Topic

Global convergence in partially fully connected networks (PFCN) with limited relays

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

2 Author(s)
A. H. Azadmanesh ; Comput. Sci. Dept., Nebraska Univ., Omaha, NE, USA ; H. Bajwa

Approximate agreement (AA) is one form of distributed agreement, in which the network nodes, by exchanging their local values, need to agree on values which are approximately equal to each other. The study on the AA problem in partially connected networks has been very limited. More specifically, no solution to the AA problem exists for such networks. This paper solves the AA problem for a specific, scalable, partially connected network with limited relays. The results show low communication costs in comparison to fully connected networks. The network can also take advantage of the results available for fully connected networks, thus finding the expressions for convergence rate and fault tolerance becomes relatively easy

Published in:

Industrial Electronics Society, 2001. IECON '01. The 27th Annual Conference of the IEEE  (Volume:3 )

Date of Conference: