A robust and energy-efficient weighted clustering algorithm on mobile ad hoc sensor networks
Summary: In an Ad hoc sensor network, nodes have characteristics of limited battery energy, self-organization and low mobility. Due to the mobility and heterogeneity of the energy consumption in the hierarchical network, the cluster head and topology are changed dynamically. Therefore, topology control and energy consumption are growing to be critical in enhancing the stability and prolonging the lifetime of the network. In order to improve the survivability of Ad hoc network effectively, this paper proposes a new algorithm named the robust, energy-efficient weighted clustering algorithm (RE\(^2\)WCA). For the homogeneous of the energy consumption; the proposed clustering algorithm takes the residual energy and group mobility into consideration by restricting minimum iteration times. In addition, a distributed fault detection algorithm and cluster head backup mechanism are presented to achieve the periodic and real-time topology maintenance to enhance the robustness of the network. The network is analyzed and the simulations are performed to compare the performance of this new clustering algorithm with the similar algorithms in terms of cluster characteristics, lifetime, throughput and energy consumption of the network. The result shows that the proposed algorithm provides better performance than others.
- Toward energy-efficient and robust clustering algorithm on mobile ad hoc sensor networks
- A weight-based clustering algorithm for mobile ad hoc network
- Robust self-stabilizing weight-based clustering algorithm
- A distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks
- scientific article; zbMATH DE number 6718904
This page was built for publication: A robust and energy-efficient weighted clustering algorithm on mobile ad hoc sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331633)
