Skip to main content

Research on Routing Algorithm Based on Wardrop Equilibrium in Wireless Mesh Networks

  • Conference paper
Book cover Pervasive Computing and the Networked World (ICPCA/SWS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8351))

  • 3030 Accesses

Abstract

Routing algorithm of wireless mesh networks at present don’t take the global network utilization into consideration, we will propose a routingalgorithm that completely distributed, automatically load balanced and multiple paths, we define a delay function with link utilization as the impedance function to raise the global network utilization. According to compare the DSDV to the WELBM, the WELBM has better network performance.

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. Hai-Qing, Z.: Load balancing mutipath routing protocol in wireless mesh networks. Microcomputer information 27(2), 225–227 (2011)

    Google Scholar 

  2. Yan, Y., Qing-Wei, D.: An improved Load Aware Multipath Routing Protocol in WMN. Computer Technology and Development 22(5), 23–27 (2012)

    Google Scholar 

  3. Raghunathan, V., Kumar, P.R.: Wardrop Routing in Wireless Networks. IEEE Transactions on Mobile Computing 8 (May 2009)

    Google Scholar 

  4. Fischer, S., Rache, H., Vocking, B.: Fast convergence to Wardrop Equilibria by adaptive sampling methods. In: ACM Sympon Theory of Computing (STOC) (May 2006)

    Google Scholar 

  5. Zhang, Y., Luo, J.J., Hu, H.: Wireless mesh network: structure, protocol and standard. Electronic Industry Press (2008)

    Google Scholar 

  6. Chao, D., Gui-Hai, C., Hai, W.: Research on QoS in wireless mesh network. Journal of Software 20, 1539–1552 (2009)

    Article  Google Scholar 

  7. Lee, Y.O., Rengarajan, B., Narasimha Reddy, A.L.: Reaching Approximate Wardrop Equilibrium at Reduced Costs of Link State Updates. In: IEEE 2011 (2011)

    Google Scholar 

  8. Raghunathan, V., Kumar, P.R.: Issues in Wardrop routing in wireless networks. In: First International Conference on Wireless Internet (2005)

    Google Scholar 

  9. Altmana, E., Boulognea, T.: A Survey On Networking Games in Telecommunications. Computers & Operations Research (2006)

    Google Scholar 

  10. Banner, R., Orda, A.: Bottleneck Routing Games in Communication Networks. IEEE Journal Selected Areas in Communications (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, X., Zheng, MC., Zhang, PP., Li, X., Ren, XX., Lou, C. (2014). Research on Routing Algorithm Based on Wardrop Equilibrium in Wireless Mesh Networks. In: Zu, Q., Vargas-Vera, M., Hu, B. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2013. Lecture Notes in Computer Science, vol 8351. Springer, Cham. https://doi.org/10.1007/978-3-319-09265-2_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09265-2_71

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09264-5

  • Online ISBN: 978-3-319-09265-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics