Linear discriminant analysis-based service discovery algorithm in MANET
by M. Buvana; M. Suganthi; K. Muthumayil
International Journal of Internet Protocol Technology (IJIPT), Vol. 9, No. 2/3, 2016

Abstract: With the increase in the number of available services, the use of the service has been increased rapidly and finding the exact services also the challenging task in large-scale mobile ad hoc network. We propose a method named as SD-LDA (linear discriminant analysis-based service discovery) algorithm to find the web services. Our method exploits the clustering structure, where the cluster head node (CHN) is selected to form a distributed directory. This CHN handles the discovery agent in which LDA is used for service discovery by reducing the dimension of service data and ignores the inequality of local data points of the similar class using matrix representation and calculating the overall score of QoS for each service, then ranks the services based on their overall QoS and selects services with highest QoS values. Finally, the performance of our algorithm is evaluated by experiments. The results show that the clustering method has low communication overhead and success of service discovery is increased. In addition, we show that less energy consumption during service discovery, minimise the discovery overhead, and rank identification.

Online publication date: Fri, 30-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email