In:
Concurrent Engineering, SAGE Publications, Vol. 3, No. 3 ( 1995-09), p. 195-201
Abstract:
The existing leader election algorithm can be characterized by the extrema-finding algorithm in which all nodes are assumed to have a unique ID number. The leader to be elected is the node simply having the largest ID number. In this paper, the leader election algorithm which is based upon the performance and operation rate of nodes and links is proposed. The per formance of the existing leader election algorithms should be improved because the system pauses until a node becomes a unique leader among all nodes in the system. The pre-election algorithm which elects a leader while leader is running is also proposed.
Type of Medium:
Online Resource
ISSN:
1063-293X
,
1531-2003
DOI:
10.1177/1063293X9500300305
Language:
English
Publisher:
SAGE Publications
Publication Date:
1995
detail.hit.zdb_id:
2101005-5
Bookmarklink