Sciweavers

169 search results - page 29 / 34
» Application of computational geometry to network p-center lo...
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
Ruben Stranders, Alessandro Farinelli, Alex Rogers...
EMNETS
2007
15 years 1 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son
89
Voted
ICDCS
2010
IEEE
14 years 11 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
TWC
2008
140views more  TWC 2008»
14 years 9 months ago
Exclusive-Region Based Scheduling Algorithms for UWB WPAN
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
Kuang-Hao Liu, Lin Cai, Xuemin Shen
SPAA
2004
ACM
15 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter