Ad-hoc Network Clustering Algorithm Based on Node Data Value
- https://doi.org/10.2991/cmsa-18.2018.26How to use a DOI?
- Ad-hoc network; cluster; node data value; stability
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.
- © 2018, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Jingmin Tang AU - Zhangbao Gao PY - 2018/04 DA - 2018/04 TI - Ad-hoc Network Clustering Algorithm Based on Node Data Value BT - Proceedings of the 2018 International Conference on Computer Modeling, Simulation and Algorithm (CMSA 2018) PB - Atlantis Press SP - 110 EP - 114 SN - 1951-6851 UR - https://doi.org/10.2991/cmsa-18.2018.26 DO - https://doi.org/10.2991/cmsa-18.2018.26 ID - Tang2018/04 ER -