WIRELESS MESH NETWORKS – EFFICIENT LINK SCHEDULING, CHANNEL ASSIGNMENT AND NETWORK PLANNING STRATEGIES Edited by Andrey V. Krendzel Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies http://dx.doi.org/10.5772/2612 Edited by Andrey V. Krendzel Contributors Vahid Sattari Naeini, Naser Movahhedinia, Gustavo Vejarano, Aizaz U. Chaudhry, Roshdy H.M. Hafez, Stefan Pollak, Vladimir Wieser, Fawaz Bokhari, Gergely Záruba, Sangsu Jung, Thomas Olwal, Moshe Masonta, Fisseha Mekuria, Kobus Roux, Doug Kuhlman, Ryan Moriarty, Tony Braskich, Steve Emeott, Mahesh Tripunitara, Svilen Ivanov, Edgar Nett, Hassen A. Mogaibel, Mohamed Othman, Shamala Subramaniam and Nor Asilah Wati Abdul Hamid Published by InTech Janeza Trdine 9, 51000 Rijeka, Croatia Copyright © 2012 InTech All chapters are Open Access distributed under the Creative Commons Attribution 3.0 license, which allows users to download, copy and build upon published articles even for commercial purposes, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. After this work has been published by InTech, authors have the right to republish it, in whole or part, in any publication of which they are the author, and to make other personal use of the work. Any republication, referencing or personal use of the work must explicitly identify the original source. Notice Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published chapters. The publisher assumes no responsibility for any damage or injury to persons or property arising out of the use of any materials, instructions, methods or ideas contained in the book. Publishing Process Manager Tanja Skorupan Typesetting InTech Prepress, Novi Sad Cover InTech Design Team First published July, 2012 Printed in Croatia A free online edition of this book is available at www.intechopen.com Additional hard copies can be obtained from orders@intechopen.com Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies, Edited by Andrey V. Krendzel p. cm. ISBN 978-953-51-0672-2 Contents Preface IX Section 1 Efficent Link Scheduling and Channel Assignment Strategies in WMNs 1 Chapter 1 Application of Genetic Algorithms in Scheduling of TDMA-WMNs 3 Vahid Sattari Naeini and Naser Movahhedinia Chapter 2 Stability-Based Topology Control in Wireless Mesh Networks 21 Gustavo Vejarano Chapter 3 Channel Assignment Using Topology Control Based on Power Control in Wireless Mesh Networks 47 Aizaz U. Chaudhry and Roshdy H.M. Hafez Chapter 4 Channel Assignment Schemes Optimization for Multi-Interface Wireless Mesh Networks Based on Link Load 79 Stefan Pollak and Vladimir Wieser Chapter 5 Partially Overlapping Channel Assignments in Wireless Mesh Networks 103 Fawaz Bokhari and Gergely Záruba Section 2 Network Planning Aspects in WMNs 131 Chapter 6 Autonomous Traffic Balancing Routing in Wireless Mesh Networks 133 Sangsu Jung Chapter 7 Achievable Capacity Limit of High Performance Nodes for Wireless Mesh Networks 149 Thomas Olwal, Moshe Masonta, Fisseha Mekuria and Kobus Roux VI Contents Chapter 8 A Correctness Proof of a Mesh Security Architecture 177 Doug Kuhlman, Ryan Moriarty, Tony Braskich, Steve Emeott and Mahesh Tripunitara Chapter 9 Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks 203 Svilen Ivanov and Edgar Nett Chapter 10 High Throughput Path Establishment for Common Traffic in Wireless Mesh Networks 227 Hassen A. Mogaibel, Mohamed Othman, Shamala Subramaniam and Nor Asilah Wati Abdul Hamid Preface Wireless mesh networks (WMNs) have recently received a great deal of attention as a promising cost-effective solution to provide coverage and broadband wireless connectivity for mobile users to get access to different IP applications and services. The factor that has helped WMNs become attractive is the wide application prospects from the wireless community, home and enterprise networking. Moreover, wireless mesh technologies are becoming more and more popular in the context of their integration with heterogeneous next generation networks for purposes of backhaul support, traffic offloading, load balancing, fixed-mobile convergence, etc. However, making these WMNs operationally efficient is a challenging task. In recent years, there has been a lot of work on research issues. Nevertheless, there still exist some open research challenges related to link scheduling, channel assignment, routing and other network planning issues in multi-radio multi-channel WMNs. The main objective of this book is to highlight some recent efforts in developing novel efficient design strategies and efficient algorithms to significantly improve performance and functionality of WMNs. The results presented in this book are expected to help in taking design decisions when deploying WMNs. Ten contributed chapters written by a group of well-known experts in wireless mesh networking are arranged in two sections. Section 1 focuses on link scheduling schemes to select a subset of links for simultaneous transitions under interference constraints in an efficient and fair manner to guarantee a certain level of network connectivity. Besides, it describes channel assignment strategies to improve the network throughput in multi-radio multi-channel WMNs by means of an efficient channel utilization and minimization of the interference. Chapter 1 of this section describes a framework for fair link scheduling based on the application of genetic algorithms taking into account both the QoS requirements of data flows between mesh clients and underlying network characteristics affecting the overall system performance. Chapter 2 deals with the stability-based topology control mechanism using the underlying link scheduling policy of WMNs to optimize the ability of links to carry the information transported by end-to-end data flows. Chapter 3 introduces a topology- controlled interference-aware channel assignment algorithm based on power control which intelligently assigns the available non-overlapping frequency channels to the X Preface wireless mesh routers with the objective of minimizing interference to improve network throughput. Chapter 4 discusses the optimal number of radio interfaces for wireless mesh routers depending on the topology of the mesh network (grid or random), the number of network nodes and the number of data flows in the network. Chapter 5 takes an in-depth look into recent channel assignment schemes exploiting partially overlapping channels in the context of multiple radio WMNs. Section 2 addresses some important network planning issues related to efficient routing protocols in dynamic large-scale mesh environment, achievable capacity limit of a single wireless link between two multi-interface mesh nodes, the correctness of the mesh security architecture, fault-tolerant mesh network topology planning. Chapter 6 of the section presents an autonomous traffic balancing routing protocol based on a combination of back-pressure and geographic routing schemes. The proposed mechanism is inspired by the electrostatic potential theory and able to react adaptively to dynamic traffic environment in large-scale WMNs with a low routing overhead. Chapter 7 presents an in- depth analysis of the impact of multipath and MIMO fading channels on achievable theoretical capacity limits of single links connecting mesh nodes and the impact of number of interfaces and channels per each mesh node on the end-to-end capacity limits of wireless broadband mesh networks. The capacity limits provide useful inputs towards an optimal design of cross-layer protocols. Chapter 8 examines correctness of the mesh security architecture using a protocol composition logic to prove security of the IEEE 802.11s protocol suite. Chapter 9 deals with a fault-tolerance method for guaranteeing the availability of radio coverage and connectivity of wireless mesh networks in dynamic propagation environment. It also proposes an automatic mesh router planning algorithm, which finds a minimum number of wireless mesh routers and their positions to restore the fault-tolerant network mesh topology. Chapter 10 describes a channel reservation scheme in combination with an on-demand routing protocol to establish high throughput paths in multi-radio multi-channel environments and reduce the intra/inter flow interference for the traffic going towards the mesh gateways. Thus, this book covers a variety of issues related to link scheduling, channel assignment, routing and network planning in WMNs and provides an in-depth look into recent advances in these topics. The book can be useful for researchers, PhD students, engineers, and practitioners that are interested in wireless mesh networking. I wish to express my deep appreciation to all Authors for their thorough work. Special thanks to Ms. Tanja Skorupan, Publishing Process manager at InTech Open Access Publisher, for her kind cooperation and patience during the preparation of this book. I wish also to thank my colleagues, Marc Portoles, José Nuñez, and Josep Mangues, for their encouragement and continuous support. Andrey V. Krendzel Centre Tecnològic de Telecomunicacions de Catalunya (CTTC), Barcelona, Spain [...]... Jia, H Liu, Access Scheduling on the Control Channels in TDMA Wireless Mesh Networks, MSN, 2007 20 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies [29] Y Hou, K Leung, A distributed scheduling framework for multi-user diversity gain and quality of service in wireless mesh networks, IEEE Transactions on Wireless Communications, vol 8, no 12, pp 5904-5915,... underling network behavior nor the types of traffic streams flown on the links Our system model is different from the 6 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies previous works in two aspects First, we take into account the underlying network traffic related to each MSS Second, the algorithm proposed in this chapter is such that shrinking the link. .. provided the original work is properly cited 4 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies e8 3 6 e7 e4 e3 1 e2 2 e1 e6 e5 5 Figure 1 A TDMA-WMN with its conflicting links A major challenge in WMNs is to provide QoS support and fair rate allocation among data flows Almost all of the routing and scheduling algorithms presented in the literature... work is properly cited 22 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies node j , i.e., the packet transmitted over ( i , j ) collides with the packet transmitted over the interfering link The set of links that interfere with ( i , j ) is denoted by  ( i , j ) in Figure 1 Therefore, when ( i , j ) is active, none of the links in  ( i , j ) can... Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation, IEEE/ACM Transactions on Networking, vol 18, no 5, pp 1387-1400, Oct 2010 [33] J Joseph, M Princy, Analysis on Scheduling and Load Balancing Techniques in Wireless Mesh Networks, International Journal of Computer Applications, vol 42, no 12, 2012 Chapter 2 Stability-Based Topology Control in Wireless Mesh Networks. .. best-fit individuals for reproduction Breed new individuals through crossover and mutation operations to give birth to offspring iii Evaluate the individual fitness for new individuals iv Replace least-fit population with new individuals 14 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies 5.2 A GA-based approach for the scheduling problem In the previous... Table 2 Traffic specification parameters of traffic types H.263 Video (Park Jurassic I) 260 20 4533.67 11817 0 40 16 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies In order to evaluate the performance of the proposed scheduler and the admission control procedure, the topology of Figure 6 is considered as the scenario All of the end nodes (SSHCs)... Hezar Jerib Avenue, Isfahan, Iran 8 References [1] X Cheng, P Mohapatra, S-J Lee, and S Banerjee, MARIA: Interference-Aware admission control and QoS routing in wireless mesh networks, ICC, 2008 [2] L Badia, A Botta, and L Lenzini, A genetic approach to joint routing and link scheduling for wireless mesh networks, Ad Hoc Networks, vol 7, pp 654-664, 2009 [3] “IEEE 802.11e Medium access control (mac)... individual nodes may make use of the values for the Type, Reliability, Priority/Class, and Drop Precedence fields The Type field is used to distinguish between different categories of messages This field may be used to 8 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies prioritize the transmission of management messages transmitted in the data sub-frame... MSSs), associated with ith outgoing link, related to mth MSS So, [km,i,j] is an M × I × J matrix Each queue should be 10 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies scheduled to transmit its packets over the appropriate link based on the QoS requirements of its content [km,i,j] is available at the MBS through some control messages Assuming . WIRELESS MESH NETWORKS – EFFICIENT LINK SCHEDULING, CHANNEL ASSIGNMENT AND NETWORK PLANNING STRATEGIES Edited by Andrey V. Krendzel Wireless Mesh Networks – Efficient Link. obtained from orders@intechopen.com Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies, Edited by Andrey V. Krendzel p. cm. ISBN 978-953-51-0672-2. traffic streams flown on the links. Our system model is different from the Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies 6 previous