Sciweavers

13214 search results - page 108 / 2643
» Pseudorandomness for network algorithms
Sort
View
SPAA
2003
ACM
15 years 11 months ago
Analysis of link reversal routing algorithms for mobile ad hoc networks
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
Costas Busch, Srikanth Surapaneni, Srikanta Tirtha...
MOBICOM
2004
ACM
15 years 12 months ago
FLSS: a fault-tolerant topology control algorithm for wireless networks
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more su...
Ning Li, Jennifer C. Hou
ADHOC
2008
183views more  ADHOC 2008»
15 years 6 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
IJAR
2007
130views more  IJAR 2007»
15 years 6 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
JPDC
2007
112views more  JPDC 2007»
15 years 6 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002