Results 1  10
of
129
Mesh Generation And Optimal Triangulation
, 1992
"... We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some cri ..."
Abstract

Cited by 180 (7 self)
 Add to MetaCart
We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators.
Analysis of a conebased distributed topology control algorithm for wireless multihop networks
 In ACM Symposium on Principle of Distributed Computing (PODC
, 2001
"... bahl~microsoft, corn ymwang~microsoft, corn rogerwa~microsoft, corn The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a conebased distributed topology control algorithm. This algorithm, intr ..."
Abstract

Cited by 139 (9 self)
 Add to MetaCart
bahl~microsoft, corn ymwang~microsoft, corn rogerwa~microsoft, corn The topology of a wireless multihop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a conebased distributed topology control algorithm. This algorithm, introduced in [16], does not assume that nodes have GPS information available; rather it depends only on directional information. Roughly speaking, the basic idea of the algorithm is that a node u transmits with the minimum power P~,,a required to ensure that in every cone of degree a around u, there is some node that u can reach with power Pma We show that taking a = 57r/6 is a necessary and sufficient condition to guarantee that network connectivity is preserved. More precisely, if there is a path from a to t when every node communicates at maximum power then, if a < _ 5~r/6, there is still a path in the smallest symmetric graph Ga containing all edges (u, v) such that u can communicate with v using power p~,a. On the other hand, if ~> 51r/6, connectivity is not necessarily preserved. We also propose a set of optimizations that further reduce power consumption and prove that they retain network connectivity. Dynamic reconfiguration in the presence of failures and mobility is also discussed. Simulation results are presented to demonstrate the effectiveness of the algorithm and the optimizations. 1.
Coverage in Wireless Adhoc Sensor Networks
, 2002
"... Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking [1]. One of the fundamental problems in sensor networks is the calculation of the coverage. In [1], it is assumed that the sensor has the uniform sensing ability. In this pape ..."
Abstract

Cited by 119 (9 self)
 Add to MetaCart
Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking [1]. One of the fundamental problems in sensor networks is the calculation of the coverage. In [1], it is assumed that the sensor has the uniform sensing ability. In this paper, we give efficient distributed algorithms to optimally solve the bestcoverage problem raised in [1]. Here, we consider the sensing model: the sensing ability diminishes as the distance increases. As energy conservation is a major concern in wireless (or sensor) networks, we also consider how to find an optimum bestcoverage path with the least energy consumption. We also consider how to find an optimum bestcoveragepath that travels a small distance. In addition, we justify the correctness of the method proposed in [1] that uses the Delaunay triangulation to solve the best coverage problem. Moreover, we show that the search space of the best coverage problem can be confined to the relative neighborhood graph, which can be constructed locally.
Distributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks
, 2002
"... Several localized routing protocols [1] guarantee the delivery of the packets when the underlying network topology is the Delaunay triangulation of all wireless nodes. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we more acc ..."
Abstract

Cited by 114 (21 self)
 Add to MetaCart
Several localized routing protocols [1] guarantee the delivery of the packets when the underlying network topology is the Delaunay triangulation of all wireless nodes. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we more accurately model the network as a unitdisk graph UDG , in which a link in between two nodes exist only if the distance in between them is at most the maximum transmission range.
Online Routing in Triangulations
 IN PROC. OF THE 10 TH ANNUAL INT. SYMP. ON ALGORITHMS AND COMPUTATION ISAAC
, 1999
"... We consider online routing strategies for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing strategies, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a ..."
Abstract

Cited by 109 (12 self)
 Add to MetaCart
We consider online routing strategies for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing strategies, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless strategy that works for all triangulations, (3) an O(1) memory strategy that works for all convex subdivisions, (4) an O(1) memory strategy that approximates the shortest path in Delaunay triangulations, and (5) theoretical and experimental results on the competitiveness of these strategies.
New Sparseness Results on Graph Spanners
, 1992
"... Let G = (V, E) be an nvertex connected graph with positive edge weights. A subgraph G ’ = (V, E’) is a tspanner of G if for all u, v E V, the weighted distance between u and v in G ’ is at most t times the weighted distance between u and v in G. We consider the problem of constructing sparse span ..."
Abstract

Cited by 80 (8 self)
 Add to MetaCart
Let G = (V, E) be an nvertex connected graph with positive edge weights. A subgraph G ’ = (V, E’) is a tspanner of G if for all u, v E V, the weighted distance between u and v in G ’ is at most t times the weighted distance between u and v in G. We consider the problem of constructing sparse spanners. Sparseness of spanners is measured by two criteria, the size, defined as the number of edges in the spanner, and the weight, defined as the sum of the edge weights in the spanner. In this paper, we concentrate on constructing spanners of small weight. For an arbitrary positive edgeweighted graph G, for any t> 1, and any c>0, we show that a tspanner of G with weight O(n * ). wt(MST) can be constructed in polynomial time. We also show that (logz n)spanners of weight O(1). wt(MST) can be constructed. We then consider spanners for complete graphs induced by a set of points in ddimensional real normed space. The weight of an edge Zy is the norm of the ~y vector. We show that for these graphs, tspanners with total weight O(log n). wt(MST) can be constructed in polynomial time.
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
 In DIALMPOMC
, 2003
"... We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to know its 2hop neighbors to find the edges in this new structure. Our method applies the Yao structure on the local Delauna ..."
Abstract

Cited by 72 (8 self)
 Add to MetaCart
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to know its 2hop neighbors to find the edges in this new structure. Our method applies the Yao structure on the local Delaunay graph [21] in an ordering that are computed locally. This new structure has the following attractive properties: (1) it is a planar graph; (2) its node degree is bounded from above by a positive constant 19 + ⌈ 2π α ⌉; (3) it is a tspanner (given any two nodes u and v, there is a path connecting them in the structure such that its length is no more than t ≤ max { π α,πsin 2 2 +1}·Cdel times of the shortest path in UDG); (4) it can be constructed locally and is easy to maintain when the nodes move around; (5) moreover, we show that the total communication cost is O(n), where n is the number of wireless nodes, and the computation cost of each node is at most O(d log d), where d is its 2hop neighbors in the original unit disk graph. Here Cdel is the spanning ratio of the Delaunay triangulation, which is at most 4 √ 3 9 π. And the adjustable parameter α satisfies 0 <α<π/3. In addition, experiments are conducted to show this topology is efficient in practice, compared with other wellknown topologies used in wireless ad hoc networks. Previously, only centralized method [5] of constructing bounded degree planar spanner is known, with degree bound 27 and spanning ratio t ≃ 10.02. The distributed implementation of their centralized method takes O(n 2) communications in the worst case. No localized methods were known previously for constructing bounded degree planar spanner.
Geometric Spanners for Wireless Ad Hoc Networks
 IEEE Transactions on Parallel and Distributed Systems
, 2003
"... We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network. ..."
Abstract

Cited by 67 (16 self)
 Add to MetaCart
We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network.
ClosestPoint Problems in Computational Geometry
, 1997
"... This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem, th ..."
Abstract

Cited by 65 (14 self)
 Add to MetaCart
This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem, the exact and approximate postoffice problem, and the problem of constructing spanners are discussed in detail. Contents 1 Introduction 1 2 The static closest pair problem 4 2.1 Preliminary remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Algorithms that are optimal in the algebraic computation tree model . 5 2.2.1 An algorithm based on the Voronoi diagram . . . . . . . . . . . 5 2.2.2 A divideandconquer algorithm . . . . . . . . . . . . . . . . . . 5 2.2.3 A plane sweep algorithm . . . . . . . . . . . . . . . . . . . . . . 6 2.3 A deterministic algorithm that uses indirect addressing . . . . . . . . . 7 2.3.1 The degraded grid . . . . . . . . . . . . . . . . . . ...
Faulttolerant and 3Dimensional Distributed Topology Control Algorithms in Wireless Multihop Networks
 in Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (ICCCN
, 2002
"... We can control the topology of a multihop wireless network by varying the transmission power at each node. The lifetime of such networks depends on battery power at each node. This paper presents a distributed faulttolerant topology control algorithm for minimum energy consumption in these net ..."
Abstract

Cited by 60 (9 self)
 Add to MetaCart
We can control the topology of a multihop wireless network by varying the transmission power at each node. The lifetime of such networks depends on battery power at each node. This paper presents a distributed faulttolerant topology control algorithm for minimum energy consumption in these networks. More precisely, we present algorithms which preserve the connectivity of a network upon failing of, at most, k nodes (k is constant) and simultaneously minimize the transmission power at each node to some extent. In addition, we present simulations to support the effectiveness of our algorithm. We also demonstrate some optimizations to further minimize the power at each node. Finally, we show how our algorithms can be extended to 3dimensions.