Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

QoS routing in cluster OLSR by using the artificial intelligence model MSSP in the big data environnment

IAES International Journal of Artificial Intelligence · Vol. 10 No. 2 (2021) · pp. 458–466

DOI
10.11591/ijai.v10.i2.pp458-466
ISSN
2252-8938, 2089-4872
Published
2021-06-01
Publisher
Institute of Advanced Engineering and Science
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The most complex problems, in data science and more specifically in artificial intelligence, can be modeled as cases of the maximum stable set problem (MSSP). this article describes a new approach to solve the MSSP problem by proposing the continuous hopfield network (CHN) to build optimized link state protocol routing (OLSR) protocol cluster. our approach consists in proposing in two stages: the first acts at the level of the choice of the OLSR master cluster in order to quickly make a local minimum using the CHN, by modeling the MSSP problem. As for the second step, the objective is the improvement of the precision making a solution of efficient at the first rank of neighborhood as a linear constraint, and at the end, to find the resolution of the model using the CHN. We will show that this model determines a good solution of the MSSP problem. To test the theoretical results, we propose a comparison with a classic OLSR.

Keywords

Collaboration network of the authors

7 authors · 13 co-authorship links · 7 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Mohammed V University
  • Université Ibn-Tofail
  • Sidi Mohamed Ben Abdellah University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Mohamed El GhmarySidi Mohamed Ben Abdellah University2
Mohamed AmnaiUniversité Ibn-Tofail1
Sara MaftahUniversité Ibn-Tofail1
Hamid El BouabidiUniversité Ibn-Tofail1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, first harvested 8 Nov 2026, last seen 16 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">QoS routing in cluster OLSR by using the artificial intelligence model MSSP in the big data environnment</dc:title>
	<dc:creator>Oubaha, Jawad</dc:creator>
	<dc:creator>Lakki, Noureddine</dc:creator>
	<dc:creator>Ouacha, Ali</dc:creator>
	<dc:subject xml:lang="en-US">QoS routing in cluster OLSR by using the Artificial Intelligence model MSSP in the Big Data environnment</dc:subject>
	<dc:subject xml:lang="en-US">Big Data; MANET; MSSP; OLSR; Quality of Service; Routing</dc:subject>
	<dc:description xml:lang="en-US">The most complex problems, in data science and more specifically in artificial intelligence, can be modeled as cases of the maximum stable set problem (MSSP). this article describes a new approach to solve the MSSP problem by proposing the continuous hopfield network (CHN) to build optimized link state protocol routing (OLSR) protocol cluster. our approach consists in proposing in two stages: the first acts at the level of the choice of the OLSR master cluster in order to quickly make a local minimum using the CHN, by modeling the MSSP problem. As for the second step, the objective is the improvement of the precision making a solution of efficient at the first rank of neighborhood as a linear constraint, and at the end, to find the resolution of the model using the CHN. We will show that this model determines a good solution of the MSSP problem. To test the theoretical results, we propose a comparison with a classic OLSR.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2021-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/20345</dc:identifier>
	<dc:identifier>10.11591/ijai.v10.i2.pp458-466</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 10, No 2: June 2021; 458-466</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v10.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/20345/13128</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>