MANET is a multi-cluster, multi-hop packet radio network that should adapt itself to the dynamically changing network configurations. This dynamic reconfiguration is governed by clusterheads, a major set of nodes that have enough resources to be capable of routing packets in the network. This paper proposes a load balancing heuristic to extend the network lifetime. It has two phases. Initial clustering is done for the entire network in start up phase that takes node's degree and energy as input parameters. The maintenance phase keeps the network topology updated through global re-clustering and local updation. Global reclustering is initiated when the network becomes significantly unbalanced i.e. if the variance of degree of the cluster heads in the network is greater than a pre-determined threshold. It is expected to get better result than the time driven algorithms, as implementation is still under progress.

In this paper, an efficient and modified load balancing algorithm is proposed. This paper shows the results of the proposed energy aware load balancing algorithm. Global reclustering is initiated when the network becomes significantly unbalanced i.e. if the variance of degree of the cluster heads in the network is greater than a pre-determined threshold. Degree of all cluster heads would be required at a single node to evaluate the average of degree of all cluster heads in the network and subsequently the variance among themselves, which is not possible in adhoc network because of its distributed nature. For this, a formula is derived in which variance can be updated at each hop i.e. variance of N nodes can be expressed in terms of variance of (N-1) nodes and average of (N-1) nodes. The results of simulation indicate that compared with the load balanced routing algorithm DEECA, the proposed algorithm increased the network lifetime, packet delivery ratio at different traffic.

Load balancing involves assigning tasks to each processor proportional to its performance and to minimize communication overhead. The assignment can be static-done at compile time, or it may be dynamic-done at run-time. Many load balancing polices achieve high system performance by increasing the utilization of CPU, memory, or a combination of CPU and memory [3]. In this paper Modified Triangle Scheduling Scheme (MTSS) is proposed which modifies the Minimum Distance Scheduling (MDS). This scheme has been implemented on Linearly Extensible Triangle (LEΔ) and Linearly Extensible Tree (LET) which reduces the Load Imbalance Factor (LIF) and also the execution time of parallel tasks assigned to the processors. General Terms

No abstract

No abstract