Sciweavers

528 search results - page 58 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
ATAL
2010
Springer
13 years 9 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
SAINT
2008
IEEE
14 years 2 months ago
Dynamic Relay Node Placement in Wireless Sensor Networks
In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the netwo...
Jorge Mena, Vana Kalogeraki
CCCG
2007
13 years 9 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
IPPS
2005
IEEE
14 years 1 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
DCOSS
2007
Springer
14 years 1 months ago
Mobile Anchor-Free Localization for Wireless Sensor Networks
Localization is a fundamental problem in wireless sensor networks. In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the...
Yurong Xu, Yi Ouyang, Zhengyi Le, James Ford, Fill...