2732 search results - page 455 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
167
click to vote
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
145
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
210
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
Recent studies on mobility modeling have focused on characterizing user mobility from real traces of wireless LANs (WLANs) and creating mobility models based on such characterizat...
168
click to vote
TWC
2008
15 years 6 months ago
2008
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
198
click to vote
PERCOM
2005
ACM
16 years 5 months ago
2005
ACM
In pervasive computing environments, mobile devices communicate via wireless links without requiring any fixed infrastructure. These devices must be able to discover and share ser...