344 search results - page 32 / 69 » Maximal Group Membership in Ad Hoc Networks |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
PPL
2008
13 years 9 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
TON
2008
13 years 9 months ago
2008
Abstract--Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing para...
MSN
2007
Springer
14 years 3 months ago
2007
Springer
— The recent researches in wireless networks prompt the opportunistic transmission that exploiting channel fluctuations to improve the overall system performance. In wireless ad...
ISPAN
1999
IEEE
14 years 1 months ago
1999
IEEE
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...