Service Discovery In Mobile Ad Hoc Networks Research Articles

Performance evaluation and comparison study of adaptive MANET service location and discovery protocols for highly dynamic environments

A critical requirement in Mobile Ad Hoc Networks (MANETs) is its ability to automatically discover existing services as well as their locations. Several solutions have been proposed in various communication domains which could be classified into two categories: (1) directory based, and (2) directory-less. The former is efficient but suffers from the amount of control messages being exchanged to maintain all directories in an agile environment. However, the latter approach attempts to reduce the amount of control messages to update directories, by simply sending broadcast messages to discover services; which is also a non-desirable approach in MANETs. This research work builds on top of our prior work (Nazeeruddin et al. in IFIP/IEEE international conference on management of multimedia networks and services, Springer, Berlin, 2006)) where we introduced a new efficient protocol for service discovery in MANETs (MSLD); a lightweight, robust, scalable, and flexible protocol which supports node heterogeneity and dynamically adapts to network changes while not flooding the network with extra protocol messages—a major challenge in today’s network environments, such as Internet of Things (IoT). Extensive simulations study was conducted on MSLD to: (1) initially evaluate its performance in terms of latency, service availability, and overhead messages, then (2) compare its performance to Dir-Based, Dir-less, and PDP protocols under various network conditions. For most performance metrics, simulation results show that MSLD outperforms Dir-Based, Dir-less, and PDP by either matching or achieving high service availability, low service discovery latency, and considerably less communication overhead.

Approach of Association Rules Mining for Service Discovery in Mobile Adhoc Network

The Service Discovery in Mobile Ad hoc Networks (MANET) is a difficult task because of the changing nature of such networks. Different services are available in MANET considering time and location. Many varying traditional solutions to service discovery of Internet are not well suited for MANET because of their Ad hoc nature. Consequently, Service Discovery (SD) in the network a perquisite for efficient usage of network resources is a complex problem. In this work Association Rules mining algorithm are used to get service discovery. Using the correlation among the services and piggybacking future service request answers along with current service requests, there is significant gain in performance. Two algorithms of association rules mining are used for discovering the services in MANET. FPTree algorithm is already been used for service discovery. We have approached towards Apriori algorithm for service discovery in MANET with the significant gain in performance.

Design and Implementation of an Anycast Services Discovery in Mobile Ad Hoc Networks

Anycasting is a network service that selects the best one of service providers in an anycast group as a destination. While anycasting offers better service flexibility in mobile ad hoc networks (MANETs), it also incurs new problems. In MANETs, every node can move arbitrarily, and the routes from mobile nodes to their service providers would vary. Therefore, anycast service discovery in MANETs usually relies on network-layer message broadcasting, which leads to large traffic overhead for the scarce bandwidth of MANETs. In this work, we present a traffic-control scheme for anycast service discovery in MANETs. Our scheme can reduce the volume of query messages and the reply messages. In addition to basic anycasting, our scheme also supports k-anycast service that requests for k anycast service providers in each service instance. With k-anycast service, the fault tolerance and service flexibility of our scheme can be improved. Experimental results demonstrate that our scheme is efficient and feasible for MANETs.

K-directory community: Reliable service discovery in MANET

Ensuring service availability is a key fault tolerance issue in service discovery for mobile ad hoc networks (MANET). Availability can be affected by sudden failure of service providers or directory nodes or even by network disconnection due to node mobility. So, to ensure network-wide service availability, services must be replicated cautiously, so that, the storage, update and discovery costs can be minimized. Achieving service availability in a resource efficient manner is both desirable and challenging in MANET. Existing works have not addressed these issues adequately. In this paper, we propose a distributed directory-based service discovery protocol (SDP) for MANET which works by electing the top K directory nodes considering rich resources. Resource-based election ensures high reliability for the directory nodes. The community of directory nodes then divides itself into multiple quorums. Services registered with a directory are replicated among its quorum members. This approach, while controlling replication and update costs, can guarantee network-wide service availability by the quorum intersection property. To further reduce the service discovery cost, we divide the entire network into one or more tree-structured domains. Since, the K -directory community is the heart of our approach, to keep the directory community intact, we consider substituting failed directories using an incremental election policy. Our protocol can also cope with dynamic and frequent topological changes caused by network partitioning as well as partition merges. To evaluate the performance of our proposed protocol, we have conducted extensive simulations and developed a prototype system. The results show that, compared with similar works, our protocol significantly reduces message cost and discovery delay, while improving system robustness.