ADAPTIVE SERVICE PROVISIONING FOR MOBILE AD HOC NETWORKS

Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET) is a big research challenge. In adaptive service provisioning mechanism an adaptive election procedure is used to select a coordinator node. The role of a service coordinator is crucial in any distributed directory based service provisioning scheme. The existing coordinator election schemes use either the nodeID or a hash function to choose the coordinator. In these schemes, the leader changes are more frequent due to node mobility. We propose an adaptive scheme that makes use of an eligibility factor that is calculated based on the distance to the zone center, remaining battery power and average speed to elect a core node that change according to the network dynamics. We also retain the node with the second highest priority as a backup node. Our algorithm is compared with the existing solution by simulation and the result shows that the core node selected by us is more stable and hence reduces the number of handoffs. This in turn improves the service delivery performance by increasing the packet delivery ratio and decreasing the delay, the overhead and the forwarding cost.