Cluster‐based mobility management algorithms for wireless mesh networks

Abstract

Summary Wireless mesh networks (WMNs) have been the recent advancements and attracting more academicians and industrialists for their seamless connectivity to the internet. Radio resource is one among the prime resources in wireless networks, which is expected to use in an efficient way especially when the mobile nodes are on move. However, providing guaranteed quality of service to the mobile nodes in the network is a challenging issue. To accomplish this, we propose 2 clustering algorithms, namely, static clustering algorithm for WMNs and dynamic clustering algorithm for WMNs. In these algorithms, we propose a new weight‐based cluster head and cluster member selection process for the formation of clusters. The weight of the nodes in WMN is computed considering the parameters include the bandwidth of the node, the degree of node connectivity, and node cooperation factor. Further, we also propose enhanced quality of service enabled routing protocol for WMNs considering the delay, bandwidth, hopcount, and expected transmission count are the routing metrics. The performance of the proposed clustering algorithms and routing protocol are analyzed, and results show high throughput, high packet delivery ratio, and low communication cost compared with the existing baseline mobility management algorithms and routing protocols.