3247 search results - page 311 / 650 » Randomized smoothing networks |
181
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
299
click to vote
CLUSTER
2011
IEEE
14 years 6 months ago
2011
IEEE
In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the wireless mobile ad‐hoc networks (MANET) consider...
171
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
177
click to vote
EWSN
2006
Springer
16 years 5 months ago
2006
Springer
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about....
174
click to vote
MOBIHOC
2003
ACM
16 years 5 months ago
2003
ACM
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity o...