Sciweavers

3498 search results - page 655 / 700
» Low-Power Wireless Sensor Networks
Sort
View
ALGOSENSORS
2004
Springer
14 years 2 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak
PEWASUN
2004
ACM
14 years 2 months ago
A routing protocol for power constrained networks with asymmetric links
In many instances, an ad hoc network consists of nodes with different hardware and software capabilities as well as power limitations. This is the case of ad hoc grids where devi...
Guoqiang Wang, Yongchang Ji, Dan C. Marinescu, Dam...
OTM
2004
Springer
14 years 2 months ago
Towards a Peer-to-Peer Event Broker Grid in a Hybrid Network Environment
Peer-to-peer networks and grids offer promising paradigms for developing efficient distributed systems and applications. Event-based middleware is becoming a core architectural el...
Eiko Yoneki, Jean Bacon
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 9 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
EWSN
2009
Springer
14 years 9 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...