**Author details**

Vahid Sattari Naeini and Naser Movahhedinia *Department of Computer Engineering, University of Isfahan, Hezar Jerib Avenue, Isfahan, Iran* 

### **8. References**


[12] Y-J. Shen and M-S. Wang, Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network, Expert systems with applications, vol. 34, pp. 900-907, 2008.

18 Wireless Mesh Networks – Efficient Link Scheduling, Channel Assignment and Network Planning Strategies

*Department of Computer Engineering, University of Isfahan, Hezar Jerib Avenue, Isfahan, Iran* 

[1] X. Cheng, P. Mohapatra, S-J. Lee, and S. Banerjee, MARIA: Interference-Aware admission

[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) quality of service (qos) enhancements," 2005. [4] C. Cicconetti, L. Lenzini, E. Mingozzi, and G. Stea, An efficient cross layer scheduler for multimedia traffic in wireless local area networks with IEEE 802.11e HCCA, ACM SIGMOBILE Mobile Computing and Communications Review, vol. 11, pp. 31-46, July

[5] S. Liu, S. Feng, W. Ye, and H. Zhuang, Slot allocation algorithms in centralized scheduling scheme for IEEE 802.16 based wireless mesh networks, Computer

[6] W. Liao, S. P. Kedia, and A. K. Dubay, A centralized scheduling algorithm for WiMAX

[7] H.-Y. Wei, S. Ganguly, R. Izmailov, and Z. Haas, Interference-aware IEEE 802.16 WiMax

[8] P. Djukic and S. Valaee, Delay aware link scheduling for multi-hop TDMA wireless networks, IEEE/ACM Transactions on Networking, vol. 17, pp. 870- 883, June 2009. [9] B. Han, W. Jia, and L. Lin, Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks, Computer Communications, vol. 30, pp. 782-792, Nov. 2007. [10] D. Kim and A. Ganz, Fair and efficient multihop scheduling algorithm for IEEE 802.16

[11] W. Wang, Y. Wang, X-Y. Li, W-Z, Song, O. Frieder, *Efficient Interference-Aware TDMA* 

genetic algorithms in distributed scheduling of WMNs is investigated.

control and QoS routing in wireless mesh networks, ICC, 2008.

Vahid Sattari Naeini and Naser Movahhedinia

Communications, vol. 32, pp. 943-953, 2009.

mesh network, NOMS, 2010, pp. 858-861.

mesh networks, VTC, 2005, pp. 3102-3106.

BWA systems, Broadnets, 2005, pp. 895-901.

*Link Scheduling for Static Wireless Networks*, MobiCom, 2006.

**Author details** 

**8. References** 

2007.

optimization problem which is to be solved to minimize queues in the system. We develop a genetic algorithm method to find the optimal schedule for each relaying node. Furthermore to be able to fulfill QoS requirements of established connections, we developed an admission control mechanism. Finally, the performance of the proposed GA algorithm along with the admission control procedure was evaluated by simulating a typical network scenario. Simulation results showed effectiveness of our admission control and scheduling mechanisms. In our next work, we introduce some new mechanisms including MIMO technique to the above-mentioned system and investigate its performance. Meanwhile, application of

	- [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, 2009.

**Chapter 2** 

© 2012 Vejarano, licensee InTech. This is an open access chapter distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

© 2012 The Author(s). Licensee InTech. This chapter is distributed under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution,

**Stability-Based Topology Control** 

Topology control1 in wireless mesh networks is an important problem due to the effects it has on the different layers of the protocol stack [1]. For example, the network connectivity, energy consumption, total physical-link throughput, spatial reuse, and total end-to-end throughput as a function of the network topology have been investigated in [2-6] respectively. In this chapter, we look at the problem of topology control for adapting the stability region of the link-scheduling policy of the network. Therefore, we start by defining the

The goal when designing link-scheduling policies is to achieve maximum throughput while making the policies amenable for implementation [7, 8]. Link scheduling refers to the selection of a subset of links for simultaneous transmission that have the following characteristic: When the links are activated simultaneously, the interference between them is low enough to allow successful reception for every activated link. A link-scheduling policy specifies the mechanism that determines, for every time slot, a subset of links that fits this characteristic. For example, consider the network and the link (,) *i j* shown in Figure 1. Let this network operate under the frame structure shown in Figure 2. Therefore, in the network, time is divided into frames; each frame is divided into a control subframe and a data subframe, and each subframe is further divided into a series of time slots. Whenever link (,) *i j* is activated by the link-scheduling policy during a data-time slot, the link transmits a data packet. In order for the packet to be received successfully, none of the links that interfere with (,) *i j* can be active while (,) *i j* is active. Otherwise, the packet transmitted by node *i* is not received successfully by node *j* . This is known as a packet collision at

<sup>1</sup>In this chapter, topology control refers to the problem of controlling the creation and elimination of wireless links and

and reproduction in any medium, provided the original work is properly cited.

the interference between them by controlling the transmission power of the nodes.

**in Wireless Mesh Networks** 

Additional information is available at the end of the chapter

problem of link scheduling and the stability region.

Gustavo Vejarano

**1. Introduction** 

http://dx.doi.org/10.5772/48576

