Journals Proceedings

Abstract

An ad-hoc network consists of a set of mobile nodes which are connected with each other by using radio waves. Load balancing is the process of improving the performance of a parallel. This network does not have any infrastructure or central administration, hence it is called infrastructure less network. As the nodes are mobile, it is very difficult to find the path between two end points. This paper presents a solution for finding path between nodes in mobile ad hoc network. For maintaining multiple routes between two endpoints on top of the Stream Control Transmission Protocol (SCTP), and the Dynamic Source Routing (DSR) protocol. A number of additional modifications are incorporated to the SCTP protocol in order to allow its smooth operation. Some of the parameters used to evaluate its performance are packet delays and throughput. The results of this algorithm shows better throughput as compared to existing algorithms. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic both types of algorithm can have advancements as well as weaknesses over each other. Deciding type of algorithm to be implemented will be based on type of parallel applications to solve. The main purpose of this paper is to help in design of new algorithms in future by studying the behavior of various existing algorithms