68 search results - page 2 / 14 » Lower Bounds for Noisy Wireless Networks using Sampling Algo... |
ICASSP
2009
IEEE
14 years 19 hour ago
2009
IEEE
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...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
CORR
2011
Springer
13 years 8 days ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...