International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 162 - Number 9 |
Year of Publication: 2017 |
Authors: Chetna Solegaonkar, Balwant Prajapat |
10.5120/ijca2017913356 |
Chetna Solegaonkar, Balwant Prajapat . An Overview on Cluster Head Election Techniques in Mobile Ad-Hoc Networks. International Journal of Computer Applications. 162, 9 ( Mar 2017), 10-12. DOI=10.5120/ijca2017913356
This paper will try to find out the way to identify or to select a best and optimised head to communicate among the clusters with education in data redundancy and also will help better band width utilisation. Wireless Ad-hoc network is formed by the set of wireless devices, which move randomly as well communicate with other nodes through radio signal. Ad-hoc networks logically depicted as a group of clusters by assemble together on the basis of different criteria like as a-hop and b-hop that are in close division with one another. Clusters are instituted by diffusing node specifications along the wireless links. Various heuristics employ have several policies to select cluster heads. Various policies of these are biased in approbation of some nodes. As a result at the end, these nodes should have greater authority and may deplete their energy speedily, resulting them to drop out from the network. So that, there is a requirement for process called load-balancing among selected cluster-heads to give all nodes the opportunity to present as a cluster-head.