Sciweavers

4004 search results - page 48 / 801
» How Many Packets Can We Encode
Sort
View
PAM
2007
Springer
14 years 4 months ago
Neuro-fuzzy Processing of Packet Dispersion Traces for Highly Variable Cross-Traffic Estimation
Cross-traffic data rate over the tight link of a path can be estimated using different active probing packet dispersion techniques. Many of these techniques send large amounts of p...
Marco A. Alzate, Néstor M. Peña, Mig...
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 10 months ago
Channel-coded Collision Resolution by Exploiting Symbol Misalignment
In random-access networks, such as the IEEE 802.11 network, different users may transmit their packets simultaneously, resulting in packet collisions. Traditionally, the collided p...
Lu Lu, Soung Chang Liew, Shengli Zhang
INFOCOM
2003
IEEE
14 years 3 months ago
Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks
Abstract— As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad ho...
Yih-Chun Hu, Adrian Perrig, David B. Johnson
ENTCS
2006
136views more  ENTCS 2006»
13 years 10 months ago
Automated Game Analysis via Probabilistic Model Checking: a case study
It has been recognised for some time that there are close links between the various logics developed for the analysis of multi-agent systems and the many game-theoretic models dev...
Paolo Ballarini, Michael Fisher, Michael Wooldridg...
SIGCOMM
1997
ACM
14 years 2 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker