Please use this identifier to cite or link to this item:
|Title:||The eventual clusterer oracle and its application to consensus in MANETs|
Fault tolerant computer systems
Flow of solids
Mobile telecommunication systems
Wireless telecommunication systems
|Source:||SRDS 2007 : 26th IEEE International Symposium on Reliable Distributed Systems : 10-12 October 2007, Beijing, China, p. 23-32 How to cite?|
|Abstract:||This paper studies the design of hierarchical consensus protocols for mobile ad hoc networks. A two-layer hierarchy is imposed on the mobile hosts by grouping them into clusters, each with a clusterhead. The messages from and to the hosts in the same cluster are merged/unmerged by the clusterhead so as to reduce the message cost and improve the scalability. We adopt a modular method in the design, separating clustering from achieving consensus using the clusters. The clustering function, named eventual clusterer (denoted as lozenge, openC), is designed to construct a cluster-based hierarchy over the mobile hosts in the network. Since OC provides the fault tolerant clustering function transparently, it can be used as a new oracle (i.e. an abstract tool to provide some kind of information about the state of the system) for the design of hierarchical consensus protocols. Based on lozenge, openC, we design a new consensus protocol, which can significantly reduce the message cost of achieving consensu. We also propose an implementation of the OC oracle based on the failure detector lozenge, openS.|
|Rights:||© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Apr 30, 2016
Checked on Jan 15, 2017
Checked on Jan 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.