Mobile awareness based cluster selection mechanisms in wireless ad hoc networks

Wu, Ho‐Ting; Ke, Kai-Wei; Chen, Chun‐Hung; Kuan, Chen-Wei

doi:10.1109/vetecf.2004.1400563

Cited by 8 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Not suitable for UAV combat missions. References [16][17][18] use different parameters for weighted clustering respectively, but do not consider the difficult problem of communication in the case of radio silence. Based on the original LEACH algorithm, the literature [19] introduces the distance and residual energy priority functions, and proposes the BEAD-LEACH algorithm.…”

mentioning

confidence: 99%

A clustering algorithm for UV-cooperative UAV network in dynamic scenarios

Zhao,

刘,

Zhang

et al. 2023

Preprint

View full text Add to dashboard Cite

To address the electromagnetic interference problems faced by swarm UAVs in complex environments and the clustering needs of swarm UAV networks in dynamic scenarios, this paper proposes a weighted clustering algorithm for wireless UV cooperative swarm UAVs, which combines the advantages of UV anti-interference and high secrecy to provide a reliable communication method for swarm UAVs. By introducing adaptive node degree, UAV energy efficiency, and distance stability parameters to improve the cluster head election formula, the algorithm is made more applicable to dynamic scenarios. Simulation results show that this algorithm can improve the network survival period by 16%, while reducing the average number of cluster heads by 37% and nearly doubling the data transmission volume.

show abstract

mentioning

confidence: 99%

A clustering algorithm for UV-cooperative UAV network in dynamic scenarios

Zhao,

刘,

Zhang

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

Trust‐based routing method using a mobility‐based clustering approach in mobile ad hoc networks

RahimiZadeh

Kabiri

2013

Security Comm Networks

View full text Add to dashboard Cite

Quality of service (QoS) provisioning in mobile ad hoc networks (MANETs) is one of the fundamental concerns in this area. Autonomous mobility of nodes is one of the main factors affecting the network QoS. A lack of fixed infrastructure and central control on the nodes complicate guaranteeing the QoS in MANETs. Security is a major factor affecting the QoS in such networks. This paper proposes a new routing method based on trust among the nodes and applies a clustering approach to MANETs. This routing scheme can calculate the trustworthiness of the route and the shortest routes to the destination by avoiding identified malicious nodes. The effects of node mobility and number of malicious nodes on routing performances are investigated in the reported research. Simulation is used to show the effectiveness of the proposed approach in comparison with a categorized trust method, Ad hoc On‐demand Distance Vector, trust vector‐based Ad hoc On‐demand Distance Vector, and trust vector‐based dynamic source routing in terms of end‐to‐end delay, network throughput, and packet delivery ratio at the expense of a moderate increase in the routing overhead. The proposed trust‐based routing method finds the trustworthy route by applying end‐to‐end trust calculation and finds the optimal route by performing clustering scheme from the source node to the destination node. In the extended proposed routing method, adding a nonce‐based encryption scheme results in improved packet delivery ratio, network throughput, and malicious node detection rate. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract