IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
Scopus/Elsevier
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 9 - Issue 1, January 2020 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Design And Development Of Cluster Based Stretch And Shrink Scheme For Topology Stability And Load Balancing In Mobile Ad Hoc Network Using Weighted Clustering Algorithm

[Full Text]

 

AUTHOR(S)

Ramalingam. M

 

KEYWORDS

MANET, Stretch and shrink, WCA Clustering algorithm and Load Balance.

 

ABSTRACT

The Mobile Ad hoc Network (MANET) does not have a stable state and it is constantly changing its structure, so need a good self-regulating technique. There is another problem with this network, namely the problem of information exchange because the network is constantly changing and the communication is complicated. Clustering technology is a good best technique that has been repeatedly tested by many researchers and has been talked about in many research articles. Using this self-regulating method, it build a good topology in the MANET network. In this clustering method, the network is divided into several groups, where each cluster head is elected. The simplest technique of clustering is to ensure the consistency of the MANET network topology as much as possible. Therefore, the use of clustering method in this mobile ad hoc network is simplified to facilitate the communication of various types of algorithms and techniques. Communication using this cluster method on the MANET network takes place in two stages. In the first case, information is only transmitted to individuals within a group. In the second case, information is transmitted from one group to another, that is, to all groups in the network. The clustering group is chosen to maintain the information that is good for this clustering team and send it to the appropriate forecasts. Each cluster head is selected for each group and select this cluster head is based on the WCA (Weighted Cluster Algorithm). Comprise of Cluster based Stretch & Shrink method and the new strategy is dealt with in this research paper, which can confirm its topology stability and the network's load. This new method can reduce the instability of the network and increase its stability. Whenever the clustering load balance is increased, the group is split into two group is called shrink method. At the same time clustering balance density decreases, this group is merged together with a similar low density group known as stretch method.Thus when the density in the cluster decreases or increases, the balance of the group is controlled by the threshold value to ensure the stability of the network. The stretch & shrink method has been compared with the bench mark algorithm and the significant result has produced.

 

REFERENCES

[1] Marco Aurelio Spohn and Garcia-Luna-Aceves J.J., [2007], “Bounded-distance multi-clusterhead formation in wireless ad hoc networks”, Ad Hoc Networks 5(2007), 1570- 8705/$ - see front matter - 2006 Elsevier B.V. All rights reserved. doi:10.1016/j.adhoc.2006.01.005. pp. 504 – 530.
[2] Marco Conti, Silvia Giordano, Gaia Maselli, and Giovanni Turi., [2004], “Mobile metropolitan ad hoc networks”, in Proceedings of the 8th International IFIP-TC6 Conference, Lecture Notes in Computer Science, LNCS - 2775, pp.194–205.
[3] Luc Hogie., [2007], “Mobile Ad Hoc Networks: Modelling, Simulation and Broadcast-based Applications”, University of Le Havre, University of Luxembourg.
[4] John Sucec and Ivan Marsic., [2002], “Clustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks”, Rutgers University, U.S. Army CECOM contract number DAAB07-00-D-G505, IEEE 0-7803-7476-2/02.
[5] Chiang. C.C., Gerla. M and Zhang. L., [1997], “Routing in Clustered Multihop Mobile Wireless Networks with Fading Channel”, in proceedings of IEEE, SICON, Kent Ridge, Singapore, pp. 197–211.
[6] Stephen P. Borgatti., [1994], “How to Explain Hierarchical Clustering”, University of South Carolina, Connections, Vol.17, No.2, pp.78-80, INSNA, National Institute of Technology, Rourkela.
[7] Yu Hongyi., [2005], “Mobile Ad Hoc Wireless Networks”, Version 1, Posts & Telecom press, Beijing.
[8] Suchismita Chinara., [2011], “Analysis and Design of Protocols for Clustering in Mobile Ad Hoc Networks”, National Institute of Technology, Rourkela, India.
[9] Ali Hilal Al-Bayatti., [2009], “Security Management for Mobile Ad hoc Network of Networks (MANoN)”, De Montfort University.
[10] Yao Ye., [2011], “Ad Hoc Networks Measurement Model and Methods Based on Network Tomography”, Ph.D, Belfort Montbéliard University.
[11] Tomoyuki Ohta., Naoyoshi Murakami and Yoshiaki Kakuda.,[2007], “Performance Evaluation of Autonomous Clustering for Hierarchical Routing Protocols in Mobile Ad Hoc Networks”, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07), 0-7695-2838-4/07 $20.00 © 2007, IEEE.
[12] Yi Xu and Wenye Wang., [2006], “MEACA: Mobility and Energy Aware Clustering Algorithm for Constructing Stable MANETs”, Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, IEEE, NC 27606.
[13] Ghosh R. and Basagni S.,[2005], “Limiting the impact of mobility on ad hoc clustering”, in Proceedings of ACM PE-WASUN, pp. 197–204.
[14] Perkins. C., and Bhagwat. P., [1994], “Highly dynamic destination-sequenced distance- vector routing (DSDV) for mobile computers”, in Proc, ACM Conf. on Communications Architectures, Protocols and Applications, pp. 234 – 244.
[15] Abdel Rahman H., Hussein, Sufian Yousef and Omar Arabiyat., [2006], “A Load- Balancing and Weighted Clustering Algorithm in Mobile Ad-Hoc Network”, Faculty of Science & Technology, Anglia Ruskin University, UK.
[16] Amis A., Prakash R., Vuong T., and Huynh D.T., [1999], “Max-Min D-Cluster Formation in Wireless Ad Hoc Networks”, in Proceedings of IEEE INFOCOM, March, 1999.
[17] Alan D., Amis and Ravi Prakash., [1998], “Load-Balancing Clusters in Wireless Ad Hoc Networks”, Department of Computer Science, University of Texas at Dallas, Richardson, Texas 75083-0688.
[18] Anupama M. and Bachala Sathyanarayana., [2011], “Survey of Cluster Based Routing Protocols in Mobile Ad hoc Networks”, International Journal of Computer Theory and Engineering, Vol. 3, No. 6, pp.806 – 815.
[19] Basagni. S., [1999], “Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks”, in Proceedings of VTC, IEEE Vehicular Technology Conference, pp. 889-893.
[20] Das. S. R., Perkins. C. E., Royer. E. M. and M. K. Marina.,[2001], “Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks”, in IEEE Personal Communications Magazine, special issue on Mobile Ad Hoc Networks, Vol. 8, No. 1, pp. 16-29.
[21] Gerla M., and Tsai J.TC.,[1995], “Multicluster, Mobile, Multimedia Radio Network Wireless Networks”, pp. 255-265.
[22] Tomoyuki Ohta., Naoyoshi Murakami and Yoshiaki Kakuda.,[2007], “Performance Evaluation of Autonomous Clustering for Hierarchical Routing Protocols in Mobile Ad Hoc Networks”, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07), 0-7695-2838-4/07 $20.00 © 2007, IEEE.
[23] Ramalingam. M., Thiagarasu.V., [2014], “Identified the Cluster Based Stretch and Shrink Method Based on Load Balancing Algorithm for Ad Hoc Network Topology Stability”, International Journal on Recent and Innovation Trends in Computing and Communication, ISSN: 2321-8169, Vol. 2,No.9, pp.92631–2635.
[24] Ramalingam. M., Thiagarasu.V., [2014], “Cluster Based Stretch and Shrink Method for Manet Using Load Balancing, Nearest Neighbor and Rule Mining”, International Journal of Engineering Sciences & Research Technology, ISSN: 2277 – 9655,Vol.3,No.10,pp.392-400.