Wireless Mesh Networks: Architectures and Protocols

Wireless Mesh Networks: Architectures and Protocols

Kin K. Leung

Language: English

Pages: 333

ISBN: 0387688382

Format: PDF / Kindle (mobi) / ePub

This book collects articles featuring recent advances in the theory and applications of wireless mesh networking technology. The contributed articles, from the leading experts in the field, cover both theoretical concepts and system-level implementation issues. The book starts with the essential background on the basic concepts and architectures of wireless mesh networking and then presents advanced level materials in a step-by-step fashion.

Advanced Operating Systems and Kernel Applications: Techniques and Technologies

Agent-Based Semantic Web Service Composition (SpringerBriefs in Electrical and Computer Engineering)

Artificial Intelligence: The Basics

Reasoning About Knowledge

Computer Science and Educational Software Design: A Resource for Multidisciplinary Work in Technology Enhanced Learning

Genetic Programming Theory and Practice XI (Genetic and Evolutionary Computation)
















Table 3.1, we take Range(BS → MS) = Range(BS → RS) + 0.3 (in km). Table 3.2 presents the spectral efficiency comparison between direct communication with mutual information Idirect and relay-assisted two-hop routing with end-to-end mutual information Irelay = 1/(1/I1 + 1/I2 ), where quantities I1 and I2 represent the mutual information over the BS-RS and RS-MS links, respectively (following (3.2)-(3.4)). We observe from these results that under favorable LOS conditions over the BS-RS link,

3.5 Scheduling, Routing and Resource Allocation Based on End-to-End Metrics Current and evolving standards for broadband wireless systems are adopting orthogonal-frequency division multiple access (OFDMA) as the resource allocation policy, in which the available time and frequency resources over each wireless link are orthogonally allocated across users, avoiding inter-user interference and impairments due to multipath fading. For fixed portable applications, where radio channels are slowly

range is assumed to be a fixed multiple of the communication range), the authors mathematically formulated the joint channel assignment and routing problem taking into account interference constraints, the number of channels in the network, and the number of radios available at each mesh router. They then solved the problem with the use of the LP relaxation technique. This was then followed by (i) several adjustment steps to obtain a valid channel assignment and a link scheduling policy that

MCG are created the same way as in the original conflict graph. Two vertices in the MCG have an edge between them if the links 122 M. Conti, S. K. Das, L. Lenzini, and H. Skalli in G’ represented by these two vertices interfere. Fig. 5.6(c) shows the MCG of the wireless mesh network represented in Fig. 5.6(a). In this figure, each vertex is labeled using the radios that make up the vertex. For example, vertex xz2 represents the link between the radio on router x and the second radio on router

dimension corresponds to a vertex vi ∈ Vc . In the above example, besides the independent sets consisting of each vertex itself, {{a, b}, {e, f }} is also an independent set. Let vertices {a, b}, {c, d}, {e, f } 152 Y. Xue, Y. Cui, and K. Nahrstedt a b c d e f (a) Multi-hop wireless network {c,d} {a,b} {e,f} (b) Conflict graph {c,d} (0,1,0) (1,0,0) {e,f} (0,0,1) {a,b} (1,0,1) (c) Independent set polytope Fig. 6.4. Resource model of multi-hop wireless network. correspond to the

Download sample