A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links’ Weight to Increase Network Stability

Karimi, Abbas; Afsharfarnia, Abbas; Zarafshan, Faraneh; Al-Haddad, S. A. R.

doi:10.1155/2014/432952

Cited by 32 publications

(14 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the main drawbacks of this study can be classified as huge amount of memory requirement, several overhead devoted for save and transmit the MIPs and unaware density cluster creation. A new set of approaches, weighted distributed clustering algorithm for LMANET (CBPMD), modified weight clustering algorithm, and a determination of virtual links' weight clustering algorithm to increase network stability, are presented to create CHs taking into account the neighborhood degree, mobility, and energy, respectively. In these algorithms, aspects of every node are calculated, and then based on the calculation, nodes' weights are determined.…”

Section: Related Workmentioning

confidence: 99%

An efficient routing protocol for the QoS support of large‐scale MANETs

Nazhad

Shojafar

Shamshirband

et al. 2017

Int J Communication

View full text Add to dashboard Cite

SummaryThe hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large-scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. Hierarchical clustering algorithm jointly utilizes table-driven and on-demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average endto-end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state-of-the-art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic-Based Clustering, Dynamic Link Duration Clustering, and mobility-based clustering algorithms. KEYWORDScluster head (CH), clustering, cost metrics, hierarchical routing algorithm, mobile ad hoc networks (MANET)

show abstract

Section: Related Workmentioning

confidence: 99%

An efficient routing protocol for the QoS support of large‐scale MANETs

Nazhad

Shojafar

Shamshirband

et al. 2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…A 1-hop weight-based clustering algorithm for MANETs which considers neighborhood contribution and average minimum power in CH selection was proposed in [10]. In [11], a 1-hop virtual links weightbased clustering (VLWBC) algorithm was presented to improve the stability of clusters in MANETs where the weight of a node is based on features of its adjacent nodes. A d-hop secured weight-based clustering algorithm (SCA) which allows for the effective performance and protection of MANETs by using a trust value and some system parameters for determining which nodes are elected as CHs was described in [12].…”

Section: Related Workmentioning

confidence: 99%

An Efficient 2 hop Weight based Clustering Algorithm

Caine¹,

Edward²

2016

Fourth International Conference on Advances in Computing, Communication and Information Technology CCIT- 2016

View full text Add to dashboard Cite

Abstract-Mobile Ad Hoc Networks (MANETs) allow mobile nodes to communicate without a need for a fixed infrastructure. Nodes within MANETs move about arbitrarily, dynamically changing their connectivity and possibly partitioning the network. In this paper, we consider weightbased clustering as a viable approach to alleviate these issues. However, many of the existing weight-based clustering algorithms suffer from a high re-clustering rate resulting in the production of relatively unstable clusters.Therefore, we propose a 2-hop weight-based clustering algorithm, RPMW in the view that it will minimize the re-clustering rate of the network and thus preserve its lifetime. RPMW takes into consideration the weight factors of PMW along with the node degree in calculating the weight of a node. We provide a comparative analysis of these two algorithms in which RMPW is shown to outperform PMW in cluster stability thus maximizing the lifespan of clusters.

show abstract

“…In clustering technique, nodes which are geographically close together form clusters. If stability of clusters is not maintained then they may cause rapid failure [5]. After forming cluster, a CL will be elected to handle the communication within the cluster.…”

Section: Basics and Backgroundmentioning

confidence: 99%

Ant based routing algorithm over clustering technique to provide better communication for manets with minimum hop count

2016

IJLTET

View full text Add to dashboard Cite

A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links’ Weight to Increase Network Stability

Cited by 32 publications

References 29 publications

An efficient routing protocol for the QoS support of large‐scale MANETs

An efficient routing protocol for the QoS support of large‐scale MANETs

An Efficient 2 hop Weight based Clustering Algorithm

Ant based routing algorithm over clustering technique to provide better communication for manets with minimum hop count

Contact Info

Product

Resources

About