Maximum concurrent flow of multiple channels in wireless mesh network.

Cheung, Kwok Sum.Thesis submitted in: October 2007.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.Includes bibliographical references (leaves 71-74).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.iiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Infrastructure of Wireless Mesh Networks --- p.1Chapter 1.2 --- Characteristics and Advantages of WMNs --- p.4Chapter 1.3 --- Challenges --- p.7Chapter 2 --- Background Study --- p.10Chapter 2.1 --- Maximum Concurrent Flow Problem --- p.10Chapter 2.2 --- Channel Assignment --- p.12Chapter 2.3 --- Congestion Control --- p.13Chapter 3 --- Problem Formulation --- p.16Chapter 3.1 --- Physical Model --- p.16Chapter 3.2 --- MCFP of Multiple Channels --- p.19Chapter 3.2.1 --- MCFP Channel Assignment Pattern --- p.19Chapter 3.2.2 --- Min-max Spectral Radius Optimization --- p.22Chapter 3.2.3 --- Min-max Channel Assignment Problem --- p.24Chapter 4 --- Min-max Pattern in Chain Network --- p.26Chapter 4.1 --- Chain Network --- p.26Chapter 4.2 --- Min-max Channel Assignment Pattern --- p.28Chapter 5 --- Bottleneck Assignment Heuristic Algorithm --- p.35Chapter 5.1 --- Algorithm Description --- p.35Chapter 5.1.1 --- Introduction --- p.35Chapter 5.1.2 --- First Part of the BAHA --- p.38Chapter 5.1.3 --- Second Part of the BAHA --- p.43Chapter 5.2 --- Optimality --- p.47Chapter 5.3 --- Simulation of the BAHA --- p.53Chapter 5.3.1 --- Performance evaluation --- p.55Chapter 6 --- Sequential Assignment Heuristic Algorithm --- p.59Chapter 6.1 --- Algorithm Description --- p.59Chapter 6.1.1 --- Introduction --- p.59Chapter 6.1.2 --- Lower bound of spectral radius --- p.60Chapter 6.1.3 --- Procedures of SAHA --- p.62Chapter 6.2 --- Simulation Result --- p.64Chapter 6.3 --- Performance evaluation --- p.64Chapter 7 --- Conclusion --- p.69Bibliography --- p.7

Mesmerizer: A Effective Tool for a Complete Peer-to-Peer Software Development Life-cycle

In this paper we present what are, in our experience, the best practices in Peer-To-Peer(P2P) application development and how we combined them in a middleware platform called Mesmerizer. We explain how simulation is an integral part of the development process and not just an assessment tool. We then present our component-based event-driven framework for P2P application development, which can be used to execute multiple instances of the same application in a strictly controlled manner over an emulated network layer for simulation/testing, or a single application in a concurrent environment for deployment purpose. We highlight modeling aspects that are of critical importance for designing and testing P2P applications, e.g. the emulation of Network Address Translation and bandwidth dynamics. We show how our simulator scales when emulating low-level bandwidth characteristics of thousands of concurrent peers while preserving a good degree of accuracy compared to a packet-level simulator

Exploiting Regional Differences: A Spatially Adaptive Random Access

In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access (SARA) scheme in which the transmitters in the network utilize different transmit probabilities depending on the local situation. In our proposed scheme, the transmit probability is adaptively updated by the ratio of the received SINR and the target SINR. We investigate the performance of the spatially adaptive random access scheme. For the comparison, we derive an optimal transmit probability of ALOHA random access scheme in which all transmitters use the same transmit probability. We illustrate the performance of the spatially adaptive random access scheme through simulations. We show that the performance of the proposed scheme surpasses that of the optimal ALOHA random access scheme and is comparable with the CSMA/CA scheme.Comment: 10 pages, 10 figure