Efficient clustering for mobile ad hoc networks using K-hop weighted paired domination
by T.N. Janakiraman, J. Janet Lourds Rani
International Journal of Information and Communication Technology (IJICT), Vol. 2, No. 3, 2010

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.

Online publication date: Fri, 02-Apr-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com