Link Allocation Scheduling with Service Provisioning Approach in Wireless Mesh Networks

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

    Electrical-Telecommunications Engineering Master Thesis

    Abstract

    Wireless mesh networks are one of the technologies of interest for creating next generation wireless networks. 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 relays in order to reduce their number will also reduce the speed of 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 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 performance of 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 do not meet the needs of many areas. 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, where mesh routers have the least possible mobility and form the backbone of the WMN. They provide access to the network for both mesh users and normal users. Figure 1-1- Wireless mesh network The wireless mesh network is completely compatible with the structure of the wired network, and each transmitter provides access to the Internet for users connected to it and will act as a part of the network structure. Network traffic will pass through multiple [a4] 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 transmit information.

    Each wireless relay in this network is an element of the network structure and can deliver information from the wireless mesh network to the 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. In case of any obstacle, the network traffic can be redirected to another relay, of course, without the need for any change in the location of the central radio to communicate with remote geographical locations. Since the area covered by each access point can be expanded around the obstacles, the number of access points is reduced. Wireless mesh networks have cheap expandable technology and are suitable for high-speed access in remote geographical areas. RoofNet [a5] 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 a gateway [2] of the Internet [a6]. (1-2)).

    Figure 1-2- SS to BS traffic transmission through[a7] relays

    One of the widely used standards that supports wireless mesh networks in its structure[a8] is the 802.16 standard with the brand name WiMAX[5]. This standard defines the transport media access control protocol for urban wireless networks. In this standard, arrangements have been made to support the quality of service, in terms of the quality of cabled access networks.  With the help of standard 802.16 mesh mode, it is possible to quickly provide reliable wireless connections with a coverage area much greater than the reachable radius in the physical layer. Therefore, the 802.16 standard mesh mode with MAC based on TDMA technology is a suitable solution for implementing wireless mesh networks. Wireless mesh networks are fixed multi-hop networks that are used to provide wireless access in a wide geographical area [1, 2, 3]. The main challenge in these networks is to provide high quality service to their users. By introducing a new MAC that uses TDMA technology, the 802.16 standard provides the ability to provide quality of service for these networks. 1-2 The necessity of guaranteeing quality of service, the main challenge in wireless mesh networks The rapid growth of wireless networks at the same time as the creation of new services has raised many diverse research topics in these networks. In the meantime, many of these issues are related to guaranteeing the quality of service. The becoming of data, audio and video transmission networks requires [a10] various services. In such an environment and in order to create a suitable network in which users' expectations are met satisfactorily, the control of network behavior in order to guarantee the quality of service of different users becomes particularly important. An important point that should not be left out of mind is the efficiency of network components and resources. Otherwise, the price and complexity of the equipment required to provide the service will not be acceptable.

    In the early years, the Internet was mostly used to exchange information between network researchers. At that time [a11] electronic mail, file sending [6] and remote network access [7] were the main uses of the Internet. The expansion of demand caused major changes in the use of the Internet network. New applications such as audio-visual group conferences, strong search centers in the network, Internet telephone calls and electronic commerce have made the need to guarantee the quality of service inevitable. Currently, the provision of services in the Internet network is done in the form of "best [a12] effort[8]" in which there is no guarantee for the quality of the service provided. When a user accesses the network, some parts of the network may be so congested due to lack of proper timing in the use of resources that the traffic is not transmitted or delayed so much that it does not actually meet the user's needs. The characteristics of the discussed service are as follows:

    The network does not reject any type of traffic when establishing a connection due to the lack of resources necessary to provide the service.

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

    List:

    Title

    Table of Contents. A

    List of Figures 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 and Ad-hoc mesh networks. 19

    A

    6-2 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: [1] 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.

    [2] IEEE 802. 2005-16, IEEE Standard for Local and Metropolitan Area Networks – Part 16: Air Interface for Fixed Broadband Wireless Access Systems for Mobile. 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.

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

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

    [5] S.Ramanathan, "A unified framework and algorithm for channel assignment in wireless networks", Wireless Networks, vol. 5, Issue 2, pp. 81–94, March 1999.

    [6] S. Ramanathan, L. Lloyd, “Scheduling algorithms for multihop radio networks”, IEEE/ACM Transactions on Networking, vol. 1, Issue 2, pp. 166-177, April 1993.

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

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

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

    [10] 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.

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

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

    [13] 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.

    [14]           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.

    [15]           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.

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

    [17] 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.

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

    [19] 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.

    [20] 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.

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

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

    [23]           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.

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

    [25]           N.Bayer, D.Sivchenko, B.Xu, V.Rakocevic, J.Habermann, “Transmission Timing of Signaling message IN IEEE 802.

Link Allocation Scheduling with Service Provisioning Approach in Wireless Mesh Networks