Wireless Networks

, Volume 22, Issue 4, pp 1235–1250 | Cite as

Social-aware dynamic router node placement in wireless mesh networks

  • Chun-Cheng Lin
  • Pei-Tsung Tseng
  • Ting-Yu Wu
  • Der-Jiunn DengEmail author


The problem of dynamic router node placement (dynRNP) in wireless mesh networks (WMNs) is concerned with determining a dynamic geographical placement of mesh routers to serve mobile mesh clients at different times, so that both network connectivity (i.e., the greatest topology subgraph component size) and client coverage (i.e., the number of the served mesh clients) are maximized. Mesh clients are wireless devises associated with users, and in real world, the users with same interests or some social relationship have higher chance to gather and move together geographically, i.e., they form a community, and the WMN with multiple communities can be regarded as a social network. Therefore, this paper investigates the so-called social-aware WMN-dynRNP problem assuming that mesh routers should be aware of the social community structure of mesh clients to dynamically adjust their placement to improve network performance. To cope with this problem, this paper proposes a social-based particle swarm optimization approach, which additionally includes a social-supporting vector to direct low-loading mesh routers to support the heavy-loading mesh routers in the same topology subgraph component (community), so as to dynamically adopt to the social community behavior of mesh clients. As compared with the previous approach, our experimental results show that the proposed approach is capable of effectively reducing number of the unserved mesh clients and increasing network connectivity in dynamic social scenarios.


Social network Wireless mesh network Router node placement Community movement Particle swarm optimization 



The authors thank the anonymous referees for comments that improved the content as well as the presentation of this paper. This work has been supported in part by MOST 104-2221-E-009-134-MY2 and NSC 102-2221-E-018 -012 -MY3, Taiwan.


  1. 1.
    Wang, X. (2008). Wireless mesh networks. Journal of Telemedicine and Telecare, 14(8), 401–403.CrossRefGoogle Scholar
  2. 2.
    Pathak, P. H., & Dutta, R. (2011). A survey of network design problems and joint design approaches in wireless mesh networks. IEEE Communications Surveys and Tutorials, 13(3), 396–428.CrossRefGoogle Scholar
  3. 3.
    Shu, L., Zhang, Y., Zhou, Z., Hauswirth, M., Yu, Z., & Hynes, G. (2008). Transmitting and gathering streaming data in wireless multimedia sensor networks within expected network lifetime. ACM/Springer Mobile Networks and Applications, 13(3–4), 306–322.Google Scholar
  4. 4.
    Shu, L., Zhou, Z., Hauswirth, M., Phuoc, D., Yu, P. & Zhang, L. (2007). Transmitting streaming data in wireless multimedia sensor networks with holes. In Proceedings of the 6th international conference on mobile ubiquitous multimedia (MUM 2007) (pp. 24–33). ACM Press.Google Scholar
  5. 5.
    Akyildiz, I. F., Wang, X., & Wang, W. (2005). Wireless mesh networks: A survey. Journal of Computer Networks, 47(4), 445–487.CrossRefzbMATHGoogle Scholar
  6. 6.
    Franklin, AA. & Murthy, CSR. (2007). Node placement algorithm for deployment of two-tier wireless mesh networks. In Proceedings of IEEE global telecommunications conference (GLOBECOM’07), (pp. 4823–4827). IEEE Press.Google Scholar
  7. 7.
    Oda, T., Barolli, A., Xhafa, F., Barolli, L., Ikeda, M., & Takizawa, M. (2013). WMN–GA: A simulation system for WMNs and its evaluation considering selection operators. Journal of Ambient Intelligence and Humanized Computing, 4(3), 323–330.CrossRefGoogle Scholar
  8. 8.
    Xhafa, F., Barolli, A., Sánchez, C., & Barolli, L. (2011). A simulated annealing algorithm for router nodes placement problem in wireless mesh networks. Simulation Modelling Practice and Theory, 19(10), 2276–2284.CrossRefzbMATHGoogle Scholar
  9. 9.
    Xhafa, F., Sánchez, C., Barolli, A. & Takizawa, M. (2011). A tabu search algorithm for efficient node placement in wireless mesh networks. In Proceedings of third international conference on intelligent networking and collaborative systems (INCoS 2011) (pp. 53–59). IEEE Press.Google Scholar
  10. 10.
    Chang, X., Oda, T., Spaho, E., Ikeda, M., Barolli, L. & Xhafa, F. (2013). Performance evaluation of WMNs using hill climbing algorithm considering giant component and different distributions. In Park J. J., et al. (eds.) Information technology convergence, (Vol. 253), Lecture notes in electrical engineering (pp. 161–167).Google Scholar
  11. 11.
    Lin, C. C., Shu, L. & Deng, D. J., (2014). Router node placement with service priority in wireless mesh networks using simulated annealing with momentum terms. IEEE Systems Journal (in press).Google Scholar
  12. 12.
    Lin, C. C. (2013). Dynamic router node placement in wireless mesh networks: A PSO approach with constriction coefficient and its convergence analysis. Information Sciences, 232, 294–308.MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Shu, L., Zhang, Y., Yang, L., Wang, Y., Hauswirth, M., & Xiong, N. (2010). TPGF: Geographic routing in wireless multimedia sensor networks. Telecommunication Systems, 44(1–2), 79–95.CrossRefGoogle Scholar
  14. 14.
    Younis, M., & Akkaya, K. (2008). Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6(4), 621–655.CrossRefGoogle Scholar
  15. 15.
    Li, F., Wang, Y., Li, X. Y., Nusairat, A., & Wu, Y. (2008). Gateway placement for throughput optimization in wireless mesh networks. Mobile Networks and Applications, 13(1–2), 198–211.CrossRefGoogle Scholar
  16. 16.
    Wang, J., Xie, B., Cai, K., & Agrawal, D. P. (2007). Efficient mesh router placement in wireless mesh networks. In Proceedings of IEEE international conference on mobile adhoc and sensor systems (MASS 2007) (pp. 1–9). IEEE Press.Google Scholar
  17. 17.
    Oda, T., Barolli, A., Spaho, E., Barolli, L., Xhafa, F., & Younas, M. (2014). Effects of population size for location-aware node placement in WMNs: Evaluation by a genetic algorithm–based approach. Personal and Ubiquitous Computing, 18(2), 261–269.CrossRefGoogle Scholar
  18. 18.
    Barolli, A., Xhafa, F. & Takizawa, M. (2011). Optimization problems and resolution methods for node placement in wireless mesh networks. In Proceedings of 14th IEEE international conference on network-based information systems (NbiS 2011) (pp. 7–9). IEEE Press.Google Scholar
  19. 19.
    Kas, M., Appala, S., Wang, C., Carley, K. M., Carley, L. R., & Tonguz, O. K. (2012). What if wireless routers were social? Approaching wireless mesh networks from a social networks perspective. IEEE Wireless Communications Magazine, 19(6), 36–43.CrossRefGoogle Scholar
  20. 20.
    Kim, S., Lin, MC. & Manocha, D. (2014). Simulating crowd interactions in virtual environments (doctoral consortium). In Proceedings of IEEE virtual reality 2014 (VR 2014) (pp. 135–136). IEEE Press.Google Scholar
  21. 21.
    Song, Y., Gong, J., Niu, L., Li, Y., Jiang, Y., Zhang, W., & Cui, T. (2013). A grid-based spatial data model for the simulation and analysis of individual behaviours in micro-spatial environments. Simulation Modelling Practice and Theory, 38, 58–68.CrossRefGoogle Scholar
  22. 22.
    Li, F., & Wu, J. (2009). Localcom: A community-based epidemic forwarding scheme in disruption-tolerant networks. In Proceedings of 6th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (SECON’09) (pp. 1–9). IEEE Press.Google Scholar
  23. 23.
    Basurra, S. S., Ji, Y., De Vos, M., Padget, J., Lewis, T. & Armour, S., (2012) Social-aware routing for wireless mesh networks. In Proceedings of 2012 IEEE vehicular technology conference (VTC Fall 2012) (pp. 1–5). IEEE Press.Google Scholar
  24. 24.
    Wong, G. K. & Jia, X. (2013) A novel socially-aware opportunistic routing algorithm in mobile social networks. In Proceedings of 2013 international conference on computing, networking and communications (ICNC 2013) (pp. 514–518). IEEE Press.Google Scholar
  25. 25.
    Wei, K., Zeng, D., Guo, S. & Xu, K. (2013). Social-aware relay node selection in delay tolerant networks. In Proceedings of 22nd international conference on computer communications and networks (ICCCN 2013) (pp. 1–7). IEEE Press.Google Scholar
  26. 26.
    Wei, K., Liang, X., & Xu, K. (2014). A survey of social-aware routing protocols in delay tolerant networks: Applications, taxonomy and design-related issues. IEEE Communications Surveys and Tutorials, 16(1), 556–578.CrossRefGoogle Scholar
  27. 27.
    Eberhart, R. C., & Kennedy, J. (1995). A new optimizer using particles swarm theory. In Proceedings of the 6th international symposium on micro machine and human science (MHS’95) (pp. 39–43). IEEE Press.Google Scholar
  28. 28.
    Kennedy, J. (1997). The particle swarm: Social adaptation of knowledge. In Proceedings of IEEE international conference on evolutionary computation (pp. 303–308). IEEE Press.Google Scholar
  29. 29.
    Shi, Y. & Eberhart, R. C. (1998). A modified particle swarm optimizer. In Proceedings of the 1998 IEEE international conference on evolutionary computation (pp. 69–73). IEEE Press.Google Scholar
  30. 30.
    Eberhart, R. C. & Shi, Y. (2001). Tracking and optimizing dynamic systems with particle swarms. In Proceedings of the 2001 congress on evolutionary computation, (Vol. 1, pp. 94–100). IEEE Press.Google Scholar
  31. 31.
    Hsiao, K. J., Kulesza, A., & Hero, A. O. (2014). Social collaborative retrieval. IEEE Journal of Selected Topics in Signal Processing, 8(4), 680–689.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Chun-Cheng Lin
    • 1
  • Pei-Tsung Tseng
    • 1
  • Ting-Yu Wu
    • 1
  • Der-Jiunn Deng
    • 2
    Email author
  1. 1.Department of Industrial Engineering and ManagementNational Chiao Tung UniversityHsinchuTaiwan
  2. 2.Department of Computer Science and Information EngineeringNational Changhua University of EducationChanghuaTaiwan

Personalised recommendations