26 search results - page 3 / 6 » Distributed Node Coloring in the SINR Model |
INFOCOM
2009
IEEE
14 years 12 days ago
2009
IEEE
—We propose an interference-aware MAC protocol using a simple transmission strategy motivated by a gametheoretic approach. We formulate a channel access game, which considers nod...
FSTTCS
2004
Springer
13 years 11 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...
INFOCOM
2009
IEEE
14 years 12 days ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
CSJM
2006
13 years 5 months ago
2006
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
PODC
2009
ACM
14 years 6 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...