Abstract

Mobile Ad-hoc Networks (MANETs) are expected to play an important role in military networks by providing infrastructure less communication. However, maintaining secure and instant information sharing is a difficult task especially for highly dynamic military MANETs. Different solution proposed for scaling own the large size of military ad hoc network, one of the most intrinsic approaches is clustering techniques which evolved an important role in military mobile ad hoc networks. Clustering can be used for load balancing to extend the lifetime of ad hoc network by reducing energy consumption and increase network scalability. And the cluster one node works as a cluster head and coordinates all the activities such as routing. In this study, an Improved Load Balanced Connection Aware (ILBCA) clustering hierarchy protocol is presented for MANET that leads to cluster formation in military application. The protocol launches two consecutive phases called setup and steady-state. In setup phase, cluster heads and relay nodes as well as the path between member node from cluster and cluster head are determined. In steady-state phase, network data is collected from member nodes and transmitted to cluster head according to the topology which is determined in the same round. Simulated tests indicate that the ILBCA clustering hierarchy protocol can build more balanceable clustering structure, enhance the network life cycle and energy efficiency.

Keywords:

Cluster, distance and density, hierarchy protocol, military, mobility, Mobile Ad-hoc Networks (MANETs), position, random distribution,

References

1. Al-kahtani, M.S. and H.T. Mouftah, 2005. Enhancements for clustering stability in mobile ad hoc networks. Proceeding of the 1st ACM International Workshop on Quality of Service and Security in Wireless and Mobile Networks, ACM, New York, pp: 112-121.
   CrossRef    
2. Amis, A.D. and R. Prakash, 2000. Load-balancing clusters in wireless ad hoc networks. Proceedings of 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, pp: 25-32.
   CrossRef    
3. Basu, P., N. Khan and T.D.C. Little, 2001. A mobility based metric for clustering in mobile ad hoc networks. Proceeding of the International Conference Distributed Computing Systems Workshop, pp: 413-418.
   CrossRef    
4. Chatterjee, M., S.K. Das and D. Turgut, 2002. WCA: A weighted clustering algorithm for mobile ad hoc networks. Cluster Comput., 5(2): 193-204.
   CrossRef    
5. Chen, G., F.G. Nocetti, J.S. Gonzalez and I. Stojmenovic, 2002. Connectivity based k-hop clustering in wireless networks. Proceeding of the 35th Annual Hawaii International Conference on System Sciences, pp: 2450-2459.
   CrossRef    
6. Chiang, C.C., H.K. Wu, W. Liu and M. Gerla, 1997. Routing in clustered multihop, mobile wireless networks with fading channel. Proceeding of IEEE SICON' 97, pp: 197-211.
   
7. Dhurandher, S.K. and G.V. Singh, 2005. Weight based adaptive clustering in wireless ad hoc networks. Proceeding of the IEEE International Conference on Personal Wireless Communications (ICPWC, 2005), pp: 95-100.
   CrossRef    
8. Er, I.I. and W.K.G. Seah, 2004. Mobility-based d-hop clustering algorithm for mobile ad hoc networks. Proceeding of the IEEE Wireless Communications and Networking Conference, 4: 2359-2364.
   CrossRef    
9. Gerla, M. and J.T.C. Tsai, 1995. Multicluster, mobile, multimedia radio network. Wirel. Netw., 1: 255-265.
   CrossRef    
10. Kadir, J., O. Ghazali, M. Firdhous and S. Hassan, 2011. Node selection based on energy consumption in MANET. Internetworks Research Group, School of Computing, University Utara Malaysia, pp: 1-6.
    
11. Kwon, T.J., M. Gerla, V.K. Varma, M. Barton and T.R. Hsing, 2003. Efficient flooding with passive clustering-an overhead-free selective forward mechanism for ad hoc/sensor networks. P. IEEE, 91(8): 1210-1220.
    CrossRef    
12. Li, F., S. Zhang, X. Wang, X. Xue and H. Shen, 2004. Vote-based Clustering Algorithm in Mobile Ad Hoc Networks. In: Kahng, H.K. and S. Goto (Eds.), ICOIN, 2004. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 3090: 13-23.
    CrossRef    
13. Lin, C.R. and M. Gerla, 1997. Adaptive clustering for mobile wireless networks. IEEE J. Sel. Area. Comm., 15: 1265-1275.
    CrossRef    
14. McDonald, A.B. and T.F. Znati, 1999. A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE J. Sel. Area. Comm., 17: 1466-1487.
    CrossRef    
15. Ohta, T., S. Inoue and Y. Kakuda, 2003. An adaptive multihop clustering scheme for highly mobile ad hoc networks. Proceeding of 6th International Symposium on Autonomous Decentralized Systems (ISADS, 2003), pp: 293-300.
    CrossRef    
16. Ryu, J.H., S. Song and D.H. Cho, 2001. New clustering schemes for energy conservation in two-tiered mobile ad-hoc networks. Proceeding of IEEE International Conference on Communications (ICC, 2001). Helsinki, Finland, 3: 862-866.
    
17. Safa, H. and O. Mirza, 2010. A load balancing energy efficient clustering algorithm for MANETs. Int. J. Commun. Syst., 23: 463-483.
    CrossRef    
18. Tolba, F.D., D. Magoni and P. Lorenz, 2007. Connectivity, energy & mobility driven weighted clustering algorithm. Proceeding of IEEE GLOBECOM, pp: 2786-2790.
    
19. Wang, Y.X. and F.S. Bao, 2007. An entropy-based weighted clustering algorithm and its optimization for ad hoc networks. Proceeding of the 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, pp: 56.
    CrossRef    
20. Wu, J., F. Dai, M. Gao and I. Stojmenovic, 2002. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. J. Commun. Netw., 4(1): 1-12.
    CrossRef    
21. Yu, J.Y. and P.H.J. Chong, 2003. 3hBAC (3-hop between Adjacent Clusterheads): A novel non-overlapping clustering algorithm for mobile ad hoc networks. Proceeding of IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM, 2003), 1: 318-321.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.