Skip to main content

Optimizing the Placement of ITAPs in Wireless Mesh Networks by Implementing HC and SA Algorithms

  • Conference paper
  • First Online:
Book cover Ad Hoc Networks (ADHOCNETS 2015)

Abstract

In this paper, we present novel heuristic improvement (move) operators for the design of Wireless Mesh Networks (WMN), and demonstrate their efficiency within simple Hill Climbing (HC) and Simulated Annealing (SA) frameworks. The management cost of Internet Transit Access Points (ITAPs) in WMN is significant, so it is crucial to minimize the number of ITAPs required whilst maintaining an acceptable quality of service (QoS). Using a single objective method, we investigate algorithms to make informed placement decisions based on the grid size, wireless range connectivity, wireless link capacity and user demands. The experimental results showed the efficiency of the proposed combination of move operators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aoun, B., Boutaba, R., Member, S., Iraqi, Y., Kenward, G.: Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints. IEEE J. Sel. Areas Commun. 24(11), 2127–2136 (2006)

    Article  Google Scholar 

  2. Wang, J., Xie, B., Cai, K., Agrawal, D.P.: Efficient mesh router placement in wireless mesh networks. In: 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, pp. 1–9 (2007)

    Google Scholar 

  3. Chandra, R., Qiu, L., Jain, K., Mahdian, M.: Optimizing the placement of internet TAPs in wireless neighborhood networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols, ICNP 2004, pp. 271–282 (2004)

    Google Scholar 

  4. Martignon, F., Paris, S., Filippini, I., Capone, A.: Efficient Bandwidth Allocation in Wireless Community Networks (2011)

    Google Scholar 

  5. Amaldi, E., Capone, A., Cesana, M., Filippini, I., Malucelli, F.: Optimization models and methods for planning wireless mesh networks. Comput. Networks 52(11), 2159–2171 (2008)

    Article  MATH  Google Scholar 

  6. Allen, S.M., Cooper, I.M., Whitaker, R.M.: Optimising multi-rate link scheduling for wireless mesh networks. Comput. Commun. 35(16), 2014–2024 (2012)

    Article  Google Scholar 

  7. Jun, J., Sichitu, M.L.: The Nominal Capacity of Wireless Mesh Networks. IEEE Wirel. Commun. 10, 8–14 (2003)

    Google Scholar 

  8. Capone, A., Filippini, I., Martignon, F.: Joint routing and scheduling optimization in wireless mesh networks with directional antennas. In: 2008 IEEE International Conference on Communications, pp. 2951–2957 (2008)

    Google Scholar 

  9. Benyamina, D., Ha, A., Gendreau, M.: Wireless Mesh Networks Design — A Survey. IEEE Communications Surveys & Tutorials 14(2), 299–310 (2012)

    Article  Google Scholar 

  10. Xhafa, F., Sanchez, C., Barolli, L.: Ad hoc and neighborhood search methods for placement of mesh routers in wireless mesh networks. In: 2009 29th IEEE Int. Conf. Distrib. Comput. Syst. Work., pp. 400–405, June 2009

    Google Scholar 

  11. Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195(3), 803–809 (2009)

    Article  MATH  Google Scholar 

  12. Xhafa, F., Sanchez, C., Barolli, L., Miho, R.: An annealing approach to router nodes placement problem in wireless mesh networks. In: 2010 Int. Conf. Complex, Intell. Softw. Intensive Syst, pp. 245–252, February 2010

    Google Scholar 

  13. Li, F., Wang, Y., Li, X.-Y., Nusairat, A., Wu, Y.: Gateway Placement for Throughput Optimization in Wireless Mesh Networks. Mob. Networks Appl. 13(1–2), 198–211 (2008)

    Article  Google Scholar 

  14. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn., vol. 7 (2001)

    Google Scholar 

  15. Rosenbluth, M.N., Teller, A.H., Metropolis, N., Rosenbluth, A.W.: Equation of state Calculations by Fast Computing Machines. J. Chem. Physic 21(6) (1953)

    Google Scholar 

  16. Manuscript, A.: NIH Public Access 21(suppl. 1), 1–19 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liqaa Nawaf .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Nawaf, L., Mumford, C., Allen, S. (2015). Optimizing the Placement of ITAPs in Wireless Mesh Networks by Implementing HC and SA Algorithms. In: Mitton, N., Kantarci, M., Gallais, A., Papavassiliou, S. (eds) Ad Hoc Networks. ADHOCNETS 2015. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 155. Springer, Cham. https://doi.org/10.1007/978-3-319-25067-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25067-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25066-3

  • Online ISBN: 978-3-319-25067-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics