<?xml version="1.0"?>

<!DOCTYPE owl [
  <!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
  <!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
  <!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
  <!ENTITY owl "http://www.w3.org/2002/07/owl#">
  <!ENTITY cc "http://web.resource.org/cc/#">
  <!ENTITY event "http://ebiquity.umbc.edu/ontology/event.owl#">
  <!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
  <!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">]>

<!--
  This ontology document is licensed under the Creative Commons
  Attribution License. To view a copy of this license, visit
  http://creativecommons.org/licenses/by/2.0/ or send a letter to
  Creative Commons, 559 Nathan Abbott Way, Stanford, California
  94305, USA.
-->

<rdf:RDF 
  xmlns:rdf = "&rdf;"
  xmlns:rdfs = "&rdfs;"
  xmlns:xsd = "&xsd;"
  xmlns:owl = "&owl;"
  xmlns:cc = "&cc;"
  xmlns:event = "&event;"
  xmlns:person = "&person;"
  xmlns:assert = "&assert;">
  <event:Event rdf:about="http://ebiquity.umbc.edu/event/html/id/242/Gossip-based-Outlier-Detection-for-Mobile-Ad-Hoc-Networks">
    <rdfs:label><![CDATA[Gossip-based Outlier Detection for Mobile Ad Hoc Networks]]></rdfs:label>
    <event:title><![CDATA[Gossip-based Outlier Detection for Mobile Ad Hoc Networks]]></event:title>
    <event:speaker><person:PhDStudent rdf:about="http://ebiquity.umbc.edu/person/html/Wenjia/Li/"><person:name><![CDATA[Wenjia  Li]]></person:name><rdfs:label><![CDATA[Wenjia  Li]]></rdfs:label></person:PhDStudent></event:speaker>
    <event:startDate rdf:datatype="&xsd;dateTime">2008-05-06T10:00:00-05:00</event:startDate>
    <event:location><![CDATA[ITE 325B]]></event:location>
    <event:abstract><![CDATA[It is well understood that Mobile Ad Hoc Networks (MANETs) are extremely
susceptible to a variety of attacks. Many security schemes have been
proposed that depend on identifying nodes that are exhibiting malicious
behavior such as packet dropping, packet modification, and packet
misrouting.  We argue that in general, this problem can be viewed as an
instance of detecting nodes whose behavior is an outlier when compared to
others. In this work, we propose a gossip-based outlier detection
algorithm for MANETs. The algorithm leads to a common outlier view amongst
distributed nodes with a limited communication overhead. Simulation
results demonstrate that the proposed algorithm is efficient and accurate.]]></event:abstract>
    <event:host><person:PrincipalFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Anupam/Joshi/"><person:name><![CDATA[Anupam  Joshi]]></person:name><rdfs:label><![CDATA[Anupam  Joshi]]></rdfs:label></person:PrincipalFaculty></event:host>
  </event:Event>

  <rdf:Description rdf:about="">
    <cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  </rdf:Description>

</rdf:RDF>
