Sciweavers

12301 search results - page 2001 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
ASMTA
2011
Springer
295views Mathematics» more  ASMTA 2011»
14 years 9 months ago
Performance Evaluation of a Single Node with General Arrivals and Service
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
Alexandre Brandwajn, Thomas Begin

Presentation
945views
13 years 12 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
MOBIHOC
2009
ACM
16 years 6 months ago
Efficient resource management in OFDMA Femto cells
Femto cells are a cost-effective means of providing ubiquitous connectivity in future broadband wireless networks. While their primary purpose has been to improve coverage in curr...
Karthikeyan Sundaresan, Sampath Rangarajan
ICALP
2009
Springer
16 years 29 days ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
SIGCOMM
2009
ACM
16 years 20 days ago
Beyond friendship graphs: a study of user interactions in Flickr
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
Masoud Valafar, Reza Rejaie, Walter Willinger
« Prev « First page 2001 / 2461 Last » Next »