In mobile ad hoc network (MANET) cluster head selection is considered a gigantic challenge. In wireless sensor network LEACH protocol can be used to select cluster head on the bases of energy, but it is still a dispute in mobil ad hoc networks and especially when nodes are itinerant. In this paper we proposed an efficient cluster head selection algorithm (ECHSA), for selection of the cluster head efficiently in Mobile ad hoc networks. We evaluate our proposed algorithm through simulation in OMNet++ as well as on test bed; we experience the result according to our assumption. For further evaluation we also compare our proposed protocol with several other protocols like LEACH-C and consequences show perfection. 1. Introduction Cluster head (CH) election is the process to select a node within the cluster as a leader node. Cluster Head maintains the information related to its cluster. This information includes a list of nodes in the cluster and the path to every node [1]. The responsibility of the CH is to communicate with all the nodes of its own cluster. However CH must be able to communicate with the nodes of other clusters as well, which can be directly or through the respective CH or through gateways. Communication is done in three steps. First of all the cluster head receives the data sent by its members, secondly it compresses the data, and finally transmits the data to the base station or other CH. Suitable cluster head can reduce energy utilization and enhances the network lifetime [2]. Electing a specific node as a cluster head is a very important but sophisticated job. Various factors can be considered for electing the best node as a cluster head [3]. Some of these factors include location of the node with respect to other nodes, mobility, energy, trust, and throughput of the node. Nodes of WSN and MANET have limited battery and resources. Process of election increases the overall processing overhead of the network. So the election process must also consider the processing and energy limitations of the nodes. One cluster head per cluster must be selected during an election process, because multiple cluster heads within a single cluster can give rise to cluster reformation, Quality of Service (QoS), and routing management issues [4]. In the recent years, various surveys of CH election schemes were presented. Aim of these surveys is to discuss their parameters, need of reclustering [5], and performance [6]. However to the best of our knowledge, no overview of the CH election emphasizing position of node in cluster, trust factor of nodes, and single
References
[1]
A. A. Abbasi and M. Younis, “A survey on clustering algorithms for wireless sensor networks,” Computer Communications, vol. 30, no. 14-15, pp. 2826–2841, 2007.
[2]
R. Agarwal and D. Motwani, “Survey of clustering algorithms for MANET,” http://arxiv.org/abs/0912.2303.
[3]
M. Chatterjee, S. Sas, and D. Turgut, “An on-demand weighted clustering algorithm (WCA) for ad hoc networks,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '00), 2000.
[4]
P. Chatterjee, “Trust based clustering and secure routing scheme for mobile ad hoc networks,” International Journal of Computer Networks and Communication, vol. 1, no. 2, pp. 84–97, 2009.
[5]
S. Chinara and S. K. Rath, “A survey on one-hop clustering algorithms in mobile ad hoc networks,” Journal of Network and Systems Management, vol. 17, no. 1-2, pp. 183–207, 2009.
[6]
C.-L. Fok, G.-C. Roman, and C. Lu, “Rapid development and flexible deployment of adaptive wireless sensor network applications,” in Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS '05), pp. 653–662, June 2005.
[7]
K. Hussain, A. H. Abdullah, K. M. Awan, F. Ahsan, and A. Hussain, “Cluster head election schemes for WSN and MANET: a survey,” World Applied Sciences Journal, vol. 23, no. 5, pp. 611–620, 2013.
[8]
D. Nguyen, P. Minet, T. Kunz, and L. Lamont, “New findings on the complexity of cluster head selection algorithms,” in Proceedings of the IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM '11), June 2011.
[9]
F. G. Nocetti, J. S. Gonzalez, and I. Stojmenovic, “Connectivity based k-hop clustering in wireless networks,” Telecommunication Systems, vol. 22, no. 1–4, pp. 205–220, 2003.
[10]
K. Ramesh and D. K. Somasundaram, “A comparative study of clusterhead selection algorithms in wireless sensor networks,” International Journal of Computer Science & Engineering Survey, vol. 2, no. 4, 2011.
[11]
S. Rohini and K. Indumathi, “Probability based adaptive invoked clustering algorithm in MANETs,” http://arxiv.org/abs/1102.1754.
[12]
L. Xu and Y. Zhang, “A new reputation-based trust management strategy for clustered ad hoc networks,” in Proceedings of the International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC '09), pp. 116–119, April 2009.
[13]
A. Zabian, A. Ibrahim, and F. Al-Kalani, “Dynamic head cluster election algorithm for clustered Ad-Hoc networks,” Journal of Computer Science, vol. 4, no. 1, pp. 42–50, 2008.
[14]
N. Zaman, A. B. Abdullah, and L. T. Jung, “Optimization of energy usage in wireless sensor network using Position Responsive Routing Protocol (PRRP),” in Proceedings of the IEEE Symposium on Computers and Informatics (ISCI '11), pp. 51–55, March 2011.
[15]
H. S. Lee, K. T. Kim, and H. Y. Youn, “A new cluster head selection scheme for long lifetime of wireless sensor networks,” in Computational Science and Its Applications—ICCSA 2006, vol. 3983 of Lecture Notes in Computer Science, pp. 519–528, Springer, 2006.
