1734 search results - page 13 / 347 » MSDR-D Network Localization Algorithm |
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
DIALM
2004
ACM
14 years 1 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
JMLR
2010
13 years 2 months ago
2010
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...