Sciweavers

54 search results - page 10 / 11
» On the Expressiveness of Forwarding in Higher-Order Communic...
Sort
View
CN
2010
121views more  CN 2010»
13 years 3 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
IPSN
2004
Springer
14 years 12 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
SIGCOMM
2010
ACM
13 years 7 months ago
Theory and new primitives for safely connecting routing protocol instances
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise ne...
Franck Le, Geoffrey G. Xie, Hui Zhang
MOBIHOC
2007
ACM
14 years 6 months ago
Balancing traffic load in wireless networks with curveball routing
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
Lucian Popa 0002, Afshin Rostamizadeh, Richard M. ...
MOBIHOC
2006
ACM
14 years 6 months ago
Performance analysis of mobility-assisted routing
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...