Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks

碩士 === 國立交通大學 === 電機資訊國際學程 === 103 === Nodes participating in mobile ad-hoc networks have the liberty to join, leave and move across it, inducing the constant change in the topology and presenting a challenge for the composition and maintenance of the communication via between nodes. Considering the...

Full description

Bibliographic Details
Main Authors: Sanchez Paredes, Emilio Javier, 桑正翰
Other Authors: Huang, Ching-Yao
Format: Others
Language:en_US
Published: 2014
Online Access:http://ndltd.ncl.edu.tw/handle/w8pgdw
id ndltd-TW-103NCTU5441004
record_format oai_dc
spelling ndltd-TW-103NCTU54410042019-05-15T21:50:56Z http://ndltd.ncl.edu.tw/handle/w8pgdw Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks 蟻群傳染目標的最佳化--一種移動Ad-hoc網路服務探索演算法 Sanchez Paredes, Emilio Javier 桑正翰 碩士 國立交通大學 電機資訊國際學程 103 Nodes participating in mobile ad-hoc networks have the liberty to join, leave and move across it, inducing the constant change in the topology and presenting a challenge for the composition and maintenance of the communication via between nodes. Considering the characteristics of different service discovery protocols proposed in the past years, the present work explores the development of a resource and service discovery protocol that makes use of the data type each node in the network handles, to create blocks related among them through an ontology. Concepts of ant colony optimization algorithms and infectious spread are applied to optimize the diffusion of message across the network, as well as to create the communication links between nodes starting search requests and nodes offering services in the network. The methods used in the thesis include the study of different works as well as the classification of the same according to its design features, the application of these solutions to fit the characteristics of MANET networks, the development of the proposed resource and service discovery protocol validating its functionalities and proper response to the events occurring due to the dynamic nature of the network and the selection of an appropriate network simulation tool to reproduce and test the expected outcomes of the proposed protocol showing the advantages and limitations of the same. The efficiency and satisfactory performance of the proposed resource and service discovery protocol is presented in the different graphical comparisons and described in the corresponding subsections of the same. A significant decrease of the number of transmitted messages during the dissemination phase of the proposed protocol is found as compared to the amount of messages used when no data type relation is created or classified through an ontology. The results obtained when testing for the miss hit effect in the network show the high level of reliability of the protocol, producing constant outcomes of the number of services discovered in the network when the ratio of invalid services populating the network increases. Other results include the invalid search effect on system overload induced by the protocol, amount of search messages and effect on compatibility match process time. The resource and service discovery protocol developed and fully implemented throughout the present thesis not only attains to the requirements and characteristics of MANET networks, but the results obtained through the simulations show the capability, functionality and advantages of its application in the development of more advanced processes such as automatic service composition making use of data type handled by different devices in a network. Huang, Ching-Yao 黃經堯 2014 學位論文 ; thesis 63 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立交通大學 === 電機資訊國際學程 === 103 === Nodes participating in mobile ad-hoc networks have the liberty to join, leave and move across it, inducing the constant change in the topology and presenting a challenge for the composition and maintenance of the communication via between nodes. Considering the characteristics of different service discovery protocols proposed in the past years, the present work explores the development of a resource and service discovery protocol that makes use of the data type each node in the network handles, to create blocks related among them through an ontology. Concepts of ant colony optimization algorithms and infectious spread are applied to optimize the diffusion of message across the network, as well as to create the communication links between nodes starting search requests and nodes offering services in the network. The methods used in the thesis include the study of different works as well as the classification of the same according to its design features, the application of these solutions to fit the characteristics of MANET networks, the development of the proposed resource and service discovery protocol validating its functionalities and proper response to the events occurring due to the dynamic nature of the network and the selection of an appropriate network simulation tool to reproduce and test the expected outcomes of the proposed protocol showing the advantages and limitations of the same. The efficiency and satisfactory performance of the proposed resource and service discovery protocol is presented in the different graphical comparisons and described in the corresponding subsections of the same. A significant decrease of the number of transmitted messages during the dissemination phase of the proposed protocol is found as compared to the amount of messages used when no data type relation is created or classified through an ontology. The results obtained when testing for the miss hit effect in the network show the high level of reliability of the protocol, producing constant outcomes of the number of services discovered in the network when the ratio of invalid services populating the network increases. Other results include the invalid search effect on system overload induced by the protocol, amount of search messages and effect on compatibility match process time. The resource and service discovery protocol developed and fully implemented throughout the present thesis not only attains to the requirements and characteristics of MANET networks, but the results obtained through the simulations show the capability, functionality and advantages of its application in the development of more advanced processes such as automatic service composition making use of data type handled by different devices in a network.
author2 Huang, Ching-Yao
author_facet Huang, Ching-Yao
Sanchez Paredes, Emilio Javier
桑正翰
author Sanchez Paredes, Emilio Javier
桑正翰
spellingShingle Sanchez Paredes, Emilio Javier
桑正翰
Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks
author_sort Sanchez Paredes, Emilio Javier
title Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks
title_short Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks
title_full Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks
title_fullStr Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks
title_full_unstemmed Ant Colony Infectious Target Optimization (ACITO) – A service discovery algorithm for mobile ad-hoc networks
title_sort ant colony infectious target optimization (acito) – a service discovery algorithm for mobile ad-hoc networks
publishDate 2014
url http://ndltd.ncl.edu.tw/handle/w8pgdw
work_keys_str_mv AT sanchezparedesemiliojavier antcolonyinfectioustargetoptimizationacitoaservicediscoveryalgorithmformobileadhocnetworks
AT sāngzhènghàn antcolonyinfectioustargetoptimizationacitoaservicediscoveryalgorithmformobileadhocnetworks
AT sanchezparedesemiliojavier yǐqúnchuánrǎnmùbiāodezuìjiāhuàyīzhǒngyídòngadhocwǎnglùfúwùtànsuǒyǎnsuànfǎ
AT sāngzhènghàn yǐqúnchuánrǎnmùbiāodezuìjiāhuàyīzhǒngyídòngadhocwǎnglùfúwùtànsuǒyǎnsuànfǎ
_version_ 1719120291544694784