Sciweavers

641 search results - page 4 / 129
» Improved Bounds for Wireless Localization
Sort
View
DCOSS
2009
Springer
14 years 7 days ago
Local Construction of Spanners in the 3-D Space
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
COMPGEOM
2004
ACM
14 years 1 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
JCM
2006
144views more  JCM 2006»
13 years 7 months ago
Using Micro-Genetic Algorithms to Improve Localization in Wireless Sensor Networks
Wireless sensor networks are widely adopted in many location-sensitive applications including disaster management, environmental monitoring, military applications where the precise...
Vincent Tam, King-Yip Cheng, King-Shan Lui
DSD
2006
IEEE
114views Hardware» more  DSD 2006»
14 years 1 months ago
Improved Precision of Coarse Grained Localization in Wireless Sensor Networks
In wireless sensor networks, the coarse grained localization is a method to compute the position of randomly distributed sensor nodes. Without optimizations, it provides low preci...
Frank Reichenbach, Jan Blumenthal, Dirk Timmermann
ICNP
1998
IEEE
13 years 12 months ago
Improving Wireless LAN Performance via Adaptive Local Error Control
Wireless links can exhibit high error rates due to attenuation, fading, or interfering active radiation sources. To make matters worse, error rates can be highly variable due to c...
David A. Eckhardt, Peter Steenkiste