1783 search results - page 223 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
142
Voted
ICDCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
131
click to vote
DIALM
2004
ACM
15 years 8 months ago
2004
ACM
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
153
click to vote
JSAC
2007
15 years 3 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
127
click to vote
MOBICOM
2004
ACM
15 years 8 months ago
2004
ACM
Wireless IEEE 802.11 networks in residences, small businesses, and public “hot spots” typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest ...
121
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...