INFOCOM
2010
IEEE
13 years 11 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
ALGOSENSORS
2010
Springer
13 years 11 months ago
2010
Springer
Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. In this paper we propose a distributed algorithm for single-hop networks that...
SIGMETRICS
1998
ACM
14 years 2 days ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
COMCOM
2004
14 years 8 days ago
2004
Although IP-multicast has been proposed and investigated for years, there are major problems inherent in the IP-multicasting technique, e.g., difficulty to scale up the system, di...
JPDC
2007
14 years 10 days ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
SIAMSC
2008
14 years 11 days ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
JSAC
2008
14 years 12 days ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
JCP
2008
14 years 12 days ago
2008
In this paper we propose a distributed algorithm for solving the positioning problem in ad-hoc wireless networks. The method is based on the capability of the nodes to measure the ...
ENTCS
2006
14 years 13 days ago
2006
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
MOBIDE
2010
ACM
14 years 19 days ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...