International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 99 - Number 19 |
Year of Publication: 2014 |
Authors: Deepti Kothari, D Srinivasa Rao, Anil Singh |
10.5120/17482-8385 |
Deepti Kothari, D Srinivasa Rao, Anil Singh . An Efficient Clusterhead Election Algorithm for Mobile Ad-Hoc Network. International Journal of Computer Applications. 99, 19 ( August 2014), 19-22. DOI=10.5120/17482-8385
Mobile ad hoc network, abbreviated as MANET, is flexible, self-configuring, wireless ad-hoc network. MANET do not require pre-existing or pre-defined infrastructure, instead it configures and creates a network dynamically. All available nodes (devices) in MANET act as routers and are allowed to move freely in any direction, even in and out of network. Communication in a network with such high levels of nodal mobility is complex and challenging. The paper proposes an efficient weighted cluster election algorithm (WCA) by leveraging most connected, least utilized node for cluster head election. A comparative study of the traditional weighted cluster algorithm (WCA) and the proposed weighted cluster algorithm (WCA) simulation results shown significant improvement in performance, scalability, stability and efficiency of the network.