Sciweavers

528 search results - page 22 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 1 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
BSN
2009
IEEE
136views Sensor Networks» more  BSN 2009»
14 years 2 months ago
Comparison of Orientation Filter Algorithms for Realtime Wireless Inertial Posture Tracking
—Advances in the miniaturisation of inertial sensors have allowed the design of compact wireless inertial orientation trackers. Such devices require data fusion algorithms to pro...
A. D. Young
WINET
2008
86views more  WINET 2008»
13 years 7 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
INFOCOM
2008
IEEE
14 years 2 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...