Sciweavers

2947 search results - page 444 / 590
» The timely token protocol
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Neighbor Discovery with Reception Status Feedback to Transmitters
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
Ramin Khalili, Dennis Goeckel, Donald F. Towsley, ...
JSAC
2010
142views more  JSAC 2010»
15 years 4 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
COMCOM
2010
167views more  COMCOM 2010»
15 years 3 months ago
Effective load for flow-level performance modelling of file transfers in wireless LANs
Today, a wide range of 802.11-based Wireless LANs (WLANs) have become dominant to provide wireless Internet access for file transfers. For engineering purposes, there is a need fo...
Geert Jan Hoekstra, Robert D. van der Mei
MST
2011
200views Hardware» more  MST 2011»
15 years 1 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
CORR
2012
Springer
228views Education» more  CORR 2012»
14 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled