Sciweavers

98 search results - page 9 / 20
» An efficient heuristic for selecting active nodes in wireles...
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
DCOSS
2008
Springer
13 years 9 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
JCM
2006
129views more  JCM 2006»
13 years 7 months ago
T-ANT: A Nature-Inspired Data Gathering Protocol for Wireless Sensor Networks
There are many difficult challenges ahead in the design of an energy-efficient communication stack for wireless sensor networks. Due to the severe sensor node constraints, protocol...
S. Selvakennedy, Sukunesan Sinnappan, Yi Shang
WINET
2010
185views more  WINET 2010»
13 years 6 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
PERCOM
2006
ACM
14 years 7 months ago
Localized Sensor Area Coverage with Low Communication Overhead
We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors...
Antoine Gallais, Jean Carle, David Simplot-Ryl, Iv...