Seventh International Conference on Networking (Icn 2008) 2008
DOI: 10.1109/icn.2008.89
|View full text |Cite
|
Sign up to set email alerts
|

Gateway Placement with QoS Constraints in Wireless Mesh Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(19 citation statements)
references
References 7 publications
0
19
0
Order By: Relevance
“…In [8], Aoun et al proposed a polynomial time near-optimal algorithm which recursively computes minimum weighted dominating sets, while consistently preserving QoS requirements across iterations. With the similar object as in [6][7][8], some various algorithms were proposed in [9,10].…”
Section: Introductionmentioning
confidence: 99%
“…In [8], Aoun et al proposed a polynomial time near-optimal algorithm which recursively computes minimum weighted dominating sets, while consistently preserving QoS requirements across iterations. With the similar object as in [6][7][8], some various algorithms were proposed in [9,10].…”
Section: Introductionmentioning
confidence: 99%
“…To minimize the number of gateway and make load balance between gateways, Wu et al [5] proposed a gateway placement optimization algorithm for load balancing in wireless mesh networks, which is greedy algorithm based on the weight of the load of network. Drabu et al [6] used heuristic algorithms to solve gateway placement optimization problem of WMN, and presented a near optimal heuristics algorithm for gateway placement. Seyedzadegan et al [7].…”
Section: Related Workmentioning
confidence: 99%
“…The random deployment algorithm and ILA (Improved Liu's Architecture) algorithm proposed in [6] are used as comparison algorithms in experiment. The simulation is done using MATLAB tool.…”
Section: Experimental Environment and Parameters Settingmentioning
confidence: 99%
“…Y. Drabu et al [2] addressed gateways placement problem, consisting of placing a minimum number of gateways so that quality-of-service (QoS) requirements are satisfied and also presented a near optimal heuristics algorithm for gateway placement. B. Aoun et al [3] addressed the problem of gateways placement by placing a minimum number of gateways such that quality-ofservice (QoS) requirements are satisfied using polynomial time near-optimal algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…A popular approach is to divide the network into clusters, and a single mesh router is chosen as the gateway to within the cluster Research in [2][3][4] and [16] has used different clustering-based approaches. Y. Drabu et al [2] addressed gateways placement problem, consisting of placing a minimum number of gateways so that quality-of-service (QoS) requirements are satisfied and also presented a near optimal heuristics algorithm for gateway placement.…”
Section: Related Workmentioning
confidence: 99%