104 search results - page 4 / 21 » On ant routing algorithms in ad hoc networks with critical c... |
DICS
2006
13 years 11 months ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
TMC
2008
13 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
TON
2008
13 years 7 months ago
2008
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
PDPTA
2004
13 years 8 months ago
2004
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...