Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

This is an Open Access publication published under CSC-OpenAccess Policy.
On the Tree Construction of Multi hop Wireless Mesh Networks with Evolutionary Algorithms
Zahra Zareei, Shahram Jafari
Pages - 1 - 9     |    Revised - 31-03-2011     |    Published - 04-04-2011
Volume - 3   Issue - 1    |    Publication Date - March / April 2011  Table of Contents
Wireless Mesh Networks, WiMAX, Network Planning
Abstract — in this paper, we study the structure of WiMAX mesh networks and the influence of tree’s structure on the performance of the network. From a given network’s graph, we search for trees, which fulfill some network, QoS requirements. Since the searching space is very huge, we use genetic algorithm in order to find solution in acceptable time. We use NetKey representation which is an unbiased representation with high locality, and due to high locality we expect standard genetic operators like n-point cross over and mutation work properly and there is no need for problem specific operators. This encoding belongs to class of weighted encoding family. In contrast to other representation such as characteristics vector encoding which can only indicate whether a link is established or not, weighted encodings use weights for genotype and can thus encode the importance of links. Moreover, by using proper fitness function we can search for any desired QOS constraint in the network.
CITED BY (0)  
1 Google Scholar
2 CiteSeerX
3 Socol@r
4 Scribd
5 WorldCat
6 SlideShare
7 PdfSR
1 IEEE 802.16d-2004,”Draft IEEE Standard for Local and Metropolitan area networks”, May 2004.
2 S. Skiena, "Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica",Addison-Wesley,1990.
3 M. J. Lee, J. Zheng, Y.-B. Ko, and D. M. Shrestha, “Emerging standards for wireless mesh technology,” Wireless Commun”, 13( 2): 56–63, 2006.
4 Salim Nahle, Luigi Iannone, Benoit Donnet and Naceur Malouch, “On the Construction of a wimax mesh tree”, IEEE COMMUNICATIONS LETTERS, 11(12): 967 – 969, 2007
5 I. F. Akyildiz, X. Wang, and W. Wang, “Wireless mesh networks: A survey,” Comput. Netw., 47(4):445–487, 2005.
6 V. Gambiroza, B. Sadeghi, and E. W. Knightly, “End-to-end performance and fairness in multihop wireless backhaul networks,” in Proc. ACM MOBICOM, Sep. 2004.
7 J. Jun and M. L. Sichitiu, “Fairness and QoS in multihop wireless networks,” in Proc. IEEE VTC, Oct. 2003.
8 J.-F. Lee, W. Liao, and M.-C. Chen, “An incentive-based fairness mechanism for multi-hop wireless backhaul networks with selfish nodes,” IEEE Trans. Wireless Commun., 7(2): 697 - 704,2008.
9 T.Liu, W.Lio , “Location Dependent Throughput and Delay in Wireless Mesh Networks” , IEEE Transactions on Vehicular Technology, 57(2):1188-1198, 2008.
10 S.Nahle, L.Iannone, B.Donnet, and T. Friedman, “Investigating depth fanout trade-off in WiMAX mesh networks”, in Proc. 1st WEIRD workshop, May 2007.
11 H. Prufer. “Neuer Beweis eines Satzes uber Permutationen” Arch.Math. Phys.27(1) : 742- 744,1918.
12 J. Gottlieb, G. R. Raidl, B.A. Julstrom, F. Rothlauf ,” Pr¨ufer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search” IEEE Transactions on Evolutionary Computation, 4(2):125–134, 2002.
13 F.Rothluf , D.E. Goldberg and A.Heinzel, “Network Random Keys—A Tree Representation Scheme for Genetic and Evolutionary Algorithms” MIT press journals , 10(1): 75-97,2002.
14 Ali Al-Hemyari, Nor Kamariah Noordin, Alyani Ismail, Sabira Khatun, Yaseen H. Tahir, and Y.A. Qassem “Centralized Scheduling, Routing Tree in WiMAX Mesh Networks”, Innovations in Information Technology, 2008. IIT 2008, Al Ain UAE.
Mr. Zahra Zareei
company - Iran
Dr. Shahram Jafari
- Iran