2014 IEEE Global Conference on Wireless Computing &Amp; Networking (GCWCN) 2014
DOI: 10.1109/gcwcn.2014.7030885
|View full text |Cite
|
Sign up to set email alerts
|

Throughput aware ACO based routing protocol for wireless sensor network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…For the simulation environment, the operating system Windows 8 and the compiler software MATLAB 7.0.1 were used; the processor was an AMD A4-3300M APU (AMD, Cicero, IL, USA) equipped with a Radeon™ 1.90 GHz HD graphics card (Intel, Amsterdam, NY, USA) and 4 GB of memory. To more intuitively illustrate the improvement in security performance achieved by the algorithm proposed in this paper, we compared it with implementations of routing using an Ant-Colony Optimization Router Chip (ACORC) [32], QOS-Particle Swarm Optimization (QOS-PSO) [33], and the Throughput-Aware Novel ACO-Based Routing Protocol (TANARP) [34]. These three routing algorithms were also applied in the simulations, and their results were compared with those of the algorithm proposed in this paper.…”
Section: Simulation Experiments and Analysismentioning
confidence: 99%
“…For the simulation environment, the operating system Windows 8 and the compiler software MATLAB 7.0.1 were used; the processor was an AMD A4-3300M APU (AMD, Cicero, IL, USA) equipped with a Radeon™ 1.90 GHz HD graphics card (Intel, Amsterdam, NY, USA) and 4 GB of memory. To more intuitively illustrate the improvement in security performance achieved by the algorithm proposed in this paper, we compared it with implementations of routing using an Ant-Colony Optimization Router Chip (ACORC) [32], QOS-Particle Swarm Optimization (QOS-PSO) [33], and the Throughput-Aware Novel ACO-Based Routing Protocol (TANARP) [34]. These three routing algorithms were also applied in the simulations, and their results were compared with those of the algorithm proposed in this paper.…”
Section: Simulation Experiments and Analysismentioning
confidence: 99%
“…In [14], a TA-NARP algorithm is proposed which is the improvement in novel routing protocol NARP in light of ACO for expanding throughput. By executing PA-SHORT calculation with NARP, the upgrade is done where PA-SHORT finds the most diminutive cut route with the best-discovered paths that decreases the number of hops.…”
Section: Introductionmentioning
confidence: 99%