638 search results - page 63 / 128 » Ergodic stochastic optimization algorithms for wireless comm... |
MOBICOM
2003
ACM
14 years 1 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
DMSN
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical mo...
MOBIHOC
2004
ACM
14 years 1 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...