Title: Efficient clustering for mobile ad hoc networks using K-hop weighted paired domination

Authors: T.N. Janakiraman, J. Janet Lourds Rani

Addresses: Department of Mathematics, National Institute of Technology, Tiruchirappalli, TamilNadu 620 014, India. ' Department of Mathematics, National Institute of Technology, Tiruchirappalli, TamilNadu 620 014, India

Abstract: Network clustering is an important technique widely used in mobile ad hoc network (MANET) management, hierarchical routing protocol design, network modelling and quality of service. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the K-hop weighted paired dominating set, where each node is assigned weight based on the closeness index and its degree. A cluster is defined to be the set of vertices that are dominated by a pair of vertices in the paired dominating set. Partitioning the network into minimum number of paired dominating set with double star topology is polynomial time approach as it is related to the type of finding a maximum matching in a given network. In this new approach, each cluster has a master and a proxy master, which partitions the network into double star clusters. The time required to determine the cluster heads depends on the matching of the underlying graph. The simulation of the required model prove that this proposed algorithm has better performance and provides better cluster connectivity.

Keywords: network clustering; graph; paired domination; double star topology; matching; closeness index; mobile ad hoc networks; MANETs; mobile networks; simulation.

DOI: 10.1504/IJICT.2010.032411

International Journal of Information and Communication Technology, 2010 Vol.2 No.3, pp.228 - 243

Published online: 02 Apr 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article