Sciweavers

321 search results - page 12 / 65
» Approximate Models for General Cache Networks
Sort
View
INFOCOM
2007
IEEE
15 years 11 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
INFOCOM
2005
IEEE
15 years 10 months ago
Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks
— In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: Firstly, a throughput model based on...
Xin Wang, Koushik Kar
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
15 years 11 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 11 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
INFOCOM
2007
IEEE
15 years 11 months ago
A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
Zhenming Chen, Chunming Qiao, Jinhui Xu, Taekkyeun...