Sciweavers

114 search results - page 7 / 23
» Approximation Algorithms for Unit Disk Graphs
Sort
View
ADHOCNOW
2008
Springer
14 years 2 months ago
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
David Peleg, Liam Roditty
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
14 years 5 days ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
APWEB
2006
Springer
13 years 11 months ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
IMCSIT
2010
13 years 6 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski