Mendeley出力
＜学術雑誌論文＞
Ant Colony Optimization Based Routing Strategies for Internet of Things
| 作成者 | |
|---|---|
| 本文言語 | |
| 出版者 | |
| 発行日 | |
| 収録物名 | |
| 巻 | |
| 号 | |
| 開始ページ | |
| 終了ページ | |
| 出版タイプ | |
| アクセス権 | |
| Crossref DOI | |
| 権利関係 | |
| 概要 | In this paper, two meta-heuristic approaches have been optimized using SI (Swarm Intelligence) optimization technique. The method comprises computation of shortest path of both, static and dynamic IoT... (Internet of Things) network using “widely used algorithms” among researchers, namely, ‘Breadth first search’ and ‘Dijkstra algorithm.’ Further, the determined route has been optimized using ant colony optimization. The issue of route selection to reach the destination, as well as parameters such as network energy, departed node count, residual energy of IoT nodes, and critical points of IoT nodes have been explored using proposed smart routing techniques. The two unique routing approaches have been simulated with rigorous iteration run, i=2000. The proposed methods, ‘Ant colony optimization- Breadth first computation-Minkowski- Static’ (ABMS) technique and ‘Ant colony optimization-Breadth first computation-Minkowski- Dynamic’ (ABMD) technique have been simulated. After comparing efficiency between both techniques, ABMS method outperforms the ABMDrouting technique for IoT network. Asignificant energy savings has been reported, extending network lifetime of a static IoT network scenario. With the implementation of both techniques, the comparison between dynamic and static results closely.続きを見る |
| 目次 | 1.Introduction 2.Literature Studies 3.Methodology 4.System Model 5.Results and Discussion 6.Conclusions |
詳細
| PISSN | |
|---|---|
| EISSN | |
| レコードID | |
| 査読有無 | |
| 主題 | |
| 登録日 | 2023.07.10 |
| 更新日 | 2024.02.21 |