72 search results - page 10 / 15 » Fast algorithm for beamforming problems in distributed commu... |
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
DCOSS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...