Abstract
The QoS performance of wireless mesh networks (WMNs) is measured by the topology connectivity as well as the client coverage, both of which are related to the problem of router nodes placement, in which each mesh client is served as equal. In practice, however, mesh clients with different payments for the network services should be provided by different qualities of network connectivity and QoS. As a result, to respond to the practical requirement, this paper considers the router nodes placement problem in WMNs with service priority constraint in which each mesh client is additionally associated with a service priority value, and we constrain that the mesh clients with the top one-third priority values must be served. Our concerned problem inherited from the original problem is computationally intractable in general, and hence this paper further proposes a novel simulated annealing (SA) approach that adds momentum terms to search resolutions more effectively. Momentum terms can be used to improve speed and accuracy of the original annealing schedulers, and to prevent extreme changes in values of acceptance probability function. Finally, this paper simulates the proposed novel SA approach for different-size instances, and discusses the effect of different parameters and annealing schedulers.
Research supported in part by NSC 101-2219-E-009-025.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: A survey. Journal on Computer Networks 47, 445–487 (2005)
Aoun, B., Kenward, G., Boutaba, R., Iraqi, Y.: Gateway placement optimization in wireless mesh networks with QoS constraints. IEEE Journal on Selected Areas in Communications 24(11), 2127–2136 (2006)
Barolli, A., Sánchez, C., Xhafa, F., Takizawa, M.: A study on the performance of search methods for mesh router nodes placement problem. In: Proc. of 2011 IEEE International Conference on Advanced Information Networking and Applications (AINA 2011), pp. 756–763. IEEE Press (2011)
Barolli, A., Sánchez, C., Xhafa, F., Takizawa, M.: A Tabu search algorithm for efficient node placement in wireless mesh networks. In: Proc. of 3rd International Conference on Intelligent Networking and Collaborative Systems (INCoS 2011), pp. 53–59. IEEE Press (2011)
Keikha, M.M.: Improved simulated annealing using momentum terms. In: Proc. of Second International Conference on Intelligent System, Modeling and Simulation (ISMS 2011), pp. 44–48. IEEE Press (2011)
Napieralski, A., Wojtanowicz, K., Zabierowski, W.: Quality of service in wireless networks. In: Proc. of 10th International Conference on the Experience of Designing and Application of CAD Systems in Microelectronics (CADSM 2009), pp. 168–170. IEEE Press (2009)
Rabiner, L.: Combinatorial optimization: Algorithms and complexity. IEEE Transactions on Acoustics, Speech and Signal Processing 32(6), 1258–1259 (1984)
Sánchez, C., Xhafa, F., Barolli, L., Miho, R.: An annealing approach to router nodes placement problem in wireless mesh networks. In: Proc. of 2010 International Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2010), pp. 245–252. IEEE Press (2010)
Sánchez, C., Xhafa, F., Barolli, L.: Locals search algorithms for efficient router nodes placement in wireless mesh networks. In: Proc. of International Conference on Network-Based Information Systems (NBIS 2009), pp. 572–579. IEEE Press (2009)
Sánchez, C., Xhafa, F., Barolli, L.: Genetic algorithms for efficient placement of router nodes in wireless mesh networks. In: Proc. of 24th IEEE International Conference on Advanced Information Networking and Applications (AINA 2010), pp. 465–472. IEEE Press (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, CC., Lin, YL., Liu, WY. (2013). Solving Router Nodes Placement Problem with Priority Service Constraint in WMNs Using Simulated Annealing. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_91
Download citation
DOI: https://doi.org/10.1007/978-3-642-38027-3_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38026-6
Online ISBN: 978-3-642-38027-3
eBook Packages: Computer ScienceComputer Science (R0)