Sciweavers

11371 search results - page 285 / 2275
» The network inhibition problem
Sort
View
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
16 years 26 days ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
ACSAC
2001
IEEE
15 years 10 months ago
Requirements for a General Framework for Response to Distributed Denial-of-Service
What is network denial of service (DoS), and why is it such a problem? This research project has sought to investigate these questions and look at the deeper questions such as can...
D. W. Gresty, Qi Shi, Madjid Merabti
WCNC
2008
IEEE
16 years 1 months ago
Neural Network-Based Approach for Adaptive Density Control and Reliability in Wireless Sensor Networks
A primary constraint in wireless sensor networks (WSNs) is obtaining reliable and prolonged network operation with power-limited sensor nodes. Most of the approaches to the energy ...
Renita Machado, Sirin Tekinay
ICMCS
2009
IEEE
153views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Network coding-aware rate control and scheduling in wireless networks
Network coding has been recently applied to wireless networks to increase throughput. It is typically implemented as a thin layer between MAC and IP, transparently to higher layer...
Hulya Seferoglu, Athina Markopoulou, Ulas C. Kozat
MOBIHOC
2004
ACM
16 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...