ptimization Algorithm for Multi-o ring in Mobile Ad Hoc Networks

摘要: Abstract —Due to the proliferation of smaand developments in wireless communica tnetworks (MANETs) are gaining more and recent years. Routing MANETs is a chawhen network contains large numbeclustering technique popular method oin MANETs. It divides into sevassigns cluster head each for intracommunication. Clustering NP-hard multiple objectives. In this paper we propose acolony optimization (ACO) algorithm tomultiobjective problem. A new eproposed reduce size search space, anscheme proposed generate high-effectively. Experimental results show that better than several benchmark approaches. I. I NTRODUCTION With rise fourth generation (4Gstandards growing usage mdevices such as Personal Digital Assistants phones, have become MANET self-self-configuring multi-hop ncomprises set mobile hosts cfreely cooperate pass data between efixed infrastructures. has advantagplug-and-play convenience, flexibiliwireless communication places where fixare hard be up, examplein battle fields, mountain areas, temporary conferencemobile devices. An often constructed by hundevices real world, it encounteproblem traditional flat form [1]. tnode needs record information (node all other nodes network, h athe when number leads hierarchical form. Nodonly need keep chelps deal with scalability