Sciweavers

46 search results - page 9 / 10
» Verify Results of Network Intrusion Alerts Using Lightweight...
Sort
View
SIGSOFT
2007
ACM
14 years 7 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
TASE
2010
IEEE
13 years 1 months ago
Analytic Calculus of Response Time in Networked Automation Systems
--This paper presents a novel approach to evaluate the response time in networked automation systems (NAS) that use a client/server protocol. The developments introduced are derive...
Boussad Addad, Said Amari, Jean-Jacques Lesage
WINET
2010
91views more  WINET 2010»
13 years 5 months ago
Route duration modeling for mobile ad-hoc networks
In this paper, we present a model that estimates the time duration of routes formed by several intermediate nodes in mobile multi-hop ad-hoc networks. First, we analyze a 3-node ro...
Michael Pascoe-Chalke, Javier Gomez, Victor Rangel...
ICWN
2008
13 years 8 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
TMC
2008
125views more  TMC 2008»
13 years 7 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai