Sciweavers

641 search results - page 29 / 129
» Improved Bounds for Wireless Localization
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
RSS-based node localization in the presence of attenuating objects
Node localization is an important task in the context of wireless sensor networks. Although algorithms already exist to carry out localization using measurements of received signa...
Andrea Edelstein, Xi Chen, Yunpeng Li, Michael Rab...
ICASSP
2009
IEEE
14 years 2 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...
CORR
2008
Springer
73views Education» more  CORR 2008»
13 years 7 months ago
Energy Benefit of Network Coding for Multiple Unicast in Wireless Networks
We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 f...
Jasper Goseling, Jos H. Weber
TCOM
2008
116views more  TCOM 2008»
13 years 7 months ago
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
Chintha Tellambura
ICPP
2008
IEEE
14 years 2 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu