A Leader Election Algorithm and Performance Evaluation for Mobile Ad hoc Networks


The KIPS Transactions:PartC, Vol. 11, No. 6, pp. 829-834, Dec. 2004
10.3745/KIPSTC.2004.11.6.829,   PDF Download:

Abstract

Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geograghical area and are loosely bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
G. C. Yang and S. Y. Oh, "A Leader Election Algorithm and Performance Evaluation for Mobile Ad hoc Networks," The KIPS Transactions:PartC, vol. 11, no. 6, pp. 829-834, 2004. DOI: 10.3745/KIPSTC.2004.11.6.829.

[ACM Style]
Gi Chul Yang and Soo Yul Oh. 2004. A Leader Election Algorithm and Performance Evaluation for Mobile Ad hoc Networks. The KIPS Transactions:PartC, 11, 6, (2004), 829-834. DOI: 10.3745/KIPSTC.2004.11.6.829.