Sciweavers

174 search results - page 32 / 35
» Geometric Random Linear Codes in Sensor Networks
Sort
View
TIT
2008
103views more  TIT 2008»
14 years 9 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
TIT
2010
156views Education» more  TIT 2010»
14 years 4 months ago
Bandwidth and power allocation for cooperative strategies in Gaussian relay networks
Abstract-- In a relay network with a single sourcedestination pair, we examine the achievable rates with amplifyand-forward (AF) relaying strategy. Motivated by applications in sen...
Ivana Maric, Roy D. Yates
MOBIHOC
2007
ACM
15 years 9 months ago
Balancing traffic load in wireless networks with curveball routing
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
Lucian Popa 0002, Afshin Rostamizadeh, Richard M. ...
88
Voted
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
PODC
2006
ACM
15 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah