Matimo: Metaheuristic approach towards implementation of membership models in opportunistic network

Today there is a great demand to provide ubiquitous connectivity, even in those regions and geographical terrains which were previously considered inaccessible. Delay tolerant network has emerged as a strong potential candidate to achieve this ardent task as they are usually characterized by long delays and intermittent connectivity. In this paper we try to determine the optimized routing in delay tolerant network (DTN), by taking the concept of anycast routing that can be used for many applications in DTNs, as they prove useful when nodes wish to send messages to at least one, and preferably only one, of the members in destination group. In this paper we analyse anycast routing algorithm for DTNs by deploying metaheuristic technique of genetic algorithms (GAs) with the help of five membership models. These membership models yields a specified rate of delivery of message to the desired destination node. The GA is applied to use the concept of subpopulation to produce the next generation of the population of nodes based on out-degree and in-degree property of nodes. We propose a new Genetic algorithm driven routing algorithm to meet the routing needs of the nodes in the group and then exhibit the results after carrying out extensive simulation in MATLAB using five membership models.