Sciweavers

2498 search results - page 204 / 500
» Algorithms for the Topological Watershed
Sort
View
CCR
1998
96views more  CCR 1998»
15 years 6 months ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
COMPUTER
1999
82views more  COMPUTER 1999»
15 years 6 months ago
Mapping the Internet
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
Hal Burch, Bill Cheswick
TC
1998
15 years 6 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro
GLOBECOM
2010
IEEE
15 years 4 months ago
Compact Wakeup Scheduling in Wireless Sensor Networks
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
Junchao Ma, Wei Lou
ECRTS
2007
IEEE
16 years 28 days ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher