1783 search results - page 14 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
84
Voted
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
NSDI
2010
15 years 1 months ago
2010
Existing flooding algorithms have demonstrated their effectiveness in achieving communication efficiency and reliability in wireless sensor networks. However, further performance ...
123
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
101
click to vote
TON
2008
14 years 11 months ago
2008
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...