Sciweavers

867 search results - page 138 / 174
» Network Robustness and Graph Topology
Sort
View
WSNA
2003
ACM
14 years 28 days ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
ICNP
2005
IEEE
14 years 1 months ago
Landmark Guided Forwarding
In this paper we focus on the problems of maintaining Ad Hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The com...
Menghow Lim, Adam Chesterfield, Jon Crowcroft, Jul...
PODC
2005
ACM
14 years 1 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
ICNP
2005
IEEE
14 years 1 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov
ISBI
2011
IEEE
12 years 11 months ago
Structural connectivity via the tensor-based morphometry
The tensor-based morphometry (TBM) has been widely used in characterizing tissue volume difference between populations at voxel level. We present a novel computational framework f...
Seung-Goo Kim, Moo K. Chung, Jamie L. Hanson, Bria...