Spelling suggestions: "subject:"mest.""
181 |
Distributed Cross-layer Monitoring in Wireless Mesh NetworksYe, Panming, Zhou, Yong January 2009 (has links)
<p>Wireless mesh networks has rapid development over the last few years. However, due to properties such as distributed infrastructure and interference, which strongly affect the performance of wireless mesh networks, developing technology has to face the challenge of architecture and protocol design issues. Traditional layered protocols do not function efficiently in multi-hop wireless environments. To get deeper understanding on interaction of the layered protocols and optimize the performance of wireless mesh network, more recent researches are focusing on cross-layer measurement schemes and cross-layer protocol design. The goal of this project is to implement a distributed monitoring mechanism for IEEE802.11 based wireless mesh networks. This module is event-based and has modular structure that makes it flexible to be extended. This project results a novel Cross-Layer Monitoring Module, CLMM, which is a prototype that monitors each layer of the nodes locally and dynamically, calculates the average values of the metrics, compares these values with thresholds and handles the cross-layer messages of each node. The CLMM also has a routing module structure that can be extended to distribute the metrics to its neighbors.</p>
|
182 |
Multi-Channel Anypath Routing for Multi-Channel Wireless Mesh NetworksLavén, Andreas January 2010 (has links)
<p>Increasing capacity in wireless mesh networks can be achieved by using multiple channels and radios. By using different channels, two nodes can send packets at the same time without interfering with each other. To utilize diversity of available frequency, typically cards use channel-switching, which implies significant overhead in terms of delay. Assignment of which channels to use needs to be coupled with routing decisions as routing influences topology and traffic demands, which in turn impacts the channel assignment.</p><p>Routing algorithms for wireless mesh networks differ from routing algorithms that are used in wired networks. In wired networks, the number of hops is usually the only metric that matters. Wireless networks, on the other hand, must consider the quality of different links, as it is possible for a path with a larger amount of hops to be better than a path with fewer hops.</p><p>Typical routing protocols for wireless mesh networks such as Optimized Link State Routing (OLSR) use a single path to send packets from source to destination. This path is precomputed based on link state information received through control packets. The consideration of more information than hop-count in the routing process has shown to be beneficial as for example link quality and physical layer data rate determines the quality of the end-to-end path. In multi-channel mesh networks, also channel switching overhead and channel diversity need to be considered as a routing metric. However, a major drawback of current approaches is that a path is precomputed and used as long as the path is available and shows a good enough metric. As a result, short term variations on link quality or channel switching are not considered.</p><p>In this thesis, a new routing protocol is designed that provides a set of alternative forwarding candidates for each destination. To minimize delay (from both transmission and channel switching), a forwarding mechanism is developed to select one of the available forwarding candidates for each packet. The implementation was tested on an ARM based multi-radio platform, of which the results show that in a simple evaluation scenario the average delay was reduced by 22 % when compared to single path routing.</p>
|
183 |
Accuracy and consistency in finite element ocean modelingWhite, Laurent 23 March 2007 (has links)
The intrinsic flexibility of unstructured meshes is compelling for numerical
ocean modeling. Complex topographic features, such as coastlines, islands
and narrow straits, can faithfully be represented by locally increasing the mesh
resolution and because there is no constraint on the mesh topology. In that respect,
the finite element method is particularly promising. Not only does it allow for naturally
handling unstructured meshes but it also offers additional flexibility in
the choice of interpolation and is sustained by a rich and rigorous mathematical
framework. This doctoral research was carried out under the auspices of the SLIM
(Second-generation Louvain-la-Neuve Ice-ocean Model) project, the objective of which is
to develop an ocean general circulation model using the finite element method.
This PhD dissertation deals with one-, two- and three-dimensional finite element ocean
modeling. We chiefly focus on the accurate representation of some selected oceanic processes
and we devote much effort toward using a consistent finite element method to solve
the underlying equations. We first concentrate on the finite element solution to a
one-dimensional benchmark for the propagation of Poincaré waves with particular emphasis
on the discontinuous Galerkin method and a physical justification for computing the
numerical fluxes. We then compare three finite element formulations
(vorticity - streamfunction, velocity - pressure and free-surface) for the solution
to geophysical fluid flow instabilities problems. The prominent -- and remaining -- part of this work
deals with three-dimensional ocean modeling on moving meshes. It covers the selection
of the right elements for
the vertical velocity and tracers through achieving strict tracer conservation
and local consistency between the elevation, continuity and tracer equations.
The ensuing three-dimensional model is successfully validated against a realistic tidal
flow around a shallow-water island. New physical insights are proposed as to the physical
processes encountered in such flows.
|
184 |
Using topological information in opportunistic network coding / by Magdalena Johanna (Leenta) GroblerGrobler, Magdalena Johanna January 2008 (has links)
Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2009.
|
185 |
Search Space Analysis and Efficient Channel Assignment Solutions for Multi-interface Multi-channel Wireless NetworksGonzález Barrameda, José Andrés 12 August 2011 (has links)
This thesis is concerned with the channel assignment (CA) problem in multi-channel
multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies,
we rigorously demonstrate using the combinatorial principle of inclusion/exclusion
that the CA solution space can be quantified, indicating that its cardinality is greatly
influenced by the number of radio interfaces installed on each router. Based on this analysis,
a novel scheme is developed to construct a new reduced search space, represented
by a lattice structure, that is searched more efficiently for a CA solution. The elements
in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings
of feasible CA solutions satisfying the radio constraints at each node. Two algorithms
are presented for searching the lattice structure. The first is a greedy algorithm that
finds a good SS in polynomial time, while the second provides a user-controlled depthfirst
search for the optimal SS. The obtained SS is used to construct an unconstrained
weighted graph coloring problem which is then solved to satisfy the soft interference
constraints.
For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution
can only be achieved with a certain number of channels; we denote this number as the
characteristic channel number and derive upper and lower bounds for that number as a
function of the number of radios per router. Furthermore, exact values for the required
channels for minimum interference are obtained when certain relations between the number
of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are
then employed to develop closed-form expressions for the minimum channel interference
that achieves the maximum throughput for uniform traffic on all communication links.
Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel
assignment problem in fM2WN is developed.
Experimental results confirm the obtained theoretical results and demonstrate the
performance of the proposed schemes.
|
186 |
Simulating a Pipelined Reconfigurable Mesh on a Linear Array with a Reconfigurable Pipelined Bus SystemGopalan, Mathura 12 January 2006 (has links)
Due to the unidirectional nature of propagation and predictable delays, optically pipelined buses have been gaining more attention. There have been many models proposed over time that use reconfigurable optically pipelined buses. The reconfigurable nature of the models makes them capable of changing their component’s functionalities and structure that connects the components at every step of computation. There are both one dimensional as well as k –dimensional models that have been proposed in the literature. Though equivalence between various one dimensional models and equivalence between different two dimensional models had been established, so far there has not been any attempt to explore the relationship between a one dimensional model and a two dimensional model. In the proposed research work it is shown that a move from one to two or more dimensions does not cause any increase in the volume of communication between the processors as they communicate in a pipelined manner on the same optical bus. When moving from two dimensions to one dimension, the challenge is to map the processors so that those belonging to a two-dimensional bus segment are contiguous and in the same order on the one-dimensional model. This does not increase any increase in communication overhead as the processors instead of communicating on two dimensional buses now communicate on a linear one dimensional bus structure. To explore the relationship between one dimensional and two dimensional models a commonly used model Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) and its two dimensional counterpart Pipelined Reconfigurable Mesh (PR-Mesh) are chosen Here an attempt has been made to present a simulation of a two dimensional PR-Mesh on a one dimensional LARPBS to establish complexity of the models with respect to one another, and to determine the efficiency with which the LARPBS can simulate the PR-Mesh.
|
187 |
An Adaptive Mesh MPI Framework for Iterative C++ ProgramsSilva, Karunamuni Charuka 23 March 2009 (has links)
Computational Science and Engineering (CSE) applications often exhibit the pattern of adaptive mesh applications. Adaptive mesh algorithm starts with a coarse base-level grid structure covering entire computational domain. As the computation intensified, individual grid points are tagged for refinement. Such tagged grid points are dynamically overlayed with finer grid points. Similarly if the level of refinement in a cell is greater than required, all such regions are replaced with coarser grids. These refinements proceed recursively. We have developed an object-oriented framework enabling time-stepped adaptive mesh application developers to convert their sequential applications to MPI applications in few easy steps. We present in this thesis our positive experience converting such application using our framework. In addition to the MPI support, framework does the grid expansion/contraction and load balancing making the application developer’s life easier.
|
188 |
Performance issues in cellular wireless mesh networksZhang, Dong 14 September 2010
This thesis proposes a potential solution for future ubiquitous broadband wireless access networks, called a cellular wireless mesh network (CMESH), and investigates a number of its performance issues. A CMESH is organized in multi-radio, multi-channel, multi-rate and multi-hop radio cells. It can operate on abundant high radio frequencies, such as 5-50 GHz, and thus may satisfy the bandwidth requirements of future ubiquitous wireless applications.<p>
Each CMESH cell has a single Internet-connected gateway and serves up to hundreds of mesh nodes within its coverage area. This thesis studies performance issues in a CMESH, focusing on cell capacity, expressed in terms of the max-min throughput. In addition to introducing the concept of a CMESH, this thesis makes the following contributions.<p>
The first contribution is a new method for analyzing theoretical cell capacity. This new method is based on a new concept called Channel Transport Capacity (CTC), and derives new analytic expressions for capacity bounds for carrier-sense-based CMESH cells.<p>
The second contribution is a new algorithm called the Maximum Channel Collision Time (MCCT) algorithm and an expression for the nominal capacity of CMESH cells. This thesis proves that the nominal cell capacity is achievable and is the exact cell capacity for small cells within the abstract models.<p>
Finally, based on the MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers.
|
189 |
The Efficacy of Source Rate Control in Achieving Fairness in Wireless Mesh NetworksLi, Lily Lei January 2007 (has links)
The use of 802.11-based wireless mesh networks (WMNs) as an alternative network backbone technology is growing rapidly. The primary advantages of this approach are
ease of deployment and lower cost. However, such networks typically exhibit poor fairness
properties, often starving nodes if they are too many hops distant from the gateway.
Researchers have shown a growing interest in this problem in recent years. Many solutions
proposed amount to some level of source rate control, either by policing directly
at the source, or via TCP congestion control reacting to a gateway-enforced rate limit.
However, there has been limited study on the effectiveness of source rate control.
In this thesis we first demonstrate that source rate control can only partially solve the fairness issue in 802.11-based WMNs, with some routers experiencing an undesirable
degree of unfairness, which we call structural unfairness. We then identify the four necessary factors that cause structural unfairness. If we can eliminate or reduce any one of these conditions, we can eliminate or ameliorate the unfairness problem. We first investigate two techniques to improve 802.11 MAC scheduling: fixing the contention window
and packet spacing at every router node, both means achievable with commodity 802.11
hardware. We show that the combination of these mechanisms provides a significant
gain in fairness. We also perform case studies using another three techniques, channel re-assignment, routing changes, and careful router placement, to remove or reduce other necessary conditions. We demonstrate that these techniques, whenever applicable, can eliminate the unfairness problem entirely at times, or at least improve the situation.
|
190 |
Search Space Analysis and Efficient Channel Assignment Solutions for Multi-interface Multi-channel Wireless NetworksGonzález Barrameda, José Andrés 12 August 2011 (has links)
This thesis is concerned with the channel assignment (CA) problem in multi-channel
multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies,
we rigorously demonstrate using the combinatorial principle of inclusion/exclusion
that the CA solution space can be quantified, indicating that its cardinality is greatly
influenced by the number of radio interfaces installed on each router. Based on this analysis,
a novel scheme is developed to construct a new reduced search space, represented
by a lattice structure, that is searched more efficiently for a CA solution. The elements
in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings
of feasible CA solutions satisfying the radio constraints at each node. Two algorithms
are presented for searching the lattice structure. The first is a greedy algorithm that
finds a good SS in polynomial time, while the second provides a user-controlled depthfirst
search for the optimal SS. The obtained SS is used to construct an unconstrained
weighted graph coloring problem which is then solved to satisfy the soft interference
constraints.
For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution
can only be achieved with a certain number of channels; we denote this number as the
characteristic channel number and derive upper and lower bounds for that number as a
function of the number of radios per router. Furthermore, exact values for the required
channels for minimum interference are obtained when certain relations between the number
of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are
then employed to develop closed-form expressions for the minimum channel interference
that achieves the maximum throughput for uniform traffic on all communication links.
Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel
assignment problem in fM2WN is developed.
Experimental results confirm the obtained theoretical results and demonstrate the
performance of the proposed schemes.
|
Page generated in 0.0459 seconds