Load Balancing in Wireless Mobile Ad Hoc Networks

Abstract

Ad hoc networks consist of a set of homogeneous nodes (computers or embedded devices) that move in an independent fashion and communicate with the other node in the topology over a wireless channel. Such networks are logically realized as a set of clusters by grouping together nodes which are in close proximity with one another or through another wireless node. Clusters are formed by clubbing together nodes along the wireless links. Cluster Heads are the nodes which communicate with the other nodes that it can cover under its communication range. Cluster Heads form a virtual backbone and may be used to route packets for nodes in their cluster. Nodes, being in an Ad Hoc network, are presumed to have a non-deterministic mobility pattern. Different heuristics employ different policies to elect Cluster Heads. Many of these policies are biased in favor of some nodes. As a result, these nodes shoulder greater responsibility which may deplete their energy faster due higher number of communication made, causing them to drop out of the network. Therefore, there is a need for load-balancing among Cluster Heads to allow all nodes the opportunity to serve as a Cluster Head. I propose a few enhancements to existing algorithms to remove the unbalanced distribution of nodes under the Cluster Heads and increase the active life of a node in a network.