Sciweavers

1368 search results - page 75 / 274
» Perfect Local Computability and Computable Simulations
Sort
View
TC
2008
14 years 11 months ago
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
Jie Wu, Fei Dai, Shuhui Yang
INFOCOM
2011
IEEE
14 years 2 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta
ADHOC
2006
113views more  ADHOC 2006»
14 years 11 months ago
Positioning using local maps
ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new ...
Yi Shang, Wheeler Ruml, Markus P. J. Fromherz
MOBICOM
2006
ACM
15 years 5 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...
TWC
2008
155views more  TWC 2008»
14 years 11 months ago
Distributed sensor network localization using SOCP relaxation
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...
Seshan Srirangarajan, Ahmed H. Tewfik, Zhi-Quan Lu...