Sciweavers

469 search results - page 11 / 94
» Bounds on the Network Coding Capacity for Wireless Random Ne...
Sort
View
INFOCOM
2008
IEEE
15 years 10 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
145
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
Synchronization-Aware Distributed Space-Time Codes in Wireless Relay Networks
— In this paper, we consider the design of synchronization-aware distributed space-time codes, which we denote as diagonal distributed space-time codes (DDSTC), for N relay nodes...
Karim G. Seddik, Ahmed K. Sadek, Ahmed S. Ibrahim,...
ICC
2008
IEEE
142views Communications» more  ICC 2008»
15 years 10 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
TON
2002
189views more  TON 2002»
15 years 3 months ago
Mobility increases the capacity of ad hoc wireless networks
Abstract--The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where ...
Matthias Grossglauser, David N. C. Tse