Sciweavers

22 search results - page 2 / 5
» Route oracle: where have all the packets gone
Sort
View
INFOCOM
2007
IEEE
14 years 2 days ago
Oblivious Routing with Mobile Fusion Centers over a Sensor Network
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
Devavrat Shah, Sanjay Shakkottai
SIGCOMM
2004
ACM
13 years 11 months ago
Comparison of routing metrics for static multi-hop wireless networks
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
Richard Draves, Jitendra Padhye, Brian Zill
ENTCS
2007
190views more  ENTCS 2007»
13 years 5 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
SPAA
2003
ACM
13 years 11 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
ICDCS
2009
IEEE
13 years 3 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang