Ad-hoc Network Clustering Algorithm Based on Node Data Value

摘要

Ad-hoc network is a repeatedly jumping, nothing central, and self-organizing network, the entire network has not stable infrastructure, consisting of mobile nodes. According to the problem that cluster Ad-hoc network cluster head selection mechanism is not reasonable and the cluster heads, and cluster members in sending data process transmit the data that is too large or too small to node failure. So, we proposed clustering algorithm of Ad-hoc network based on node data value, The algorithm chooses cluster heads in different clusters according to the data value, node energy value, optimal node degree and node average distance, the cluster head collects the date of cluster members and integration it to go to the next step Communication and other work. In contrast to simulation and comparison experiment of the other three traditional algorithms, the results indicated that applying the algorithm of Ad-hoc network in cluster number are optimized, the property in repeatedly into the cluster and rule setup date has improved, and in a certain extent it prolongs the network life cycle, in the meantime it improves the stability of the cluster structure.