Sciweavers

2149 search results - page 191 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
CCCG
2007
15 years 3 months ago
Terminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
Zhiyong Lin
ICDE
2007
IEEE
92views Database» more  ICDE 2007»
15 years 8 months ago
A Cost Model for Storing and Retrieving Data in Wireless Sensor Networks
Many applications require storing data in Wireless Sensor Networks (WSNs). For example, in environmental monitoring applications, WSN may archive sensor data for retrieval at peri...
Adesola Omotayo, Moustafa A. Hammad, Ken Barker
PERCOM
2007
ACM
16 years 1 months ago
Supporting Pluggable Configuration Algorithms in PCOM
Pervasive Computing envisions distributed applications that optimally leverage the resources present in their ever-changing execution environment. To ease the development of perva...
Marcus Handte, Klaus Herrmann, Gregor Schiele, Chr...
MONET
2006
103views more  MONET 2006»
15 years 1 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 6 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman