Sciweavers

5793 search results - page 215 / 1159
» Individual communication complexity
Sort
View
DNIS
2005
Springer
112views Database» more  DNIS 2005»
16 years 4 days ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
MOBIHOC
2009
ACM
16 years 7 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
GLOBECOM
2007
IEEE
16 years 28 days ago
Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
Gopu V. R. Muni Kumar, B. Sundar Rajan
MOBIHOC
2008
ACM
16 years 6 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
PODC
2005
ACM
16 years 4 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder