Sciweavers

227 search results - page 14 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
JPDC
2006
187views more  JPDC 2006»
14 years 9 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
IPPS
2005
IEEE
15 years 3 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 2 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
IISWC
2008
IEEE
15 years 3 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
CISS
2008
IEEE
15 years 4 months ago
On wireless network scheduling with intersession network coding
Abstract—Cross-layer optimization including congestion control, routing, and scheduling has shown dramatic throughput improvement over layered designs for wireless networks. In p...
Chih-Chun Wang, Ness B. Shroff