Sciweavers

114 search results - page 2 / 23
» The Covert Set-Cover Problem with Application to Network Dis...
Sort
View
JDA
2008
84views more  JDA 2008»
13 years 5 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
ASUNAM
2010
IEEE
13 years 6 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
ICC
2008
IEEE
164views Communications» more  ICC 2008»
13 years 11 months ago
Detection of Encrypted Tunnels Across Network Boundaries
— The use of covert application-layer tunnels to bypass security gateways has become quite popular in recent years. By encapsulating blocked or controlled protocols such as peert...
Maurizio Dusi, Manuel Crotti, Francesco Gringoli, ...
ENTCS
2007
131views more  ENTCS 2007»
13 years 5 months ago
Secure Node Discovery in Ad-hoc Networks and Applications
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
Giovanni Di Crescenzo
IPSN
2010
Springer
13 years 7 months ago
U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol
Mobile sensor nodes can be used for a wide variety of applications such as social networks and location tracking. An important requirement for all such applications is that the mo...
Arvind Kandhalu, Karthik Lakshmanan, Ragunathan Ra...