Wireless Network Gateway Placement by Evolutionary Graph Clustering

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10636)

Abstract

Gateway placement is an important problem in the design of a backbone wireless network (BWN) as it directly affects the installation and ongoing running costs of the BWN. From a computational point of view, the gateway placement problem is a constrained combinatorial optimization problem. In this paper, we transform the gateway problem into a graph clustering problem and design a repairing genetic algorithm (RGA) to solve the graph clustering problem. Different from traditional GAs, this RGA embeds a procedure that can detect and repair those infeasible solutions generated by the crossover and mutation operators. Experimental results show that the infeasible solution detecting and repairing procedure can not only reduce the computation time of the RGA, but also improve the quality of the solutions generated by the RGA. In this paper, we also conduct an empirical study of the computational efficiency of the RGA. The analysis result shows that its computational efficiency is quadratic, which is computationally efficient.

Keywords

Backbone wireless network Gateway placement Graph clustering Genetic algorithm Evolutionary computation 

References

  1. 1.
    Aoun, B., Boutaba, R., Iraqi, Y., Kenward, G.: Gateway placement optimization in wireless mesh networks with qos constraints. IEEE J. Sel. Areas Commun. 24(11), 2127–2136 (2006)CrossRefGoogle Scholar
  2. 2.
    Ashraf, U.: Energy-aware gateway placement in green wireless mesh networks. IEEE Commun. Lett. 21(1), 156–159 (2017)CrossRefGoogle Scholar
  3. 3.
    Bejerano, Y.: Efficient integration of multihop wireless and wired networks with qos constraints. IEEE/ACM Trans. Networking 12(6), 1064–1078 (2004)CrossRefGoogle Scholar
  4. 4.
    Chandra, R., Qiu, L., Jain, K., Mahdian, M.: Optimizing the placement of internet taps in wireless neighborhood networks. In: IEEE International Conference on Network Protocols, pp. 271–282. IEEE (2004)Google Scholar
  5. 5.
    Hamdi, M., Franck, L., Lagrange, X.: Gateway placement in hybrid manet-satellite networks. In: IEEE Vehicular Technology Conference, pp. 1–5. IEEE (2012)Google Scholar
  6. 6.
    Li, F., Wang, Y., Li, X.Y., Nusairat, A., Wu, Y.: Gateway placement for throughput optimization in wireless mesh networks. Mob. Netw. Appl. 13(1–2), 198–211 (2008)CrossRefGoogle Scholar
  7. 7.
    Lin, C.C., Shu, L., Deng, D.J.: Router node placement with service priority in wireless mesh networks using simulated annealing with momentum terms. IEEE Syst. J. 10(4), 1402–1411 (2016)CrossRefGoogle Scholar
  8. 8.
    Omar, H.A., Zhuang, W., Li, L.: Gateway placement and packet routing for multihop in-vehicle internet access. IEEE Trans. Emerg. Top. Comput. 3(3), 335–351 (2015)CrossRefGoogle Scholar
  9. 9.
    Tang, M.: Gateways placement in backbone wireless mesh networks. Int. J. Commun. Netw. Syst. Sci. 2(1), 44 (2009)Google Scholar
  10. 10.
    Tang, M.: A memetic algorithm for the location-based continuously operating reference stations placement problem in network real-time kinematic. IEEE Trans. Cybern. 45(10), 2214–2223 (2015)CrossRefGoogle Scholar
  11. 11.
    Wong, J.L., Jafari, R., Potkonjak, M.: Gateway placement for latency and energy efficient data aggregation [wireless sensor networks]. In: IEEE International Conference on Local Computer Networks, pp. 490–497. IEEE (2004)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Queensland University of TechnologyBrisbaneAustralia

Personalised recommendations