User Settings
Open AccessArticle10.14236/ewic/vecos2008.9

Adaptive Clustering Based on Auto – Learning Algorithm

Anis Ben Arbia,Habib Youssef-2008-01-01-Electronic workshops in computing

TL;DRAbstract

This paper introduces an adaptive clustering model for wireless ad hoc networks based on Auto – Learning Algorithm (ALA). ALA allows a dynamic decomposition of the network into a virtual clusters view based on communication patterns of the mobile nodes. We consider a cluster as an Interest Group (IG) whose member nodes have common interactions. ALA is based on two types of events, New Route Events (NRE) and Route Failure Events (RFE). In this work, ALA is integrated into the well known routing protocol AODV. The adaptive version of AODV is referred to as A 2 ODV (Adaptive AODV). Simulation results show that A 2 ODV outperforms AODV with respect to packet delivery ratio, overhead, throughput, and route stability.

Chat with Paper

AI Agents for this Paper

This paper introduces an adaptive clustering model for wireless ad hoc networks based on Auto – Learning Algorithm (ALA). ALA allows a dynamic decomposition of the network into a virtual clusters view based on communication patterns of the mobile nodes. We consider a cluster as an Interest Group (IG) whose member nodes have common interactions. ALA is based on two types of events, New Route Events (NRE) and Route Failure Events (RFE). In this work, ALA is integrated into the well known routing protocol AODV. The adaptive version of AODV is referred to as A 2 ODV (Adaptive AODV). Simulation results show that A 2 ODV outperforms AODV with respect to packet delivery ratio, overhead, throughput, and route stability.

Keywords

Computer scienceAd hoc On-Demand Distance Vector RoutingCluster analysisOverhead (engineering)Mobile ad hoc networkThroughputComputer networkNetwork packet

Chat

Click to start Chat