Abstract. A strategic placement of mesh points (MPs) in a Wireless Mesh Network (WMN) is essential to maximize the throughput of the network. In this paper, we address the problem of MPs placement for throughput optimization in WMN with consideration of routing protocols. Specifically, we formulate the routing paths among the MPs and mesh routers (MRs), calculate the aggregated traffic at the M...

This paper presents an adaptive mesh redistribution (AMR) method for solving the nonlinear Hamilton-Jacobi equations and level set equations in twoand threedimensions. Our approach includes two key ingredients: a non-conservative secondorder interpolation on the updated adaptive grids, and a class of monitor functions (or indicators) suitable for the Hamilton-Jacobi problems. The proposed adapt...

Standard software based on the collocation method for differential equations, delivers a continuous approximation (called the collocation solution) which augments the high order discrete approximate solution that is provided at mesh points. This continuous approximation is less accurate than the discrete approximation. For ’non-standard’ Volterra integro-differential equations with constant del...

In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing full coverage to wireless mesh clients. Our mixed integer linear programming models allow to select the number and positions of mesh routers and access points, while accurately taking into account traffic routing, inter...

A new stable continuous-in-time semi-discrete parametric finite element method for Willmore flow is introduced. The approach allows for spontaneous curvature and area difference elasticity (ADE) effects, which are important for many applications, in particular, in the context of membranes. The method extends ideas from Dziuk and the present authors to obtain an approximation that allows for a t...

The throughput maximization problem of wireless mesh access networks is addressed. For the case ot cooperative access points, we present a negotiation-based throughput maximization algorithm which adjusts the operating frequency and power level among access points autonomously, trom a gametheoretical perspective. We show that this algorithm converges to the optimal frequency and power assignmen...

In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision mesh directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface. This mesh representation has several benefits — compact mesh size, piecewise regular connectivity — to overcome l...

Abstract In this paper, we give upper and lower bounds on the number of Steiner points required to onstru t a stri tly onvex quadrilateral mesh for a planar point set. In parti ular, we show that 3⌊ 2 ⌋ internal Steiner points are always suÆ ient for a onvex quadrilateral mesh of n points in the plane. Furthermore, for any given n ≥ 4, there are point sets for whi h ⌈ 2 ⌉ − 1 Steiner points are...