Sciweavers

6413 search results - page 46 / 1283
» Classes of cycle bases
Sort
View
IPPS
2007
IEEE
16 years 7 days ago
Topology-Transparent Duty Cycling for Wireless Sensor Networks
Our goal is to save energy in wireless sensor networks (WSNs) by periodic duty-cycling of sensor nodes. We schedule sensor nodes between active (transmit or receive) and sleep mod...
Yu Chen, Eric Fleury, Violet R. Syrotiuk
ADHOCNETS
2010
Springer
15 years 2 months ago
DCLA: A Duty-Cycle Learning Algorithm for IEEE 802.15.4 Beacon-Enabled WSNs
The current specification for IEEE 802.15.4 beacon-enabled networks does not define how active and sleep schedules should be configured in order to achieve the optimal network perf...
Rodolfo de Paz Alberola, Dirk Pesch
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
ISCAS
2005
IEEE
157views Hardware» more  ISCAS 2005»
15 years 11 months ago
High-efficiency power amplifier for wireless sensor networks
Abstract— We designed a high-efficiency class-E switchedmode power amplifier for a wireless networked micro-sensors system. In this system, where each sensor operates using a mic...
Devrim Yilmaz Aksin, Stefano Gregori, Franco Malob...
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 5 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...