Sciweavers

1594 search results - page 69 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
AINA
2010
IEEE
15 years 8 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
CONEXT
2006
ACM
15 years 9 months ago
Detail characterization of paths in pocket switched networks
Pocket Switched Networking (PSN) is a new communication paradigm between mobile devices. It takes advantage of every local communication opportunity, and the physical mobility of ...
Abderrahmen Mtibaa, Augustin Chaintreau, Christoph...
NETWORKS
2011
14 years 10 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
122
Voted
CONCUR
2003
Springer
15 years 8 months ago
Model Checking a Path
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
Nicolas Markey, Ph. Schnoebelen
117
Voted
SIGCOMM
2009
ACM
15 years 9 months ago
PathForge: faithful anonymization of movement data
For most mobile networks, providers need the current position of their users to provide efficient service. The resulting motion data is not only an invaluable source for analyzing...
Sebastian Kay Belle, Marcel Waldvogel, Oliver Haas...