374 search results - page 53 / 75 » On Communicating Automata with Bounded Channels |
146
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
214
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
166
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
173
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
176
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...