Results 1  10
of
162,581
Broadcasting algorithms in radio networks with unknown topology
 In Proc. of FOCS
, 2003
"... In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed nnode radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal wor ..."
Abstract

Cited by 123 (1 self)
 Add to MetaCart
In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed nnode radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal
Broadcasting in UDG radio networks with unknown topology
, 2009
"... The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to al ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message
Distributed Broadcast in Wireless Networks with Unknown Topology ∗
, 2001
"... A multihop synchronous wirelss network is said to be unknown if the nodes have no knowledge of the topology. A basic task in wireless network is that of broadcasting a message (created by a fixed source node) to all nodes of the network. Typical operations in reallife wireless networks is the mult ..."
Abstract
 Add to MetaCart
A multihop synchronous wirelss network is said to be unknown if the nodes have no knowledge of the topology. A basic task in wireless network is that of broadcasting a message (created by a fixed source node) to all nodes of the network. Typical operations in reallife wireless networks
A Novel Modeling Algorithm for Shape Recovery of Unknown Topology
"... This paper presents a novel modeling algorithm that is capable of simultaneously recovering correct shape geometry as well as its unknown topology from arbitrarily complicated datasets. Our algorithm starts from a simple seed model (of genus zero) that can be arbitrarily initiated by users within an ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
This paper presents a novel modeling algorithm that is capable of simultaneously recovering correct shape geometry as well as its unknown topology from arbitrarily complicated datasets. Our algorithm starts from a simple seed model (of genus zero) that can be arbitrarily initiated by users within
Predicting Transmembrane Protein Topology with a Hidden Markov Model: Application to Complete Genomes
 J. MOL. BIOL
, 2001
"... ..."
Robust Recovery of Shapes with Unknown Topology from the Dual Space
"... In this paper, we address the problem of reconstructing object surface from silhouettes. Previous works by other authors have shown that, based on the principle of duality, surface points can be recovered, theoretically, as the dual to the tangent plane space of the object. In practice, however, the ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
defined local tangent basis. This extends the applicability of existing dual space reconstruction methods to handle fairly complicated shape without making any explicit assumption on the object topology. We verify our approach with both synthetic and realworld data, and compare it both qualitatively
Surface reconstruction from unorganized points
 COMPUTER GRAPHICS (SIGGRAPH ’92 PROCEEDINGS)
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be know ..."
Abstract

Cited by 811 (8 self)
 Add to MetaCart
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed
Lower Bounds on Broadcasting Time in UDG Radio Networks with Unknown Topology
"... The paper considers broadcasting in radio networks, modeled as unit disk graphs (UDG). Network stations are modeled as points in the plane, where a station is connected to all stations at Euclidean distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a statio ..."
Abstract
 Add to MetaCart
station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting
Distributed Broadcast Scheduling in Mobile Ad Hoc Networks with Unknown Topologies
"... Broadcasting is a fundamental communication task in mobile ad hoc networks, and minimizing broadcasting time (or latency) is crucial to the performance of many applications. Extensive studies have been conducted on the minimization of broadcasting time in the context of radio networks, which are usu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Broadcasting is a fundamental communication task in mobile ad hoc networks, and minimizing broadcasting time (or latency) is crucial to the performance of many applications. Extensive studies have been conducted on the minimization of broadcasting time in the context of radio networks, which are usually modeled as general graphs. In this paper, we consider how to achieve this goal with distributed algorithms based on a more realistic (and restricted) network model. We propose a randomized algorithm that completes broadcasting in time, where is the number of nodes in the network and the eccentricity (maximum distance from the source node to any other node). Compared with a previous optimal algorithm that achieves the same result for general networks, our algorithm obviates the need to know the network eccentricity beforehand. We also propose a deterministic broadcasting algorithm that works in time, which is in contrast with the best known result of for general networks. 1
Results 1  10
of
162,581