Wireless ad-hoc networks have become an important area of research in wireless communication system. In particular, studying the capacity of wireless ad-hoc networks has been a key area of investigation in the research community. In this paper we shall attempt to remedy the situation to the extent that we shall seek efficient clustering algorithms and evaluate the performance of them. Our main objective is to study the problem of evenly distributed cluster formation in ad-hoc wireless environment. It is desirable to have these clusters as evenly distributed as possible over the network to avoid the congestion in the network. Clusterhead form a virtual backbone and are responsible to route packets (message) for nodes in their cluster. In our analysis we will discuss the concept of forwarding index for the clusterhead of the cluster to avoid the congestion in the network. The clusterhead-forwarding index of the network (cluster) is the minimum value of the largest load occurring at a clusterhead taken over all nodes in the cluster, where load of clusterhead is defined as the number of paths (routes) passing through that clusterhead..

1. R.Saad “Complexity of the Forwarding Index problem” LRI technical Report & SIAMS, Disc. Math., 6 (3), pp.418-427, to appear. 1993
2. H.H. Abu Amara, “Fault – tolerance distributed algorithms for election in complete networks”, IEEE Trans. Computers Vol.37, No.4, pp.449-453, Apr. 1998.
3. F.Chung, E. Coffiman, M. Reiman and B.Smon “The forwarding index of Communications Networks “, IEEE trans, info. Theory, 331(1987), 224-232.
4. A.Shastri and P. Zutshi, “Forwarding Index and connectivity of communication Networks” Proceeding of IEEE International Conference on Networking Indian and the World, Ahmedabad (1998).71-77.
5. Y.Manoussakis and Zs. Tuza “The forwarding index of directed networks” technical report. L.R.I No. 482, University of Paris-XI (1989); Disc. Appl. Mathematics, 68, 1996, 279-291
6. M. gray, Micheal R. , and Johnson., David S.; Freeman, Computers and Intractability: “A Guide to the theory of NP- completeness” NewYork,1979.
7. A. Shastri and R. Dadhich, “Load Balancing in Wireless Ad-hoc Networks With Low Forwarding Index”, Proceeding of IEEE International Conference on Information and Automation, held at COLOMBO, Sri Lanka, 14-18 Dec.2005.
8. S. Sargento et al., “Mobile Ad-Hoc Networks Integration in the Daidalos Architecture”, IST Mobile and Wireless Communications Summit 2003, June 2005.
9. Uppsala University, Ad Hoc Implementation Portal website: http://core.it.uu.se/AdHoc/ImplementationPortal, as in February 2006.
10. C. Jelger, T. Noel, “Gateway and address auto configuration for IPv6 adhoc networks”, IETF Internet Draft, draft-jelger-manet-gatewayautoconf-v6-02.txt, Apr. 2004
11. http://www.statsoftinc.com/textbook/stcluam.html, Cluster Analysis.
12. http://riot.ieor.berkeley.edu/riot/Applications/clustring/index.html, Clustring
13. http://www.bluetooth.com
14. Turgut D., Turgut B. S.K.Das, R. Elamasri, “Balancing loads in mobile ad-hoc networks” telecommunications, 2003, ICT 2003, 10th International Conference Vol.1, 23 Feb.-1 march 2003.
15. R. Prakash, A.D Amis, “Load Balancing in Wireless Ad-hoc Networks” Application Specific Systems and Software Engineering Technology, 2000, Proc. 3rd IEEE Symposium, 24-25 march 2000.
16. F.Chung, E. Coffiman, M. Reiman and B.Smon “The forwarding index of Communications Networks “, IEEE trans, info. Theory, 331(1987), 224-232.
17. Abolhasan, M., T. Wysocki and E. Dutkiewicz,. “A Review of Current On-demand Routing Protocols”, ICN 2001, LNCS 2094, pp: 186-195. 2001.
18. Murthy, S. and J. J. Garcia-Luna-Aceves,. “An Efficient Routing Protocol for Wireless Networks”, ACM/Baltzer Mobile Networks and Applications, 1 (2): 183-197. 1996 July 2003.

Ad-hoc Network Routing Performance Protocols