Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IEEE/ACM Transactions on Networking (TON)
An efficient leader election protocol for mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks
IEEE Transactions on Parallel and Distributed Systems
A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
LELE: Leader Election with Load Balancing Energy in Wireless Sensor Network
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02
Electing a leader in the local computation model using mobile agents
AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
An Election Protocol in Mobile Ad Hoc Distributed Systems
ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
An efficient leader election algorithm for mobile ad hoc networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
The wireless communication has earned much popularity, in the recent past. The discipline has been able to grab the focus of academia and the attention of industry. Specifically, the variants of wireless communication, like MANET, BAN, PAN, VANET, etc, are scoring more as they are highly adaptive in nature and light in installation. However, the coordination among the nodes, of such networks, stands still as a challenge. In the context of MANET, a wide range of coordination protocols exist for fault free as well as faulty scenario. Some of them provide very limited failure resiliency by electing vice-leader whereas others exhibit slightly better failure tolerance by having more than one passive (stand by) leaders. Unfortunately, in the worst case, when both, leader and possible alternatives crash, these protocols initiate a completely new instance of the protocol. In this paper, we propose a best node based election protocol. Also, we provide a simple and proactive approach to make the protocol fault tolerant. Moreover, the fault tolerant approach provided in the article can be implemented in most of the leader election protocols, specifically, used in wireless communication. However, we have considered mobile ad hoc environment to show case the strength of our proactive approach. The proposal has been substantiated by efficiency analysis and exhaustive simulation.