An Enhanced Forecast Weighted Clustering Algorithm for Reducing Overheads in Mobile Ad-hoc Networks

Authors: Akanksha Soni, Nisha Bhati

Certificate: View Certificate

Abstract

In this paper, we propose an enhanced forecast weighted clustering algorithm (EFWCA) which can reduce the computational overhead by electing the right candidate for the cluster head. This novel approach can handle enormous traffic and makes the network more stable. Wireless mobile adhoc networks (MANET) are prone to having routing issues due to their variable nature and resource constraints. Routing is an essential approach in adhoc networks for data transmission because every node serves as a router in the absence of a central router. Several routing schemes have been advised in order to discover route, many of which use the flooding method. The flooding method offers to discover routes through flooding of routing packets in the network. In this method routing packets are traversing throughout the network infinitely and unnecessarily consume resources such as battery power and bandwidth and cause throughput degradation. To solve the noted problem, clustering and efficient flooding methods are some of the alternatives. To form clusters and elect a cluster-head for a homogenous network, several techniques have been suggested by the researchers. Here, the suggested algorithm is simulated in network simulation and its performance is evaluated in the context of various parameters.

Introduction

A wireless network is a group of wireless devices connected by radio waves, such as laptops, wherein each device is capable of forwarding data packets to each other and can communicate over a wide range of networks. Each device works as a router as well as the host and reconfigured them self when needed. With regard to mobile ad-hoc networks, routing is an essential approach for data transmission. To make routing efficient in a highly unpredictable network, clustering mechanism is adopted. The motive behind clustering is to reduce the routing overhead occurred due to flooding of routing packets by generic routing protocols. Clustering works by splitting the network perimeter into logical regions. Each logical region is created by some criteria such as 1-hop and k-hop neighbor. The whole control of constructed region is given to one capable device that is designated as the cluster- head. In clustering, nodes are designated as cluster-heads, gateways and members or ordinary nodes according to their roles and responsibilities. Cluster-head election is one procedure in clustering, which is accomplished by following several processes and maintaining different criteria. Ordinary nodes or member nodes send packets to the cluster head or forward packets to the gateway node. Gateway nodes then forward the packets further to other clusters. This paper presents a comparative study of some of the prominent cluster-head election techniques. To ensure effective and efficient routing, it requires finding some alternate ways such as discovery of a good neighbor and logical splitting of network perimeter that is advantageous in terms of route stability and good performance.

Conclusion

Clustering is a key technique for organizing a mobile ad-hoc network. Clustering helps to process routing efficiently and reduce complexity of the network