Routing algorithm based on ant colony optimization for mobile social network
The wireless Ad-hoc network comprise of numerous wireless nodes communicating with each other without the need for a any single centralized administration, in such a scenario all the nodes potentially contribute to the routing process. A node can move anytime in an ad hoc scenario, as a result, such a network poses routing protocols which can adopt to dynamically changing network topology. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented. As routing is a critical issue in MANET, we propose a new routing approach, a Cluster based approach coined as RIMCA for efficient routing of message from the source to destination. In RIMCA, a mobile adhoc network (MANET) consists of mobile wireless nodes which moves randomly within boundary of cluster. The communications between these mobile nodes are carried out without any centralized control per cluster but the communications between nodes in different clusters is carried out by using border cluster node (BCN) located at the border of cluster. To effectively depict the efficiency of our RIMCA approach we took two popular MANET protocols AODV and DSR. The simulation tool used was Network Simulator (NS2). The performance of these routing protocols was analyzed by four metrics: Protocols Energy, routing discover, End-to-End delay, package-size VS Delivery -Ratio, package-size _Vs_Throughput.