Reliable Scheme for Cluster Head Election in Mobile Ad Hoc Networks

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2018 by IJCTT Journal
Volume-61 Number-2
Year of Publication : 2018
Authors : William Asiedu, Maxwell Dorgbefu Jnr, Samuel Adu Gyamfi
DOI :  10.14445/22312803/IJCTT-V61P116

MLA

MLA Style: William Asiedu, Maxwell Dorgbefu Jnr, Samuel Adu Gyamfi "Reliable Scheme for Cluster Head Election in Mobile Ad Hoc Networks" International Journal of Computer Trends and Technology 61.2 (2018):93-99.

APA Style:William Asiedu, Maxwell Dorgbefu Jnr, Samuel Adu Gyamfi (2018). Reliable Scheme for Cluster Head Election in Mobile Ad Hoc Networks International Journal of Computer Trends and Technology, 61(2),93-99

Abstract
Ad hoc mobile devices are set of consistent heterogeneous devices that move in an independent fashion and communicate with one another over a wireless channel. These devices are presumed to have a non-deterministic mobility pattern. Clusters are formed by clubbing together nodes and heads are elected to manage, serve as a backbone, and route packets to other cluster heads. A lot of policies used in selection of cluster heads are biased in favor of some nodes. The result of the responsibilities of cluster heads, may deplete their energy faster due to higher number of communications with nodes on the network. This situation might cause them to drop out of the network. This paper therefore, proposes a reliable scheme for election of cluster heads by giving all nodes the opportunity to serve as a cluster head and provides enhancement to existing algorithms to minimize the unbalanced distribution of nodes under cluster heads and increase the active life of a node in a network. The scheme elects right cluster head and help nodes to relinquish their headship to other nodes if their power is low.

Reference
[1] Conti, M., Giordano, S.: ‘Multi-hop adhoc networking: the theory’, IEEE Commun. Mag., 2007, 45, (4), pp. 78–86
[2] Chlamtac, I., Conti, M., Liu, J.-N.: ‘Mobile adhoc networking imperatives and challenges’, Ad Hoc Netw., 2003, 1, (1), pp. 13–64
[3] Akkaya, K., Younis, M.: ‘A survey on routing protocols for wireless sensor networks’, Elsevier J. Ad Hoc Netw., 2005, 3, (3), pp. 325–349
[4] Wu, J., Li, H.: ‘On calculating connected dominating set for efficient routing in ad hoc wireless networks’. Proc. Third ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14
[5] Basagni, S., Mastrogiovanni, M., Panconesi, A., Petrioli, C.: ‘Localized protocols for ad hoc clustering and backbone formation: a performance comparison’, IEEE Trans. Parallel Distrib. Syst., 2006, 17, (4), 292–306
[6] Er, I.I., Seah, W.K.G.: ‘Performance analysis of mobility-based d-hop (mobdhop) clustering algorithm for mobile ad hoc networks’, Comput.Netw., 2006, 50, (17), 3375–3399
[7] Baker, D.J., Ephremides, A.: ‘The architectural organization of a mobile radio network via a distributed algorithm’, IEEE Trans. Commun., 1981, 29, (11), pp. 1694–1701
[8] Ephremides, A., Wieseltheir, J.E., Baker, D.J.: ‘A design concept for reliable mobile radio networks with frequency hopping signaling’, Proc. IEEE, 1987, 75, (1), pp. 56–73
[9] Parekh, A.: ‘Selecting routers in ad hoc wireless networks’. Proc. IEEE Int. Telecommunications Symp., 1994
[10] Chiang, C.-C., Gerla, M.: ‘Routing in clustered multihop, mobile wireless networks with fading channel’. Proc. IEEE SICON 97, 1997
[11] Yu, J.Y., Chong, P.: ‘3hbac(3-hops between adjacent clusterheads): a novel non-overlapping clustering algorithm for mobile ad hoc networks’. Proc. IEEE Pacrim 03, August 2003, vol. 1, pp. 318–321
[12] Lin, C., Gerla, M.: ‘Adaptive clustering for mobile wireless networks’. IEEE JSAC, September 1997, vol. 15, pp. 1265–1275
[13] Choi, W., Woo, M.: ‘A distributed weighted clustering algorithm for mobile ad hoc networks’. Proc. IEEE ICIW, 2006
[14] Donald, A.A.M., Znati, T.: ‘Mobility based framework for adaptive clustering in wireless ad hoc networks’, IEEE J. Sel. Areas Commun.,1999, 17, (8), pp. 1466–1486
[15] Mahasukhon, P., Sharif, H., Hempel, M., Zhou, T., Wang, W., Chen, H.H.: ‘IEE 802.11b based ad hoc networking and its performance in mobile channels’, IET Commun., 2009, 5, (1), pp. 689–699
[16] Basu, P., Khan, N., Little, T.D.C.: ‘A mobility based metric for clustering in mobile ad hoc networks’. Proc. IEEE ICDCW 01, April 2001, pp. 413–418
[17] Hee Ryu, J., Song, S., Cho, D.-H.: ‘New clustering schemes for energy conservation in two tiered mobile ad-hoc networks’. Proc. IEEE ICC 01, June 2001, vol. 3, pp. 862–866
[18] Wu, J., Dai, F., Gao, M., Stojmenovic, I.: ‘On calculating power – aware connected dominating sets for efficient routing in ad hoc wireless networks’, J. Commun. Netw., 2002, 4, (1), pp. 59–70
[19] Amis, A.D., Prakash, R., Vuong, T., Huynh, D.: ‘Max-min-d-cluster formation in wireless ad hoc networks’. IEEE INFOCOM, 2000, pp. 1293–1302
[20] Basagni, S.: ‘Distributed clustering for mobile ad hoc network’. Proc. 1999 Int. Symp. Parallel Architectures, Algorithms and Networks (I-SPAN’99), 1999, pp. 310–315
[21] Basagni, S.: ‘Distributed and mobility adaptive clustering for multimedia support in multi-hop wireless networks’. Proc. Vehicular Technology Conf., 1999
[22] Basagni, S., Turgut, D., Das, S.K.: ‘Mobility adaptive protocols for managing large ad hoc networks’, IEEE Int. Conf. Commun., 2001, 5, pp. 1539–1543
[23] Ghosh, R., Basagni, S.: ‘Limiting the impact of mobility on ad hoc clustering’. Proc. Second ACM Int. Workshop Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitious Network, 2005
[24] Chatterjee, M., Das, S.K., Turgut, D.: ‘Wca: a weighted clustering algorithm for mobile ad hoc networks’, Cluster Comput., 2002, 5, (1), pp. 193–204
[25] Li, C., Wang, Y., Huang, F., Yang, D.: ‘A novel enhanced weighted clustering algorithm for mobile ad hoc networks’, Wirel. Commun., Netw. Mob. Comput., 2009, 1, pp. 1–4
[26] Wang, Y.-X., Bao, F.S.: ‘An entropy-based weighted clustering algorithm and its optimization for ad hoc networks’. Third IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communications (WiMOB 2007), 2007
[27] Wang, Y., Chen, H., Yang, X., Zhang, D.: ‘Wachm: weight based adaptive clustering for large scale heterogeneous manet’. IEEE Conf.

Keywords
ad hoc network, load balancing, clustering, communications, policies