By Topic

A Cluster Head Selection Algorithms in Wireless Network Based on Maximal Weighted Independent Set

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guohun Zhu ; Dept 8th, Guilin Univ. of Electron. Technol., Guilin, China ; Xi Jiang ; Chun Wu ; Zhiqiang He

This paper presents a cluster head selection algorithm in wireless network, which is based on an optimal algorithm to find a maximum weighted independent set (MWIS) in planar graph. It is analysed that the wireless AD hoc networks and the application of the maximum weighted independent set. To prove the validity and practicability of MWIS, we compare MWIS algorithm with minimum ID clustering algorithm and maximum degree clustering algorithm by using a topological subgraph.

Published in:

Ubiquitous Information Technologies and Applications (CUTE), 2010 Proceedings of the 5th International Conference on

Date of Conference:

16-18 Dec. 2010