Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/818
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Wu, W | - |
dc.creator | Cao, J | - |
dc.creator | Yang, J | - |
dc.creator | Raynal, M | - |
dc.date.accessioned | 2014-12-11T08:26:03Z | - |
dc.date.available | 2014-12-11T08:26:03Z | - |
dc.identifier.isbn | 0-7695-2513-X | - |
dc.identifier.uri | http://hdl.handle.net/10397/818 | - |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.rights | © 2006 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. | en_US |
dc.rights | 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. | en_US |
dc.subject | Hierarchical systems | en_US |
dc.subject | Network protocols | en_US |
dc.subject | Resource allocation | en_US |
dc.subject | Consensus protocols | en_US |
dc.subject | Failure detectors | en_US |
dc.subject | Mobile ad hoc networks (MANET) | en_US |
dc.subject | Mobile telecommunication systems | en_US |
dc.title | A hierarchical consensus protocol for mobile ad hoc networks | en_US |
dc.type | Conference Paper | en_US |
dcterms.abstract | Mobile ad hoc networks (MANETs) raise new challenges in designing protocols for solving the consensus problem. Among the others, how to design message efficient protocols so as to save resource consumption, has been the focus of research. In this paper, we present the design of such an efficient consensus protocol. We consider the system model for MANETs with host crashes, but equipped with Chandra-Toueg's unreliable failure detectors of class ◇P. At most f hosts can crash where f< n/2 (n is the total number of the hosts). The protocol adopts the coordinator rotation paradigm to achieve consensus. Unlike existing consensus protocols, the proposed protocol is based on a two-layer hierarchy with hosts associated with proxies. At least f+1 hosts act as proxies and each host is associated with one proxy host. The messages from and/or to the local hosts of the same proxy are merged so as to reduce the message cost. Moreover, the hierarchical approach can improve the scalability of the consensus protocol. Performance analysis shows that the proposed protocol can significantly save cost compared existing protocols. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | PDP 2006 : 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, Feb. 15-17, 2006, Montbéliard-Sochaux, France, [p. 64-72] | - |
dcterms.issued | 2006 | - |
dc.identifier.isi | WOS:000236462500009 | - |
dc.identifier.scopus | 2-s2.0-33750221827 | - |
dc.identifier.rosgroupid | r30158 | - |
dc.description.ros | 2005-2006 > Academic research: refereed > Refereed conference paper | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Conference Paper |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hierarchical-consensus_06.pdf | 179.37 kB | Adobe PDF | View/Open |
Page views
117
Last Week
2
2
Last month
Citations as of Apr 21, 2024
Downloads
193
Citations as of Apr 21, 2024
SCOPUSTM
Citations
9
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
3
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.