Link Allocation Scheduling with Service Provision Approach in Wireless Mesh Networks

Number of pages: 109 File Format: word File Code: 32238
Year: 2013 University Degree: Master's degree Category: Electrical Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Link Allocation Scheduling with Service Provision Approach in Wireless Mesh Networks

    Master's Thesis of Electrical-Telecommunications Engineering

     

    Abstract
     
     

     

    Wireless mesh networks are one of the most important technologies for creating wireless networks. They are the next generation. Because these networks can provide users with a wide coverage area and high capacity with low power consumption and low cost due to less path loss and also reducing the effect of the shadowing factor, which is due to their multi-step feature. In contrast to these advantages, these networks face the problem of not being easily expandable. Because the traffic that is relayed by multiple interfaces needs more bandwidth, it will suffer more delay and therefore the quality of service will decrease. Increasing the distance of the relays in order to reduce their number will also reduce the speed of the links. An increase in the number of network users also leads to more collisions and as a result, a further decrease in throughput. An increase in the area covered by the network will result in a drop in throughput and an increase in delay due to the need for more relays. Therefore, proper efficiency in a mesh network must be achieved by solving an optimization problem that includes effective factors (such as delay, throughput, etc.). Solving this type of problem in recent years as an NP-Hard problem has attracted a lot of attention in the field of problems related to wireless mesh networks.

    In this thesis, a new algorithm is presented in order to improve centralized scheduling and optimal allocation of time windows to network nodes, taking into account the reusability of the frequency space, the end-to-end delay guarantee method for the user is presented. The algorithm proposed in this research for the approximate solution of the scheduling optimization problem is based on the genetic algorithm. The proposed algorithm has the ability to adapt to different parameters (such as efficiency, fairness, etc.) based on the operator's wishes. The result of the implementation confirms the improvement of the results compared to the previous methods. 1-1 Introduction, the perspective of wireless mesh networks The excessive prevalence of the Internet in today's communication world has been such that the high-speed wired access structures are not responsive to the needs of many areas. The number of service centers Today's high-speed Internet services are very low in relation to demand. Cabling high-speed lines for all these service providers is very expensive and time-consuming. Today, new technologies [a1] have been introduced to replace these wired networks. These alternative networks are high-speed wireless networks that provide fast access to the Internet when the wired network structure is unable to meet the needs of users due to the high volume of applicants or old networks, and eliminate the additional costs associated with updating the cabling structure. Traditional wireless systems are often used for commercial purposes in places where high speed and accuracy are needed, and in personal cases or homes, cheap technology should be used. Now, technical advances have made this possible and created many opportunities for Internet service providers. Wireless Mesh Networks [1] (WMN) is one of the key and influential technologies during the next decade that will play a very important role [a2] in the future generations of wireless and mobile networks. With the help of these networks, the dream that has been in the minds of many users of various types of networks around the world for a long time is getting closer to being realized; And this dream is nothing but connecting to the network at any time, at any moment, with the utmost simplicity and the lowest cost.

     

     

    These networks include mesh routers [a3] and also mesh users, in which mesh routers have the least possible mobility and form the backbone of WMN. They provide network access to both mesh users and regular users.

     

    1.       Wireless Mesh Networks

     

    [a1] Your comment has been applied and the edit has been made

     

    [a2] Your comment has been applied and the word has been corrected.

     

    [a3] Your comment has been applied

    The wireless mesh network is completely compatible with the structure of the wired network, and each transmitter provides access to the users connected to it

    to the Internet and will act as a part of the network structure. Network traffic will pass through multiple [a1] relays

    , allowing different stations to connect even if they are out of network range. Wireless mesh networks are the most flexible and least expensive way to expand high-speed Internet services that can be used mainly for personal use.

    Each wireless relay in this network is an element of the network structure and can deliver information from the wireless mesh network to its destination. This type of network eliminates the problems of obstacles in the radio environment and makes the network expandable very cheaply and conveniently, because in this structure each relay only needs to communicate with its adjacent relay. Network traffic can be redirected to another relay in the event of any obstacle, without the need for any change in the location of the central radio to communicate with remote geographical locations.

    Since the coverage area of ??each access point can be expanded around obstacles, the number of access points is reduced.

    Wireless mesh networks have cheap technology that can be used. They are suitable for expansion and high-speed access in remote geographical areas. RoofNet[a2] is an example of these networks. This network usually includes a number of wireless access points that are installed on the windows and roofs of houses, and the information platforms of home computers are transmitted by wire to the antennas and are transferred from one antenna to another antenna to reach an Internet gateway [1] [a3] .

    In wireless mesh networks, the traffic of each SS[2] is sent by network relays to the Internet or another external network to the BS[3] It is directed

    Abstract

    Wireless mesh network (WMN), is promising technology for next generation networks, because it can provide extended coverage range, power consumption reduction and increased throughput simultaneously. Multi hop concept of these networks leads to less path loss and shadowing effect and so coverage range can be extended. Also these networks need little cabling engineering and this makes their setup cheaper. But one of these networks' problems is scalability issue, because relayed traffic needs more bandwidth and has less QoS (delay and jitter).

    Increasing hop distances in order to reduce the number of hops decreases links' rates. Also more users equals more collisions which is equivalent to throughput degradation. Coverage range extension leads to less QoS and throughput, because it needs more hops.

    According to these facts, acceptable performance of a WMN is equivalent to solving an optimization problem which takes into account mentioned factors concurrently. This is hot topic research as an NP-hard problem in WMNs nowadays. Scheduling plays an important role in providing QoS support to multimedia communications in WMNs.

    In this thesis a novel algorithm based on Genetic algorithm with Spatial Reuse for improving centralized scheduling and optimal time slot allocation in Wireless Mesh Networks is presented. The proposed algorithm considers hard QoS, spatial reuse for efficient use, complete interference model and the impact of node positions in topology.

  • Contents & References of Link Allocation Scheduling with Service Provision Approach in Wireless Mesh Networks

    List:

    Table of contents. A

    list of bugs. Five

    List of tables. Seven

    Abstract. 1

    1- The first chapter of the introduction. 2

    1-1 Introduction, Wireless Mesh Networks Perspective. 2

    1-2 The need to guarantee quality of service, the main challenge in wireless mesh networks. 4

    1-3 Definition of the problem................... 6

    1-4 Review of work background.. 7

    1-5 next chapters of this article.. 9

    6-1 Conclusion. . 9

                      2- The second chapter of wireless mesh networks. 11

    2-1 Perspective. . 11

    2-2 network topology. . 14

    2-2-1 point-to-point topology (PTP). . 14

    2-2-2 point-to-multipoint topology (PMP). 14

    2-2-3 mesh topology. . 15

    2-3 multistep wireless networks. 16

    2-4 Architecture of wireless mesh networks. 17

    2-4-1 wireless mesh networks as infrastructure network. 17

    2-4-2 wireless mesh networks of users. . 18

    2-4-3 combined wireless mesh networks. . 19 2-5 Comparison of wireless mesh networks and Ad-hoc 19 2-6 Issues related to network layers and open research fields. 21

    2-6-1 Physical layer. . 21

    2-6-2 access layer in wireless mesh networks. 23

    2-6-3 single-channel MAC. . 24

    2-6-4MAC multi-channel. . 25

    2-6-5 network layers. . 28

    2-6-6 transmission layer. . 30

    2-6-7 layers of application. . 31

    2-7 Network management. . 32

    2-8 interlayer design. . 33

    2-9 Applications of WMN. . 33

    2-9-1 broadband home network. 33

    2-9-2 Networking communities and neighborhoods. 34

    2-9-3 Networking of commercial companies. 35

    2-9-4 urban networks. . 36

    2-9-5 other networks. . 37

    2-9-6 Some case examples of WMN networks. 38

    2-10 Summary. . 39

             3- The third chapter of centralized scheduling in wireless mesh networks.      41

    3-1 Introduction. . 41

    3-2 IEEE 802.16 standard physical layer. 42

    3-2-1 Digital modulation. . 46

    3-3 layer MAC standard IEEE 802.16. 48

    3-3-1 link matching. . 49

    3-4 mesh mode operation in standard IEEE 802.16 MAC. 50

    two

    3-4-1 frame structure in IEEE 802.16 standard mesh mode. 51

    3-4-2 control subframe. . 52

    3-4-3 data subframe. . 54

    3-4-4 How to enter a node into the network. . 56

    3-5 Scheduling model based on IEEE 802.16 standard. 57

    3-5-1 Centralized scheduling. . . 59

    6-3 Summary.. 60

                 4-Chapter 4 of centralized scheduling model, challenges and methods in wireless mesh networks.      61

    4-1 Introduction. . 61

    4-2 Design requirements of scheduling algorithms. 62

    4-2-1 Interference between wireless links. . 62

    4-2-2 overhead. . 64

    4-2-3 delay. . 65

    4-2-4 frequency reuse. . 66

    3-4 Classification of scheduling algorithms. 68

    4-4 Introduction of scheduling algorithms with different operators. 70

    4-5 Conclusion. . 76

    5- The fifth chapter of the proposed algorithm based on the genetic algorithm.       78

    5-1 Introduction. . 78

    5-2 genetic algorithm. . 79

    5-2-1 History. . 79

    5-2-2 The structure of genetic algorithms. 80

    5-2-3 genetic algorithm operators. . 82

    5-2-4 Coding and convergence of genetic algorithm. 86

    5-3 proposed algorithm. . 87

    three

    5-4 simulation. . 96

    5-4-1 simulation environment. . 96

    5-4-2 Simulation results. . 98

    5-5 Summary. .  111 Error! Bookmark not defined. Chapter 6, conclusions and suggestions. 112. References. 114. Source: IEEE 802. 2004-16, IEEE standard for local and metropolitan area networks part 16: air interface for fixed broadband wireless access systems, Oct. 1, 2004.

    IEEE 802. 2005-16, IEEE Standard for Local and Metropolitan Area Networks – Part 16: Air Interface for Fixed Broadband Wireless Access Systems for Mobile Users, December 2005. M. S. Kuran, T. Tugcu / Computer Networks 51 (2007) 3013–3046 3043.

    I.F.Akyildiz, X.Wang, “AWang, "A survey on wireless mesh networks", IEEE Communication Magazine, Vol. 43, Issue 9, pp. 23-30, Sept 2005.

    S.Redana, and M.Lott, "Performance Analysis of IEEE 802.16a in Mesh Mode", IST SUMMIT, France, June 2004.

    S.Ramanathan, "A unified framework and algorithm for channel assignment in wireless networks", Wireless Networks, vol. 5, Issue 2, pp. 81–94, March 1999. S. Ramanathan, L. Lloyd, “Scheduling algorithms for multihop radio networks”, IEEE/ACM Transactions on Networking, vol. 1, Issue 2, pp. 166–177, April 1993.

    B. Hajek, G. Sasaki, "Link scheduling in polynomial time", IEEE Transactions on Information Theory, vol. 34, Issue 5, pp. 910–917, September 1988.

    T.Salonidis, L.Tassiulas, “Distributed dynamic scheduling for end to end rate guarantees in wireless ad hoc networks”, ACM MobiHoc, pp. 145–156, 2005.

    M.Kodialam, T.Nandagopal, “Characterizing achievable rates in multihop wireless networks: The joint routing and scheduling problem”, ACM MobiCom, 2003.

    M.Kodialam, T.Nandagopal, “Characterizing achievable rates in multihop wireless mesh networks with orthogonal channels”, IEEE/ACM Transactions on Networking, vol. 13, Issue 4, pp. 868–880, 2005.

    G.Sharma, R.Mazumdar, N.Shroff, “On the complexity of scheduling in wireless networks”, ACM Mobicom, 2006.

    S.Gandham, M.Dawande, and R.Prakash, “Link scheduling in sensor networks: Distributed edge coloring revisited”, IEEE INFOCOM, 2005.

    N.Bayer, B.Xu, V.Rakocevic, J.Habermann, "Improving the Performance of the Distributed Scheduler in IEEE 802.16 Mesh Networks", IEEE VTC, pp. 1193-1197, 2007. H. Wei, S. Ganguly, R. Izmailov, and Z. Haas, “Interference-aware IEEE 802.16 WiMax mesh networks”, IEEE VTC, vol. 5, pp. 3102- 3106, , 2005.

    J.Tao, F.Liu, Zh.Zeng, and Zh.Lin, "Throughput Enhancement in WiMax Mesh Networks Using Concurrent Transmission", IEEE WiMob, Vol. 2, pp. 871 -874, 2005.

    Y.Cao, Zh Liu, Y.Yang, "A Centralized Scheduling Algorithm based on Multi-path Routing in WiMAX Mesh Network", IEEE WiCOM, 2006.

    B.Han, W.Jia, and L.Lin, "Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks", ACM Computer Communications, vol. 30, Issue 4, pp. 782-792, 2007.

     

    F.Jin, A.Arora, J.Hwang, A.Choi, “Routing and Packet Scheduling for Throughput Maximization in IEEE 802.16 Mesh Networks”, IEEE Broadnets, 2007.

    P.Du, W.Jia, L.Huang, W.Lu, “Centralized Scheduling and Channel Assignment in Multi-Channel Single-Transceiver WiMax Mesh Network”, IEEE WCNC, pp. 1734-1739, 2007.

    D.Kim and A.Ganz, "Fair and efficient multihop scheduling algorithm for IEEE 802.16 BWA systems", IEEE Broadnets, Vol. 2, pp. 833 - 839, 2005.

    C.Hong, A.Chun Pang, “Link Scheduling with QoS Guarantee for Wireless Relay Networks”, IEEE Transactions on Networking, 2008.

    F.I.Akyildiz, X.Wang and W.Wang, “Wireless mesh networks: a survey”. Computer Networks Journal (Elsevier), 47(4), 445–487 2005.

    Y.Zhang, J.Luo, and H.Honglin, “Wireless Mesh Networking Architecture, Protocols and standards”, pages 4-7, 14-15, 428-429,568-590, 2007 by Taylor & Francis Group, LLC.

    A.Tzamaloukas, l.Garcia, "A Receiver Initiated Collision Avoidance Protocol for Multi Channel Networks". In Proceeding of INFOCOM, 1997.

    N.Bayer, D.Sivchenko, B.Xu, V.Rakocevic, J.Habermann, “Transmission Timing of Signaling message IN IEEE 802. 16 Based on mesh network”, European wireless Athens, Greece, Apr 2-5, 2006.

    B.Raman, and K.chebrolv, “Design and Evaluation of a new MAC Protocol for Long Distance 802.11 Mesh Network”, in proc, ACM, 2005.

    T. J.Tsai, H.Tseng, and A.C.Pang,"A New MAC Protocol for Wi-Fi Mesh Network", in Proc IEEE AINA06, 2006.

    D.Couto, D.Aguayo, J.Bicket, and R.

Link Allocation Scheduling with Service Provision Approach in Wireless Mesh Networks