Comparative Study on Ant Colony Optimization (ACO) and K-Means Clustering Approaches for Jobs Scheduling and Energy Optimization Model in Internet of Things (IoT)

The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view and purpose. When transmitting data in IoT envi...

Full description

Saved in:
Bibliographic Details
Published in:International journal of interactive multimedia and artificial intelligence Vol. 6; no. 1; pp. 107 - 116
Main Authors: Kumar, Sumit, Kumar-Solanki, Vijender, Choudhary, Saket Kumar, Selamat, Ali, Gonzalez-Crespo, Rubén
Format: Journal Article
Language:English
Published: Universidad Internacional de La Rioja (UNIR) 2020
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view and purpose. When transmitting data in IoT environment, distribution of network traffic fluctuates frequently. If links of the network or nodes fail randomly, then automatically new nodes get added frequently. Heavy network traffic affects the response time of all system and it consumes more energy continuously. Minimization the network traffic/ by finding the shortest path from source to destination minimizes the response time of all system and also reduces the energy consumption cost. The ant colony optimization (ACO) and K-Means clustering algorithms characteristics conform to the auto-activator and optimistic response mechanism of the shortest route searching from source to destination. In this article, ACO and K-Means clustering algorithms are studied to search the shortest route path from source to destination by optimizing the Quality of Service (QoS) constraints. Resources are assumed in the active and varied IoT network atmosphere for these two algorithms. This work includes the study and comparison between ant colony optimization (ACO) and K-Means algorithms to plan a response time aware scheduling model for IoT. It is proposed to divide the IoT environment into various areas and a various number of clusters depending on the types of networks. It is noticed that this model is more efficient for the suggested routing algorithm in terms of response time, point-to-point delay, throughput and overhead of control bits.
AbstractList The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view and purpose. When transmitting data in IoT environment, distribution of network traffic fluctuates frequently. If links of the network or nodes fail randomly, then automatically new nodes get added frequently. Heavy network traffic affects the response time of all system and it consumes more energy continuously. Minimization the network traffic/ by finding the shortest path from source to destination minimizes the response time of all system and also reduces the energy consumption cost. The ant colony optimization (ACO) and K-Means clustering algorithms characteristics conform to the auto-activator and optimistic response mechanism of the shortest route searching from source to destination. In this article, ACO and K-Means clustering algorithms are studied to search the shortest route path from source to destination by optimizing the Quality of Service (QoS) constraints. Resources are assumed in the active and varied IoT network atmosphere for these two algorithms. This work includes the study and comparison between ant colony optimization (ACO) and K-Means algorithms to plan a response time aware scheduling model for IoT. It is proposed to divide the IoT environment into various areas and a various number of clusters depending on the types of networks. It is noticed that this model is more efficient for the suggested routing algorithm in terms of response time, point-to-point delay, throughput and overhead of control bits.
Author Gonzalez-Crespo, Rubén
Choudhary, Saket Kumar
Selamat, Ali
Kumar, Sumit
Kumar-Solanki, Vijender
Author_xml – sequence: 1
  givenname: Sumit
  surname: Kumar
  fullname: Kumar, Sumit
– sequence: 2
  givenname: Vijender
  surname: Kumar-Solanki
  fullname: Kumar-Solanki, Vijender
– sequence: 3
  givenname: Saket Kumar
  surname: Choudhary
  fullname: Choudhary, Saket Kumar
– sequence: 4
  givenname: Ali
  surname: Selamat
  fullname: Selamat, Ali
– sequence: 5
  givenname: Rubén
  surname: Gonzalez-Crespo
  fullname: Gonzalez-Crespo, Rubén
BookMark eNpdkdFq2zAUhsXoYF3XF9iVLtsLpzqWY8uwG2O6NVtLoE2vxbF9nCo4kpGcQfY4e9IpSxhrdSOdI30fHP0f2Zl1lhj7DGJWFgpuzMZs0cxSkYqZgJkQ8h07h1KVCeS5OPvv_IFdhrARcUnI5imcs9-1247ocTI_iT9Nu27PneWVnXjtBmf3fDlOZmt-xQexf1XVy2uOtuM_kgdCG3g97MJE3tg1r8bRO2xfKPDeef7dNYE_xbLbDYfrA3Vrya_fOB9cRwM3li9sFFmauOv56iUigV8t3Or6E3vf4xDo8rRfsOevt6v6LrlfflvU1X3SZiCmJM6oBJRZixLLoiNZqiYtlcwayAWkSEXTN32Wp20hOyqKRmLftcVcUqOkpF5esMXR2znc6NHHT_V77dDovw3n1xr9ZNqBdA5EhC3kIDBLAVTkhZKoOiJFRRtdX04ug0Oc6bXu1NtZ443boKagq8dVTCUK5RyKiKdHvPUuBE_9Px6EPmSuj5nrQ-ZagI6Byj8rzaSn
CitedBy_id crossref_primary_10_1007_s11277_021_08764_x
crossref_primary_10_1515_jisys_2022_0066
crossref_primary_10_3233_JIFS_189669
crossref_primary_10_36548_jtcsst_2020_3_001
crossref_primary_10_1002_cpe_7244
crossref_primary_10_1186_s13634_021_00748_0
crossref_primary_10_1007_s12652_021_03278_7
crossref_primary_10_1016_j_aei_2023_101969
crossref_primary_10_1080_23311916_2024_2316458
crossref_primary_10_1142_S0219265921410267
crossref_primary_10_3390_math11102339
crossref_primary_10_1007_s10845_020_01610_0
crossref_primary_10_1111_exsy_13090
crossref_primary_10_1016_j_iot_2023_100710
crossref_primary_10_1016_j_comcom_2020_04_042
crossref_primary_10_1007_s10586_020_03122_1
crossref_primary_10_1007_s10479_022_04607_5
crossref_primary_10_1007_s10489_021_02190_z
crossref_primary_10_1007_s12145_020_00538_6
crossref_primary_10_1007_s00500_020_05247_2
crossref_primary_10_1111_exsy_12994
crossref_primary_10_1007_s12145_020_00478_1
crossref_primary_10_1109_JIOT_2021_3074499
crossref_primary_10_3390_en14061709
crossref_primary_10_1155_2022_9432413
crossref_primary_10_1007_s12145_021_00584_8
crossref_primary_10_3390_app12105015
crossref_primary_10_3233_JIFS_189374
crossref_primary_10_37708_el_swu_v5i1_7
crossref_primary_10_3233_JIFS_189672
crossref_primary_10_1007_s00500_021_05614_7
crossref_primary_10_1145_3406205
crossref_primary_10_1080_23307706_2022_2105267
crossref_primary_10_3390_app112210807
crossref_primary_10_1108_EL_07_2020_0206
ContentType Journal Article
Copyright LICENCIA DE USO: Los documentos a texto completo incluidos en Dialnet son de acceso libre y propiedad de sus autores y/o editores. Por tanto, cualquier acto de reproducción, distribución, comunicación pública y/o transformación total o parcial requiere el consentimiento expreso y escrito de aquéllos. Cualquier enlace al texto completo de estos documentos deberá hacerse a través de la URL oficial de éstos en Dialnet. Más información: https://dialnet.unirioja.es/info/derechosOAI | INTELLECTUAL PROPERTY RIGHTS STATEMENT: Full text documents hosted by Dialnet are protected by copyright and/or related rights. This digital object is accessible without charge, but its use is subject to the licensing conditions set by its authors or editors. Unless expressly stated otherwise in the licensing conditions, you are free to linking, browsing, printing and making a copy for your own personal purposes. All other acts of reproduction and communication to the public are subject to the licensing conditions expressed by editors and authors and require consent from them. Any link to this document should be made using its official URL in Dialnet. More info: https://dialnet.unirioja.es/info/derechosOAI
Copyright_xml – notice: LICENCIA DE USO: Los documentos a texto completo incluidos en Dialnet son de acceso libre y propiedad de sus autores y/o editores. Por tanto, cualquier acto de reproducción, distribución, comunicación pública y/o transformación total o parcial requiere el consentimiento expreso y escrito de aquéllos. Cualquier enlace al texto completo de estos documentos deberá hacerse a través de la URL oficial de éstos en Dialnet. Más información: https://dialnet.unirioja.es/info/derechosOAI | INTELLECTUAL PROPERTY RIGHTS STATEMENT: Full text documents hosted by Dialnet are protected by copyright and/or related rights. This digital object is accessible without charge, but its use is subject to the licensing conditions set by its authors or editors. Unless expressly stated otherwise in the licensing conditions, you are free to linking, browsing, printing and making a copy for your own personal purposes. All other acts of reproduction and communication to the public are subject to the licensing conditions expressed by editors and authors and require consent from them. Any link to this document should be made using its official URL in Dialnet. More info: https://dialnet.unirioja.es/info/derechosOAI
DBID AAYXX
CITATION
AGMXS
FKZ
DOA
DOI 10.9781/ijimai.2020.01.003
DatabaseName CrossRef
Dialnet (Open Access Full Text)
Dialnet
Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList

Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: http://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1989-1660
EndPage 116
ExternalDocumentID oai_doaj_org_article_61eeeac1610a421183ef083a8dee8e7c
oai_dialnet_unirioja_es_ART0001613517
10_9781_ijimai_2020_01_003
GroupedDBID .4S
.DC
29J
2WC
5GY
5VS
AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
C1A
CITATION
E3Z
GROUPED_DOAJ
IAO
ICD
IPNFZ
ITC
KQ8
MK~
M~E
OK1
RIG
TR2
TUS
AGMXS
FKZ
ID FETCH-LOGICAL-c410t-98980194ca3a97de398b29834b16012ae7bfbf462c73de77b3afdc753eb833ef3
IEDL.DBID DOA
ISSN 1989-1660
IngestDate Tue Oct 22 15:00:53 EDT 2024
Sat Apr 20 03:26:32 EDT 2024
Fri Aug 23 03:19:10 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c410t-98980194ca3a97de398b29834b16012ae7bfbf462c73de77b3afdc753eb833ef3
OpenAccessLink https://doaj.org/article/61eeeac1610a421183ef083a8dee8e7c
PageCount 10
ParticipantIDs doaj_primary_oai_doaj_org_article_61eeeac1610a421183ef083a8dee8e7c
dialnet_primary_oai_dialnet_unirioja_es_ART0001613517
crossref_primary_10_9781_ijimai_2020_01_003
PublicationCentury 2000
PublicationDate 2020-00-00
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – year: 2020
  text: 2020-00-00
PublicationDecade 2020
PublicationTitle International journal of interactive multimedia and artificial intelligence
PublicationYear 2020
Publisher Universidad Internacional de La Rioja (UNIR)
Publisher_xml – name: Universidad Internacional de La Rioja (UNIR)
SSID ssj0000314521
Score 2.437554
Snippet The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an...
SourceID doaj
dialnet
crossref
SourceType Open Website
Aggregation Database
StartPage 107
SubjectTerms Ant Colony Optimization
Energy
Internet of things
Job Scheduling
k-means
means
Title Comparative Study on Ant Colony Optimization (ACO) and K-Means Clustering Approaches for Jobs Scheduling and Energy Optimization Model in Internet of Things (IoT)
URI https://dialnet.unirioja.es/servlet/oaiart?codigo=9031034
https://doaj.org/article/61eeeac1610a421183ef083a8dee8e7c
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELagEhIX3ojlpTlwaIWiOrGTOMclbFVA0ANF4mbZyUSkah3UzR76d_pLOxNnC3viwtWKncQzmZnPmflGiHfeKZ8j_1YnESTamSpxsmuS3FA0QS5CmooLhY-_l99-mo8rpsm5bfXFOWGRHjhu3GGRIpJxoMBEOk1oxSjsKGxwpkU0WDaT9ZXFX2BqssEq1XksuuKcoLQoZKyYYYqnw_6sv3A9gcNMTpyd245Zs1e6xyUbAccdGv_J3xw9Eg_mQBGW8QEfizsYnoiH2yYMMH-TT8V1_Ye_Gzgr8AqGAMswQk12LVzBCRmFi7naEvaX9ckBuNDCl-QrkpuC-nzDXAnkwWA584vjGiiUhc-DX9N9fpEz4pr1adZqKhXcXZPbqZ1DHyCeLuIIQwexHyjsfxpOD56JH0er0_o4mRsvJI1O5ZhwT0kK_XTjlKvKFlVlfFYZpX1K-C1zWPrOd7rImlK1WJZeua5tCPigN4rko56LvTAEfCHAtFmKuVQVKqcNwSOdNr7SuW7yjtHnQrzfbrz9Hfk1LOESFpONYrIsJitTZjFdiHyWze3FTI-9HduE_rIfzpzFtSU4EONZlaflQnxgSe5O4gHSNDtrmv2Xpr38H4u8Evf5feIhzmuxN15u8I24u243bycNvgEPZ_Uj
link.rule.ids 315,782,786,866,2106,4028,27932,27933,27934
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Comparative+Study+on+Ant+Colony+Optimization+%28ACO%29+and+K-Means+Clustering+Approaches+for+Jobs+Scheduling+and+Energy+Optimization+Model+in+Internet+of+Things+%28IoT%29&rft.jtitle=International+journal+of+interactive+multimedia+and+artificial+intelligence&rft.au=Kumar+Choudhary%2C+Saket&rft.au=Gonz%C3%A1lez+Crespo%2C+Rub%C3%A9n&rft.au=Kumar%2C+Sumit&rft.au=Salamat%2C+Alireza&rft.date=2020&rft.issn=1989-1660&rft.eissn=1989-1660&rft.volume=6&rft.issue=1&rft.spage=107&rft.epage=116&rft_id=info:doi/10.9781%2Fijimai.2020.01.003&rft.externalDocID=oai_dialnet_unirioja_es_ART0001613517
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1989-1660&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1989-1660&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1989-1660&client=summon