2149 search results - page 11 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
107
click to vote
ICMCS
2005
IEEE
15 years 5 months ago
2005
IEEE
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
122
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...
95
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
98
Voted
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—This paper presents a novel study on how to distribute neural networks in a wireless sensor networks (WSNs) such that the energy consumption is minimized while improving...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...