Sciweavers

2001 search results - page 43 / 401
» Local solutions for global problems in wireless networks
Sort
View
TSP
2010
13 years 3 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
IPCCC
2007
IEEE
14 years 3 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
13 years 3 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
MASCOTS
2008
13 years 10 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park
TPDS
2008
167views more  TPDS 2008»
13 years 8 months ago
Algorithms for Fault-Tolerant Topology in Heterogeneous Wireless Sensor Networks
This paper addresses fault-tolerant topology control in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, used for data relaying, and a large...
Mihaela Cardei, Shuhui Yang, Jie Wu