Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Genetic Algorithm Based Clustering and Routing Optimization in Mobile Ad Hoc Networks


Affiliations
1 Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, India
     

   Subscribe/Renew Journal


Ad hoc networks are wireless, infrastructure less, multi-hop and dynamic network, established by a collection of mobile nodes which provide envisioned features and applications to the modern communication technologies and services. In ad hoc networks clustering technique nodes are formed together and arranged in a group. Due to the dynamic topology of ad hoc network the cluster head (CH) election and route optimization are considering as the complicated processes [1] [2]. In this paper, we used the genetic algorithm (GA) for the CH election and route optimization in mobile ad hoc networks. For this optimization technique we have chosen some parameters such as degree difference, battery power, degree of mobility and sum of the distance of a node of mobile ad hoc networks[7][12]. Simulation results are conducted to evaluate theproposed approach average number of clusters in various environments and its route construction to find, the shortest and a very good path between the source to destination in ad hoc networks.


Keywords

Mobile Ad Hoc Networks, Clustering, GA, CBRP, WCA.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 206

PDF Views: 2




  • Genetic Algorithm Based Clustering and Routing Optimization in Mobile Ad Hoc Networks

Abstract Views: 206  |  PDF Views: 2

Authors

R. Pandi Selvam
Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, India
V. Palanisamy
Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, India

Abstract


Ad hoc networks are wireless, infrastructure less, multi-hop and dynamic network, established by a collection of mobile nodes which provide envisioned features and applications to the modern communication technologies and services. In ad hoc networks clustering technique nodes are formed together and arranged in a group. Due to the dynamic topology of ad hoc network the cluster head (CH) election and route optimization are considering as the complicated processes [1] [2]. In this paper, we used the genetic algorithm (GA) for the CH election and route optimization in mobile ad hoc networks. For this optimization technique we have chosen some parameters such as degree difference, battery power, degree of mobility and sum of the distance of a node of mobile ad hoc networks[7][12]. Simulation results are conducted to evaluate theproposed approach average number of clusters in various environments and its route construction to find, the shortest and a very good path between the source to destination in ad hoc networks.


Keywords


Mobile Ad Hoc Networks, Clustering, GA, CBRP, WCA.