The minimum number of gateways for maximizing throughput in wireless mesh networks

Le, Vinh Trong; Dinh, Nghia Huu; Nguyễn, Như Gia

doi:10.1145/2069216.2069235

Cited by 1 publication

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where f j is the cost function of the client j is computed by the formula (3). The pheromone evaporates during time and diminishes if there are no new additions.…”

Section: Cost Functionmentioning

confidence: 99%

“…A similar problem was studied by Ping Zhou, Xudong Wang, B. S. Manoj and Ramesh Rao in [2], however, their scheme was not updated step by step, and the locations of gateways were determined sequentially, so the location of previously-placed gateways affects the location of those placed later. In the latest paper have published in [3]- [4], we was studied the challenging problem of optimizing gateway placement for throughput in Wireless Mesh Networks and propose a novel algorithm based Particle Swarm Optimization (PSO) algorithm. They are generated randomly and independently, updated step by step with the best method, so quickly find the optimal scheme and achieve better result than previous studies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing Gateway Placement in Wireless Mesh Networks Based on ACO Algorithm

Le¹,

Nguyễn²,

Dinh³

et al. 2013

IJCCE

Self Cite

View full text Add to dashboard Cite

In this paper, we study the challenging problem ofoptimizing gateway placement for throughput in Wireless MeshNetworks and propose a novel algorithm based on Ant ColonyOptimization (ACO) for it. The ACO algorithm is originatedfrom ant behavior in the food searching based on pheromone.We generate the locations of gateway randomly andindependently then calculate the probability and pheromonevalues of ants will choose to go from current gateway i to nextclient j. After each iteration, the pheromone values are updatedby all the number of ants that have reached to the destinationsuccessfully and found a optimal solution. Numerical resultsshow that the proposed algorithm has achieved much betterthan previous studies

show abstract

“…where f j is the cost function of the client j is computed by the formula (3). The pheromone evaporates during time and diminishes if there are no new additions.…”

Section: Cost Functionmentioning

confidence: 99%