This paper introduces two meta-heuristic approaches utilizing Swarm Intelligence and ant colony optimization techniques. The strategy comprises applying smart routing technology to optimize a dynamic IoT network computed path. The issue of route selection to achieve the target and critical factors such as network energy, left energy in each gadget, run out IoT nodes count has been explored. After rigorous iterations extending up to 1000, the simulation has yielded results for two distinctive routing approaches. The ABED (ACO- Breadth first search- Euclidean- Dynamic) and the ADED (ACODijkstra algorithm -Euclidean- Dynamic) have simulated and compared their network efficiencies using MATLAB. At node 200, ABED exhibits a performance advantage over ADED of 1.6%. This efficiency differential between ABED and ADED expands to 2.9% at 300 nodes and further to 2.6% at 400 nodes. Furthermore, ABED showcases superior network stability in routing techniques compared to ADED. Specifically, ABED's routing technique achieves a more consistent network compared to ADED. In networks comprising 500 nodes, ABED surpasses ADED by 13.33% in the context of HND (Half Node Dead) and by 6.7% in the case of LND (Last Node Dead).
{"title":"Intelligent Routing Approaches Based on Ant Colony Optimization for\u0000Dynamic Internet of Things Network","authors":"Anukriti Sharma, Sharad Sharma, Dushyant Gupta, Neeru Kashyap, Raj Kumar, Sunil Kumar","doi":"10.2174/0123520965316826240705072158","DOIUrl":"https://doi.org/10.2174/0123520965316826240705072158","url":null,"abstract":"\u0000\u0000This paper introduces two meta-heuristic approaches utilizing Swarm\u0000Intelligence and ant colony optimization techniques. The strategy comprises applying smart routing technology to optimize a dynamic IoT network computed path.\u0000\u0000\u0000\u0000The issue of route selection to achieve the target and critical factors such as network energy, left energy in each gadget, run out IoT nodes count has been explored. After rigorous iterations extending up to 1000, the simulation has yielded results for two distinctive routing approaches. The ABED (ACO- Breadth first search- Euclidean- Dynamic) and the ADED (ACODijkstra algorithm -Euclidean- Dynamic) have simulated and compared their network efficiencies\u0000using MATLAB.\u0000\u0000\u0000\u0000At node 200, ABED exhibits a performance advantage over ADED of 1.6%. This efficiency differential between ABED and ADED expands to 2.9% at 300 nodes and further to 2.6%\u0000at 400 nodes. Furthermore, ABED showcases superior network stability in routing techniques\u0000compared to ADED. Specifically, ABED's routing technique achieves a more consistent network\u0000compared to ADED.\u0000\u0000\u0000\u0000In networks comprising 500 nodes, ABED surpasses ADED by 13.33% in the context of HND (Half Node Dead) and by 6.7% in the case of LND (Last Node Dead).\u0000","PeriodicalId":506996,"journal":{"name":"Recent Advances in Electrical & Electronic Engineering (Formerly Recent Patents on Electrical & Electronic Engineering)","volume":" 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141822872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}