<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Haddadou_et_al_2013a</id>
		<title>Haddadou et al 2013a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Haddadou_et_al_2013a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Haddadou_et_al_2013a&amp;action=history"/>
		<updated>2026-04-23T16:43:10Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Haddadou_et_al_2013a&amp;diff=194420&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 960226581 to Haddadou et al 2013a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Haddadou_et_al_2013a&amp;diff=194420&amp;oldid=prev"/>
				<updated>2021-01-28T20:57:21Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_960226581&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 960226581&quot;&gt;Draft Content 960226581&lt;/a&gt; to &lt;a href=&quot;/public/Haddadou_et_al_2013a&quot; title=&quot;Haddadou et al 2013a&quot;&gt;Haddadou et al 2013a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 20:57, 28 January 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Haddadou_et_al_2013a&amp;diff=194419&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; In this body of work, we are interested in road safety applications such as advanced driver assistance systems, based on Vehicular Ad...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Haddadou_et_al_2013a&amp;diff=194419&amp;oldid=prev"/>
				<updated>2021-01-28T20:57:15Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; In this body of work, we are interested in road safety applications such as advanced driver assistance systems, based on Vehicular Ad...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
International audience; In this body of work, we are interested in road safety applications such as advanced driver assistance systems, based on Vehicular Ad Hoc Networks (VANETs). One of the particular characteristics of this kind of networks is the continuous sharing of safety information by its nodes. Since this kind of information is time sensitive, a node cannot spend much time to verify its validity with an authority. However, the presence of malicious and selfish nodes in VANETs corrupts exchanged data, and lowers the overall data reception ratio in the network. To tackle this, we propose a new incentive model with exclusion for malicious nodes called VIME. VIME is inspired from the signaling theory from economics. It is based on managing a credit count that each node receives at the initialization of the application. Straightforwardly, VIME is based on two pillars. On the one hand, a node pays an appropriate cost for each sent message, which is seen by the receivers as a guarantee from the source about the truthfulness of the information. On the other hand, nodes get rewarded for cooperating in the network. The proposed economic model allows computing the amounts to be paid and those to be awarded in order to fight selfish and malicious nodes. We validate our approach via simulations. We show that VIME is able to detect and evict gradually all malicious nodes in the network, and decreases the ratio of corrupted and false sent data until reaching zero. Moreover, it has a positive impact on the participation of selfish nodes, as our approach increases the average ratio of sent data as to equal the ideal case's percentage, when no selfish node is present.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://hal-enpc.archives-ouvertes.fr/docs/00/78/81/26/PDF/Trust_and_Exclusion_in_Vehicular_Ad_Hoc_Networks-_An_Economic_Incentive_Model_based_Approach.pdf http://hal-enpc.archives-ouvertes.fr/docs/00/78/81/26/PDF/Trust_and_Exclusion_in_Vehicular_Ad_Hoc_Networks-_An_Economic_Incentive_Model_based_Approach.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://igm.univ-mlv.fr/~haddadou/Papers/Trust%20and%20Exclusion%20in%20Vehicular%20Ad%20Hoc%20Networks:%20An%20Economic%20Incentive%20Model%20based%20Approach.pdf http://igm.univ-mlv.fr/~haddadou/Papers/Trust%20and%20Exclusion%20in%20Vehicular%20Ad%20Hoc%20Networks:%20An%20Economic%20Incentive%20Model%20based%20Approach.pdf],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-00788126 https://hal.archives-ouvertes.fr/hal-00788126],&lt;br /&gt;
: [https://hal-upec-upem.archives-ouvertes.fr/hal-00788126/document https://hal-upec-upem.archives-ouvertes.fr/hal-00788126/document],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/1999024762 https://academic.microsoft.com/#/detail/1999024762]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/6523354/6533591/06533601.pdf?arnumber=6533601 http://xplorestaging.ieee.org/ielx7/6523354/6533591/06533601.pdf?arnumber=6533601],&lt;br /&gt;
: [http://dx.doi.org/10.1109/comcomap.2013.6533601 http://dx.doi.org/10.1109/comcomap.2013.6533601]&lt;br /&gt;
&lt;br /&gt;
* [https://hal-upec-upem.archives-ouvertes.fr/hal-00788126 https://hal-upec-upem.archives-ouvertes.fr/hal-00788126],&lt;br /&gt;
: [https://hal-upec-upem.archives-ouvertes.fr/hal-00788126/document https://hal-upec-upem.archives-ouvertes.fr/hal-00788126/document],&lt;br /&gt;
: [https://hal-upec-upem.archives-ouvertes.fr/hal-00788126/file/Trust_and_Exclusion_in_Vehicular_Ad_Hoc_Networks-_An_Economic_Incentive_Model_based_Approach.pdf https://hal-upec-upem.archives-ouvertes.fr/hal-00788126/file/Trust_and_Exclusion_in_Vehicular_Ad_Hoc_Networks-_An_Economic_Incentive_Model_based_Approach.pdf]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>