Joint Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks Using Simulated Annealing

  • Hui Cheng
  • Shengxiang Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5361)

Abstract

This paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I., Wang, X., Wang, W.: Wireless Mesh Networks: a Survy. Comput. Netw. 47, 445–487 (2005)CrossRefMATHGoogle Scholar
  2. 2.
    Wang, X., Cao, J., Cheng, H., Huang, M.: QoS Multicast Routing for Multimedia Group Communications Using Intelligent Computational Methods. Comput. Comm. 29, 2217–2229 (2006)CrossRefGoogle Scholar
  3. 3.
    Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.: An Iterative Algorithm for Delay-constrained Minimum-cost Multicasting. IEEE/ACM Trans. Netw. 6, 461–474 (1998)CrossRefGoogle Scholar
  4. 4.
    Zeng, G., Wang, B., Ding, Y., Xiao, L., Mutka, M.: Multicast Algorithms for Multi-Channel Wireless Mesh Networks. In: Proc. ICNP 2007, pp. 1–10 (2007)Google Scholar
  5. 5.
    Jain, K., Padhye, J., Padmanabhan, V., Qiu, L.: Impact of Interference on Multi-hop Wireless Network Performance. In: Proc. MobiCom 2003, pp. 66–80 (2003)Google Scholar
  6. 6.
    Subramanian, A., Gupta, H., Das, S.: Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks. In: Proc. SECON 2007, pp. 481–490 (2007)Google Scholar
  7. 7.
    Levanova, T.V., Loresh, M.A.: Algorithms of Ant System and Simulated Annealing for the p-median Problem. Autom. Rem. Contr. 65, 431–438 (2004)CrossRefMATHGoogle Scholar
  8. 8.
    Zhang, K., Qi, Y., Zhang, H.: Dynamic Multicast Routing Algorithm for Delay and Delay Variation-bounded Steiner Tree Problem. Knowl.-Based Syst. 19, 554–564 (2006)CrossRefGoogle Scholar
  9. 9.
    Thai, M., Li, Y., Du, D.: A Combination of Wireless Multicast Advantage and Hitch-hiking. IEEE Commun. Lett. 9, 1037–1039 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Hui Cheng
    • 1
  • Shengxiang Yang
    • 1
  1. 1.Department of Computer ScienceUniversity of LeicesterLeicesterUnited Kingdom

Personalised recommendations