Sciweavers

88 search results - page 16 / 18
» Communication constraints in the average consensus problem
Sort
View
SPAA
2003
ACM
14 years 28 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
EJWCN
2010
229views more  EJWCN 2010»
13 years 2 months ago
Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The propose...
Zaheer Khan, Janne J. Lehtomäki, Marian Codre...
GLOBECOM
2007
IEEE
14 years 2 months 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
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
IPSN
2004
Springer
14 years 1 months ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal