Sciweavers

528 search results - page 33 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
SUTC
2006
IEEE
14 years 1 months ago
Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data...
Kun-Feng Lin, Chuan-Ming Liu
MOBIHOC
2007
ACM
14 years 7 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
IPSN
2009
Springer
14 years 2 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
EWSN
2004
Springer
14 years 1 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
CN
2010
183views more  CN 2010»
13 years 7 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi