A novel PSO-based algorithm for gateway placement in wireless mesh networks

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

doi:10.1109/iccsn.2011.6013541

Cited by 14 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is also proved to be a cost-effective solution. The ACO algorithm doesn't converges so fast and its result is little worse than PSO [4,15]. Optimizing gateway placement together with throughput maximization is our next research goal.…”

Section: Discussionmentioning

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

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

show abstract

“…Le and Nguyen [25] studied the problem of optimizing gateway placement for throughput in WMNs. In [25], a step by step updated scheme was proposed.…”

Section: Related Workmentioning

confidence: 99%

“…In [25], a step by step updated scheme was proposed. Router node placement in a dynamic network scenario has been studied in [26].…”

Section: Related Workmentioning

confidence: 99%

Minimized Cost Gateway Deployment in Cyber-Physical Systems

Wang

Gao

2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Wireless networks have been widely used in Cyber-Physical System (CPS) for data transmission. A CPS usually contains lots of sensors, and these sensors generate massive data. To make use of these data, we have to collect them through wireless communication. Sensors in a certain CPS do not always adopt same wireless technology, and these sensors formed heterogeneous wireless networks. Communication between different types of wireless networks can only be achieved by utilizing wireless gateways. In this paper, we address the problem of gateway placement for satisfying the bandwidth-requirement of each node by using minimum gateways. This problem can be formulated as a variant of Minimum Geometric Disk Cover problem which has been proved NP-complete. In order to solve our problem, one heuristic gateway placement algorithm and one grid-based heuristic algorithm are proposed. The result of simulation demonstrates that the heuristic algorithm can offer a good solution with big probability.

show abstract

“…This best value is a global best and called gbest. When a particle takes part of the population as its topological neighbors, the best value is a local best and is called lbest [28]- [30].…”

Section: A Particle Swarm Optimizationmentioning

confidence: 99%

A Novel PSO Based Algorithm Approach for the cMTS to Improve QoS in Next Generation Networks

Nguyen¹,

Le²,

Le³

et al. 2013

IJFCC

View full text Add to dashboard Cite

Abstract-In this paper, we propose an effective Particle Swarm Optimization (PSO) algorithm to solving the capacitated minimum spanning tree (cMTS) problem to improve Quality of Service (QoS) in Next Generation Network (NGN). To improving QoS of communication network with considering the network provisioning capability and dynamic environment, we formulate this problem with minimizing the communication cost (as a kind of performance measures for network's QoS). We calculate the fitness value of each scheme and update them step by step with the best method to quickly find good approximate solutions of cMST problems. Numerical experiments show that our algorithm proposed have achieved much better than recent researches.Index Terms-Capacitated minimum spanning tree, communication network, quality of service, next generation network, particle swarm optimization.

show abstract

A novel PSO-based algorithm for gateway placement in wireless mesh networks

Cited by 14 publications

References 11 publications

Optimizing Gateway Placement in Wireless Mesh Networks Based on ACO Algorithm

Optimizing Gateway Placement in Wireless Mesh Networks Based on ACO Algorithm

Minimized Cost Gateway Deployment in Cyber-Physical Systems

A Novel PSO Based Algorithm Approach for the cMTS to Improve QoS in Next Generation Networks

Contact Info

Product

Resources

About