Abstract
In wireless mesh networks (WMNs), mesh clients communicate with each other via the gateway and bridging functions of mesh routers. The performance of a WMN is generally affected by its network connectivity and client coverage, both of which are determined by its router node placement (RNP) in the deployment area. For simplicity, previous works considered only the RNP where each mesh client is served as an equal. In practice, however, mesh clients should be served with different priorities owing to factors such as their importance and their different payments for the service access. To fulfil this requirement, by assuming that each mesh client is also associated with a service priority, this paper investigates an RNP problem with a service priority constraint in which the mesh clients with service priorities higher than a threshold must be served. Given that this problem inherited from the complexity of the original RNP problem is computationally intractable in general, this paper also develops a novel simulated annealing (SA) approach that takes into account momentum terms to improve the efficiency and accuracy of annealing schedules and prevent fluctuations in values of the acceptance probability function. Additionally, the time complexity of the proposed SA algorithm is analyzed. Furthermore, evaluation of different-size instances under various parameters and annealing schedules demonstrates the superiority of the proposed approach.
| Original language | English |
|---|---|
| Pages (from-to) | 1402-1411 |
| Number of pages | 10 |
| Journal | IEEE Systems Journal |
| Volume | 10 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2016 Dec 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Electrical and Electronic Engineering
Cite this
}
Router Node Placement with Service Priority in Wireless Mesh Networks Using Simulated Annealing with Momentum Terms. / Lin, Chun Cheng; Shu, Lei; Deng, Der-Jiunn.
In: IEEE Systems Journal, Vol. 10, No. 4, 01.12.2016, p. 1402-1411.Research output: Contribution to journal › Article
TY - JOUR
T1 - Router Node Placement with Service Priority in Wireless Mesh Networks Using Simulated Annealing with Momentum Terms
AU - Lin, Chun Cheng
AU - Shu, Lei
AU - Deng, Der-Jiunn
PY - 2016/12/1
Y1 - 2016/12/1
N2 - In wireless mesh networks (WMNs), mesh clients communicate with each other via the gateway and bridging functions of mesh routers. The performance of a WMN is generally affected by its network connectivity and client coverage, both of which are determined by its router node placement (RNP) in the deployment area. For simplicity, previous works considered only the RNP where each mesh client is served as an equal. In practice, however, mesh clients should be served with different priorities owing to factors such as their importance and their different payments for the service access. To fulfil this requirement, by assuming that each mesh client is also associated with a service priority, this paper investigates an RNP problem with a service priority constraint in which the mesh clients with service priorities higher than a threshold must be served. Given that this problem inherited from the complexity of the original RNP problem is computationally intractable in general, this paper also develops a novel simulated annealing (SA) approach that takes into account momentum terms to improve the efficiency and accuracy of annealing schedules and prevent fluctuations in values of the acceptance probability function. Additionally, the time complexity of the proposed SA algorithm is analyzed. Furthermore, evaluation of different-size instances under various parameters and annealing schedules demonstrates the superiority of the proposed approach.
AB - In wireless mesh networks (WMNs), mesh clients communicate with each other via the gateway and bridging functions of mesh routers. The performance of a WMN is generally affected by its network connectivity and client coverage, both of which are determined by its router node placement (RNP) in the deployment area. For simplicity, previous works considered only the RNP where each mesh client is served as an equal. In practice, however, mesh clients should be served with different priorities owing to factors such as their importance and their different payments for the service access. To fulfil this requirement, by assuming that each mesh client is also associated with a service priority, this paper investigates an RNP problem with a service priority constraint in which the mesh clients with service priorities higher than a threshold must be served. Given that this problem inherited from the complexity of the original RNP problem is computationally intractable in general, this paper also develops a novel simulated annealing (SA) approach that takes into account momentum terms to improve the efficiency and accuracy of annealing schedules and prevent fluctuations in values of the acceptance probability function. Additionally, the time complexity of the proposed SA algorithm is analyzed. Furthermore, evaluation of different-size instances under various parameters and annealing schedules demonstrates the superiority of the proposed approach.
UR - http://www.scopus.com/inward/record.url?scp=85010663314&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85010663314&partnerID=8YFLogxK
U2 - 10.1109/JSYST.2014.2341033
DO - 10.1109/JSYST.2014.2341033
M3 - Article
AN - SCOPUS:85010663314
VL - 10
SP - 1402
EP - 1411
JO - IEEE Systems Journal
JF - IEEE Systems Journal
SN - 1932-8184
IS - 4
ER -