2005 International Conference on Wireless Networks, Communications and Mobile Computing
DOI: 10.1109/wirles.2005.1549628
|View full text |Cite
|
Sign up to set email alerts
|

Using multi-objective domain optimization for routing in hierarchical networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 18 publications
0
9
0
Order By: Relevance
“…They encompass methods such as Probabilistic Roadmaps (PR); Rapidly-exploring Random Trees (RRT); Ant Colony Optimization (ACO), that relies on the foraging behavior of ants for finding the shortest path to the food source ( [32], [33], [34]); Simulated Annealing (SA), which is a heuristic random search approach that resembles the cooling process of molten metals through annealing ( [35], [36]); Neural Network [37]; Genetic Algorithms (GA), which are based on the mechanics of natural genetics and selection ( [38], [39], [40]); Particle Swarm Optimization (PSO), which are inspired by social behavior of bird flocking or fish schooling and are easier to implement than GA and with a fewer parameters to be adjusted ( [41], [42], [43], [44], [45], [46]); Stigmergy, which is a mechanism of indirect and Tabu Search, which is a local-search method used for mathematical optimization [36].…”
Section: Heuristic Approachesmentioning
confidence: 99%
“…They encompass methods such as Probabilistic Roadmaps (PR); Rapidly-exploring Random Trees (RRT); Ant Colony Optimization (ACO), that relies on the foraging behavior of ants for finding the shortest path to the food source ( [32], [33], [34]); Simulated Annealing (SA), which is a heuristic random search approach that resembles the cooling process of molten metals through annealing ( [35], [36]); Neural Network [37]; Genetic Algorithms (GA), which are based on the mechanics of natural genetics and selection ( [38], [39], [40]); Particle Swarm Optimization (PSO), which are inspired by social behavior of bird flocking or fish schooling and are easier to implement than GA and with a fewer parameters to be adjusted ( [41], [42], [43], [44], [45], [46]); Stigmergy, which is a mechanism of indirect and Tabu Search, which is a local-search method used for mathematical optimization [36].…”
Section: Heuristic Approachesmentioning
confidence: 99%
“…Even though we are not limited by SA's functionality, in this paper, without loss of generality, we focus on the improvement of routing overhead. In [9] we have concentrated on improving the routing overhead but when 2-layer hierarchy is applied. The solution to that problem was to balance out the size (e.g.…”
Section: Objective Function and Constraintsmentioning
confidence: 99%
“…Such a hierarchical design has the potential to result in lower routing overhead, which translates to lower control signaling and larger network capacity available for data. By applying (9) we are designing all the layers simultaneously. The representation involves the description of a layer-I domain as a set of network nodes and the description of a layer-/(>1) domain as a set of layer-(/-1) domains.…”
Section: Objective Function and Constraintsmentioning
confidence: 99%
See 2 more Smart Citations