2732 search results - page 9 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
In this work, we analyze the effects of a distributed transmission coordination scheme that is particularly suited for ad hoc networks with the ability to exploit spatially–mult...
104
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
82
Voted
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
JPDC
2006
14 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...