Mobility-based d-hop clustering algorithm for mobile ad hoc networks

Abstract

Abstract-This paper presents a mobility-based d-hop clustering algorithm (MobDHop), which forms variable-diameter clusters based on node mobility pattern in MANETs. We introduce a new metric to measure the variation of distance between nodes over time in order to estimate the relative mobility of two nodes. We also estimate the stability of clusters based on relative mobility of cluster members. Unlike other clustering algorithms, the diameter of clusters is not restricted to two hops. Instead, the diameter of clusters is flexible and determined by the stability of clusters. Nodes which have similar moving pattern are grouped into one cluster. The simulation results show that MobDHop has stable performance in randomly generated scenarios. It forms lesser clusters than Lowest-ID and MOBIC algorithm in the same scenario. In conclusion, MobDHop can be used to provide an underlying hierarchical routing structure to address the scalability of routing protocol in large MANETs.

Balanced and Safe Weighted Clustering Algorithm for Mobile Wireless Sensor Networks

“…Research studies on clustering in Ad-hoc networks evolve surveyed works on clustering algorithms [16] and cluster head election algorithms [3,10]. For the single metric based on clustering, as in paper [17], the node with the least stability value is elected as CH among its neighbors, however the choice of CH which has a lower energy level, could quickly become a bottleneck of its cluster. Safa et al [4] designed and implemented a dynamic energy efficient clustering algorithm (DEECA) for mobile Ad-hoc networks (MANETs) that increases the network lifetime, however, the cluster formation in this scheme is not based on connectivity so the formed clusters are not well connected; this induces an increase of re-affiliation rate and re-clustering situations.…”

A Virtual Laboratory to Practice Mobile Wireless Sensor Networks: A Case Study on Energy Efficient and Safe Weighted Clustering Algorithm

“…Research studies on clustering in ad-hoc networks involve surveyed works on clustering algorithms [13,23] and cluster head election algorithms [14,24]. A single metric based on clustering as in paper [25] shows that the node with the least stability value is elected as CH among its neighbors. However, the choice of CH which has a lower energy level could quickly become a bottleneck of its cluster.…”

Clustering Heuristics in Wireless Networks: A Survey

“…Mobility-based d-hop distributed clustering algorithm (MobDHop) generates variable-diameter clusters based on mobility pattern in Mobile Ad hoc Networks (MANETs) to achieve the desired scalability (Er and Seah 2004). The MobDHop algorithm allows cluster members to be more than two hops away from their CH and determines the diameter of clusters by measuring the stability of clusters.…”