Results 1  10
of
39
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 86 (15 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
Capacity of Wireless Networks under SINR Interference Constraints
, 2011
"... A fundamental problem in wireless networks is to estimate their throughput capacity given a set of wireless nodes and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused either on random distributions of p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of points, or has assumed simple graphbased models for wireless interference. In this paper, we study the capacity estimation problem using a realistic Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks without any assumptions on node distributions
Power Efficient and Sparse Spanner for Wireless Ad Hoc Networks
, 2001
"... Due to the limited resources available in the wireless ad hoc networking nodes, the scalability is crucial for network operations. One effective approach is to maintain only a sparse spanner of a linear number of links while still preseving the powerefficient route for any pair of nodes. For any sp ..."
Abstract

Cited by 82 (29 self)
 Add to MetaCart
. Notice that all of these graphs do not have constant degrees. We further propose another sparse spanner that has both constant degree and constant power stretch factor. An efficient local algorithm is presented for the construction of this spanner. Keywords Wireless ad hoc networks, topology control
A Simple YaoYaoBased Spanner of Bounded Degree
, 2008
"... It is a standing open question to decide whether the YaoYao structure for unit disk graphs (UDGs) is a length spanner of not. This question is highly relevant to the topology control problem for wireless ad hoc networks. In this paper we make progress towards resolving this question by showing that ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
It is a standing open question to decide whether the YaoYao structure for unit disk graphs (UDGs) is a length spanner of not. This question is highly relevant to the topology control problem for wireless ad hoc networks. In this paper we make progress towards resolving this question by showing
Faulttolerant spanners: Better and simpler
 In PODC
, 2011
"... A natural requirement for many distributed structures is faulttolerance: after some failures in the underlying network, whatever remains from the structure should still be effective for whatever remains from the network. In this paper we examine spanners of general graphs that are tolerant to verte ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
A natural requirement for many distributed structures is faulttolerance: after some failures in the underlying network, whatever remains from the structure should still be effective for whatever remains from the network. In this paper we examine spanners of general graphs that are tolerant
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2003
"... Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RNG) or Gabriel graph (GG) is used as such planar structure. However, it is wellknown that the spanning ratios of these two grap ..."
Abstract

Cited by 86 (18 self)
 Add to MetaCart
the maximum transmission range. In this paper, we present a novel localized networking protocol that constructs a planar 2.5spanner of UDG, called the localized Delaunay triangulation (LDEL), as network topology. It contains all edges that are both in the unitdisk graph and the Delaunay triangulation of all
Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
"... Abstract. We study the minimum spanning tree (MST) construction problem in wireless networks under the physical interference model based on SINR constraints. We develop the first distributed (randomized) O(µ)approximation algorithm for MST, with the running time of O(Dlogn) (with high probability) ..."
Abstract
 Add to MetaCart
Abstract. We study the minimum spanning tree (MST) construction problem in wireless networks under the physical interference model based on SINR constraints. We develop the first distributed (randomized) O(µ)approximation algorithm for MST, with the running time of O(Dlogn) (with high probability
Distributed Maintenance of Resource Efficient Wireless Network Topologies (Extended Abstract)
 IN EUROPAR’02
"... Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remains. However if the routes are restricted to a basic network based on local neighborhoods, these interferences can be reduced such that standard r ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
routing algorithms can be applied. We compare different network topologies for these basic networks with respect to degree, spannerproperties, radio interferences, energy, and congestion, i.e. the Yaograph (aka.graph) and some also known related models, which will be called the SymmYgraph (aka. YSgraph
Topology Control in Heterogeneous Wireless Adhoc Networks
"... Both papers [1] & [2] deal with localized topology control in heterogeneous wireless adhoc networks and prove some properties such as connectivity or bounded outdegree of the presented structures. The first paper [1] is based on general graphs. It proposes two structures; the Directed Relative ..."
Abstract
 Add to MetaCart
Both papers [1] & [2] deal with localized topology control in heterogeneous wireless adhoc networks and prove some properties such as connectivity or bounded outdegree of the presented structures. The first paper [1] is based on general graphs. It proposes two structures; the Directed
Resource Efficient Maintenance of Wireless Network Topologies
, 2006
"... Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if the routes are restricted to a basic network based on local neighborhoods, these interferences can be reduced such that standard r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
routing algorithms can be applied. We compare different network topologies for these basic networks, i.e. the Yaograph (aka. Θgraph) and some also known related models, which will be called the SymmYgraph (aka. YSgraph), the SparsYgraph (aka. YYgraph) and the BoundYgraph. Further, we present a
Results 1  10
of
39