Sciweavers

316 search results - page 33 / 64
» Bounded Depth Data Trees
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
A TDMA-based Scheduling and Routing Algorithm for Data-Centric Wireless Sensor Networks
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
Yean-Fu Wen, Frank Yeong-Sung Lin, Hung-Shi Wang
VTC
2006
IEEE
228views Communications» more  VTC 2006»
14 years 3 months ago
Aggregation Time Control Algorithm for Time constrained Data Delivery in Wireless Sensor Networks
Abstract— This paper proposes and evaluates a new aggregation algorithm in wireless sensor networks with time constraint. In the proposed algorithm, each aggregation node control...
Jae Young Choi, Jongwook Lee, Kamrok Lee, Sunghyun...
ICALP
2000
Springer
14 years 21 days ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
FC
2010
Springer
230views Cryptology» more  FC 2010»
14 years 1 months ago
Multiple Denominations in E-cash with Compact Transaction Data
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
Sébastien Canard, Aline Gouget
COMCOM
2006
100views more  COMCOM 2006»
13 years 9 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang