425 search results - page 24 / 85 » Path Coloring on the Mesh |
130
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper, we address the routing issue in a wireless mesh network, where each node is stationary and equipped with one or more radios. Specifically, we propose a new path ...
129
click to vote
IJAHUC
2011
14 years 8 months ago
2011
: This paper proposes a load and interference-aware routing metric for wireless mesh networks, named Channel Utilisation and Contention Window Based (C2WB) metric. Our metric assig...
121
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
134
click to vote
ICCCN
2007
IEEE
15 years 5 months ago
2007
IEEE
In 2003, interests in the Institute of Electronics and Electrical Engineering (IEEE) 802.11 Working Group (WG) led to the formation of Task Group (TG) "s". 802.11s develo...
112
Voted
DM
2008
15 years 1 months ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...