An efficient leader election algorithm for mobile ad hoc networks

Authors:
Pradeep Parvathipuram;Vijay Kumar;Gi-Chul Yang
Affiliations:
SICE, Computer Networking, University of Missouri-Kansas City, Kansas City, MO;SICE, Computer Networking, University of Missouri-Kansas City, Kansas City, MO;Division of Information Engineering, Mokpo National University, Jeonnam, Korea
Venue:
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Year:
2004

Citing 6
Cited 4

Impact of mobility on distributed computations

ACM SIGOPS Operating Systems Review
Fundamental control algorithms in mobile networks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
The performance of query control schemes for the zone routing protocol

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Multicast operation of the ad-hoc on-demand distance vector routing protocol

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
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

A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Regional consecutive leader election in mobile ad-hoc networks

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Optimal regional consecutive leader election in mobile ad-hoc networks

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Trivial solution for a non-trivial problem in MANETs

ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nodes communicate under peer-to-peer level in ad-hoc mobile networks To manage the inter-node communication and data exchange among them a leader node is required In this paper we present a leader election algorithm for distributed mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes along with the correctness of the algorithm The algorithm uses least amount of wireless resources and does not affect the movement of the nodes.