z-logo
open-access-imgOpen Access
An EAOW algorithm to optimize the throughput in ad-hoc network in emergency communication environment
Author(s) -
Yun Wang,
ZengLiang Wu,
tangyao Xie,
Jianguo Yu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1920/1/012067
Subject(s) - computer science , cluster analysis , wireless ad hoc network , throughput , mobile ad hoc network , wireless network , distributed computing , wireless , algorithm , computer network , artificial intelligence , network packet , telecommunications
For improving the throughput of wireless ad-hoc networks in emergency communication environments, this paper proposes an enhanced adaptive on-demand weighted clustering algorithm. The clustering algorithm is very important in heterogeneous wireless ad-hoc networks, but the widely used AOW algorithm has certain limitations. Combined with the emergency communication environment, this article first analyzes the importance of clustering algorithm in improving network throughput, and secondly introduces and analyzes the two shortcomings of the AOW algorithm. On this basis, an enhanced adaptive on-demand weighted clustering algorithm (EAOW) is proposed. In the EAOW algorithm, each weight factor is dimensionlessly processed, and the properties of the nodes are added to the heterogeneous network. The simulation results show that compared with the AOW algorithm, the EAOW algorithm has an obvious progress in the number of cluster heads and the network throughput.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here