Sciweavers

2571 search results - page 270 / 515
» Approximation schemes for wireless networks
Sort
View
ANCS
2005
ACM
16 years 7 days ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...
PEWASUN
2004
ACM
16 years 3 days ago
A modified IEEE 802.11 MAC protocol for MC-CDMA
In this paper, we introduce a modified version of the IEEE 802.11a protocol and evaluate its performance. The new protocol is a combination of the standard Medium Access Control (...
Georgios Orfanos, Jörg Habetha, Ling Liu
P2P
2009
IEEE
115views Communications» more  P2P 2009»
16 years 1 months ago
An Approximation Algorithm for Minimum-Delay Peer-to-Peer Streaming
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
Fei Huang, Binoy Ravindran, Anil Vullikanti
MOBIHOC
2008
ACM
16 years 6 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
AHSWN
2010
130views more  AHSWN 2010»
15 years 6 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li