Skip to main content

A Channel Assignment Algorithm Based on Link Traffic in Wireless Mesh Network

  • Conference paper
Book cover Advanced Information Technology in Education

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 126))

  • 1624 Accesses

Abstract

In a wireless mesh network, in order to accomplish the purposes of minimizing the interference within the mesh network and improving the network connectivity in the course of channel assignment. This paper proposed a heuristic algorithm which can predict the busy-degree of a node through predicting the link traffic in the networks. So the algorithm can respond to the distribution of data traffic flexibly. This paper also used the protocol interference model to reduce the interference between the links in the wireless mesh network. Simulation results show that the algorithm can reduce the waiting time while a data frame is transmitting. And the network throughput and stability can be improved significantly.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Avallone, S., Akyildiz, I.F.: A channel assignment algorithm for multi-radio wireless mesh networks. In: 16th International Conference on ICCCN 2007, Honolulu, HI, pp. 1034–1039 (2007)

    Google Scholar 

  2. Marina, M.K., Das, S.R.: A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks. In: 2nd International Conference on BroadNets 2005, California, pp. 381–390 (2005)

    Google Scholar 

  3. Ramachandran, K.N., Belding, E.M., Almeroth, K.C., Buddhikot, M.M.: Interference aware channel assignment in multi-radio wireless mesh networks. In: 25th IEEE International Conference on Computer Communications, Barcelona, Spain, pp. 1–12 (2006)

    Google Scholar 

  4. Li, L., Yang, G.W., Cheng, G.Y.: A Forecast Method of the Flow in Networks. J. Computer Engineering, 15–16 (1998)

    Google Scholar 

  5. Naouel, B.S., Hubaux, J.P.: A fair scheduling for wireless mesh networks. In: The First IEEE Workshop on Wireless Mesh Networks (WiMesh), Santa Clara (2005)

    Google Scholar 

  6. NS tutorial, http://www.isi.edu/nsnam/ns/tutorial/index.htm

  7. IEEE Std. 802.16-2004, IEEE standard for Local and Metropolitan Area Networks (2004)

    Google Scholar 

  8. Perkins, C., Royer, E.: Ad-hoc On-Demand Distance Vector Routing. In: 2nd IEEE Workshop on Mobile Computing Systems and Applications, Washington, DC, pp. 90–100 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liu Chunxiao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Chunxiao, L., Guiran, C., Jie, J., Lina, S. (2012). A Channel Assignment Algorithm Based on Link Traffic in Wireless Mesh Network. In: Thaung, K. (eds) Advanced Information Technology in Education. Advances in Intelligent and Soft Computing, vol 126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25908-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25908-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25907-4

  • Online ISBN: 978-3-642-25908-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics