Sciweavers

162 search results - page 14 / 33
» Minimizing Average Finish Time in P2P Networks
Sort
View
IPL
2011
91views more  IPL 2011»
12 years 10 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
INFOCOM
2010
IEEE
13 years 5 months ago
Towards a Theory of Anonymous Networking
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
Javad Ghaderi, Rayadurgam Srikant
TWC
2008
154views more  TWC 2008»
13 years 7 months ago
Threshold Selection for SNR-based Selective Digital Relaying in Cooperative Wireless Networks
This paper studies selective relaying schemes based on signal-to-noise-ratio (SNR) to minimize the end-to-end (e2e) bit error rate (BER) in cooperative digital relaying systems usi...
Furuzan Atay Onat, Abdulkareem Adinoyi, Yijia Fan,...
INFOCOM
2007
IEEE
14 years 1 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
ICC
2007
IEEE
173views Communications» more  ICC 2007»
14 years 1 months ago
Virtual Topology Design for OBS Optical Networks
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
Bin Wu, Kwan Lawrence Yeung