2008 International Conference on Security Technology 2008
DOI: 10.1109/sectech.2008.49
|View full text |Cite
|
Sign up to set email alerts
|

An Ant Colony Based Protocol to Support Multimedia Communication in Ad Hoc Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…An ant-like mobile agentbased algorithm that provides undisturbed data communication between the nodes was proposed in [5] and [9]. An ACO based routing algorithm that supports multimedia communication in MANETs was discussed in [10]. This algorithm exploits antlike mobile agents to establish a stable path between the nodes.…”
Section: Related Workmentioning
confidence: 99%
“…An ant-like mobile agentbased algorithm that provides undisturbed data communication between the nodes was proposed in [5] and [9]. An ACO based routing algorithm that supports multimedia communication in MANETs was discussed in [10]. This algorithm exploits antlike mobile agents to establish a stable path between the nodes.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, the routes and hop counts determined by the routing algorithms have very critical role on throughput which has to be investigated. For this purpose, we have developed the routing simulation programs in MATLAB, implementing the Fastest Path routing [17], ANT-Colony routing [18], Associativity based routing (ABR), Alternative Enhanced Associativity based routing (AEABR) [19] and Associatively Tick Averaged Associativity based routing [20] algorithms. At first, effects of Fastest Path and ANT-Colony routing algorithms were taken into comparison for the range of different N values.…”
Section: Effects Of Routing Algorithms On System Throughputmentioning
confidence: 99%
“…They have an advantage over the other approaches (like SA and GA) when the graph may change dynamically; the ant colony algorithm can be run continuously and adapt to changes in real time. This is of interest in network routing and urban transportation systems (Dorigo and Stützle, 2004;Venayagamoorthy and Harley, 2007;Sivajothi and Naganathan, 2008;Dorigo, 2007).…”
Section: Ant Colony Optimisation (Aco)mentioning
confidence: 99%