S. Kushwaha, A. Pandey, P. Gupta (India), and C.J. Hwang (USA)
Mobile Ad Hoc networks, Clusters, Load balancing, Power consumption, Dominant set
This paper proposes an on-demand distributed clustering algorithm for self-organizing, multihop, mobile packet radio network where mobile nodes are organized into non-overlapping clusters. These clusters are independently controlled and are dynamically reconfigured as nodes may move from one cluster to another cluster. The main advantages of network are to provide spatial reuse of bandwidth due to node clustering and to share or resuse bandwidth in a controlled fashion in each cluster. The proposed algorithm is robust due to the motion, failure, insertion or deletion of nodes. This non periodic algorithm for clusterhead election reduces the computational cost and communication costs.
Important Links:
Go Back
