Sciweavers

714 search results - page 136 / 143
» Time and energy complexity of distributed computation in wir...
Sort
View
PODC
2010
ACM
13 years 11 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
WCNC
2008
IEEE
14 years 1 months ago
Adaptive Routing in Dynamic Ad Hoc Networks
Abstract—Dynamic ad hoc networks are mobile ad hoc networks (MANETs) where network characteristics, such as network density and node mobility, change significantly over time and...
Cong Liu, Jie Wu
TON
2008
107views more  TON 2008»
13 years 7 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
SIROCCO
2010
13 years 9 months ago
Event Extent Estimation
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...
Marcin Bienkowski, Leszek Gasieniec, Marek Klonows...
EWSN
2007
Springer
14 years 7 months ago
Removing Systematic Error in Node Localisation Using Scalable Data Fusion
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
Albert Krohn, Mike Hazas, Michael Beigl