Sciweavers

4004 search results - page 80 / 801
» How Many Packets Can We Encode
Sort
View
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
15 years 2 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
151
Voted
IPSN
2009
Springer
15 years 9 months ago
Predictive QoS routing to mobile sinks in wireless sensor networks
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
Branislav Kusy, HyungJune Lee, Martin Wicke, Nikol...
PODC
2010
ACM
15 years 6 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
143
Voted
COLCOM
2008
IEEE
15 years 9 months ago
Security through Collaboration in MANETs
It is well understood that Mobile Ad Hoc Networks (MANETs) are extremely susceptible to a variety of attacks, and traditional security mechanisms do not work well. Many security sc...
Wenjia Li, James Parker, Anupam Joshi
INFOCOM
2007
IEEE
15 years 8 months ago
A Framework for Multi-Objective SLA Compliance Monitoring
Abstract— Service level agreements (SLAs) specify performance guarantees made by service providers, typically in terms of packet loss, delay, delay variation, and network availab...
Joel Sommers, Paul Barford, Nick G. Duffield, Amos...