Long Thanh Nguyen, Thuy Duc Nguyen, Hoang Huy Pham


Service discovery is important network function that has just developed inherited from auto detected device function of Windows OS. Though the application of this technique in service based routing is not trivial. Moreover, nowadays computer technology has evolved, computer networks have grown to a new stage. This network is called the upper layer network; the network nodes are interconnected on the basis of connection according to the service. This paper focuses on designing an application of service discovery on the basis of demand analysis, object-oriented service oriented routing. With the evolving variety of Web services today, it is essential to take advantages of these services to perform new complex tasks. Based on the researches of some of the world's researchers by the well-known articles [2], the author of this paper proposes a technique that uses graph theory combined with ACO optimization algorithm, to create the optimal route to support the service discovery problem. Based on the study of optimal algorithms, the thesis inherited this research, simulating this research by optimizing the optimization of the service on the basis of membership services, adding the optimal algorithm Gen to create optimal routes and avoid optimizing locally.

Full Text:



Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, “Building Multiple Multicast Trees with Guarranteed QOS for Service Based Routing Using Artificial Algorithms”. Springer, ISBN: 978-3-319-29235-9, ICCASA 2015, LNICST 165, pp. 354–369, 2016.

Sami Zhioua (2013): “Tor traffic analysis using Hidden Markov Models”, Security Comm. Networks 2013; 6:1075–1086.

B.G.Obulla Reddy, Maligela Ussenaiah, Rayalaseema (2012): “An Adaptive Fuzzy Clustering and Location Management inMobile Ad Hoc Networks”. International Journal of Computer Applications & Information Technology Vol. I, Issue III (ISSN: 2278-7720).

R. Nagwani, D. S. Tomar (2012): “Mobility Prediction based Routing in Mobile Adhoc Network using Hidden Markov Model”. International Journal of Computer Applications (0975 – 8887), Vol. 59– No.1.

Seok K. Hwang, Dongsoo S. Kim (2007): “Markov model of link connectivity in mobile ad hoc networks”. Telecommun Syst (2007) 34:51–58.

Amardeep Sathyanarayana, Pınar Boyraz, John H.L. Hansen (2008): “Driver Behavior Analysis and Route Recognition by Hidden Markov Models”. Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety, Columbus, OH, USA.

R.Sharma, D. K. Lobiyal (2015): “Proficiency Analysis of AODV, DSR and TORA Ad-hoc Routing Protocols for Energy Holes Problem in Wireless Sensor Networks”. 3rd Inter. Conference on Recent Trends in Computing.

Jaspreet Kaur, Dinesh Kumar, Giani Zial Singh (2017): “Distributed Hash Table based Routing for P2P Data sharing in MANETs”, e-ISSN: 2454-6615, WWJMRD 2017; 3(7): 82-85.

Franc¸oise Sailhan, Val´ erie Issarny (2009): “Scalable Service Discovery for MANET”. HAL Id: inria-00414946.

Gianni Di Caro (2004): “Ant Colony Optimization and its Application to Adaptive Routing in Telecommunication Networks”. PROMOTEUR: PROF. MARCO DORIGO, ANNEE ACAD´ EMIQUE´ 2003-2004.


Indexed by: Google Scholar.

Lớp dạy vẽ ở Mỹ Đình