Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
IEEE Transactions on Software Engineering
Distributed Algorithms
Improving TCP performance over mobile networks
ACM Computing Surveys (CSUR)
The Challenges of Mobile Computing
Computer
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
ATP: a reliable transport protocol for ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Consensus: The Big Misunderstanding
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Solving the Consensus Problem in a Dynamic Group: An Approach Suitable for a Mobile Environment
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Failure Detectors in Omission Failure Environments
Failure Detectors in Omission Failure Environments
Randomized Multivalued Consensus
ISORC '01 Proceedings of the Fourth International Symposium on Object-Oriented Real-Time Distributed Computing
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Proceedings of the 10th annual international conference on Mobile computing and networking
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Optimal tradeoffs for location-based routing in large-scale ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Designing distributed algorithms for mobile computing networks
Computer Communications
Energy efficiency of large-scale wireless networks: proactive versus reactive networking
IEEE Journal on Selected Areas in Communications
LIDeA: a distributed lightweight intrusion detection architecture for sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Performance Evaluation of Cost Effective Routing for Packet Transmissions in Mobile Ad Hoc Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
A Stability Criteria Membership Protocol for Ad Hoc Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
A failure detector for wireless networks with unknown membership
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
| Hi-index | 14.98 |
Designing protocols for solving the consensus problem faces new challenges in mobile computing environments. Among others, how we can achieve message efficiency for saving resource consumption has been the focus of research. In this paper, we present the HC protocol, a message efficient consensus protocol for MANETs. We consider the widely used system model where the hosts fail by crashes and the system is equipped with Chandra-Toueg's unreliable failure detectors. Unlike existing consensus protocols, the HC protocol uses a two-layer hierarchy based on clusters to achieve message efficiency. The messages from and to the hosts in the same cluster are merged so as to reduce the message cost. However, adding such a hierarchy is not trivial. Due to host movements and failures, the hierarchy changes from time to time and this may cause message loss. In designing HC, we also propose methods to handle such message losses. Extensive simulations have been carried out to evaluate and compare the performance of the HC protocol and similar protocols in a MANET environment. Simulation results show that, in most cases, our protocol can significantly reduce both the message cost and time cost. With increases in the system scale or the percentage of faulty hosts, the advantage of our protocol becomes more obvious.