<?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=Aglzim_et_al_2018a</id>
		<title>Aglzim et al 2018a - 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=Aglzim_et_al_2018a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Aglzim_et_al_2018a&amp;action=history"/>
		<updated>2026-05-05T12:18:04Z</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=Aglzim_et_al_2018a&amp;diff=200728&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 155331598 to Aglzim et al 2018a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Aglzim_et_al_2018a&amp;diff=200728&amp;oldid=prev"/>
				<updated>2021-02-02T02:09:56Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_155331598&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 155331598&quot;&gt;Draft Content 155331598&lt;/a&gt; to &lt;a href=&quot;/public/Aglzim_et_al_2018a&quot; title=&quot;Aglzim et al 2018a&quot;&gt;Aglzim et al 2018a&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 02:09, 2 February 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=Aglzim_et_al_2018a&amp;diff=200727&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; As mobile applications deliver increasingly complex functionalities, the demands for even more intensive computation would quickly tra...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Aglzim_et_al_2018a&amp;diff=200727&amp;oldid=prev"/>
				<updated>2021-02-02T02:09:50Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; As mobile applications deliver increasingly complex functionalities, the demands for even more intensive computation would quickly tra...&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; As mobile applications deliver increasingly complex functionalities, the demands for even more intensive computation would quickly transcend energy capability of mobile devices. On one hand and in an attempt to address such issues, fog computing paradigm is introduced to mitigate the limited energy and computation resources available within constrained mobile devices, by moving computation resources closer to their users at the edge of the access network. On another hand, most of electric vehicles (EVs), with increasing computation, storage and energy capabilities, spend more than 90% of time on parking lots. In this paper, we conceive the basic idea of using the underutilized computation resources of parked EVs as fog nodes in order to provide on-demand computation at the vicinity of the access network. The proposed Vehicular Fog Computing (VFC) architecture aggregates the abundant unused resources of parked vehicles, and uses it to serve mobile users' demands. The resource allocation problem is formulated as a Markov Decision Process (MDP) and dynamic programming is used to solve the underling decision problem. Extensive simulation results show the effectiveness of the proposed approach by improving the global reward value by 51% and scoring an energy gain of 66% compared to two other models.&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://dx.doi.org/10.1109/glocom.2018.8648081 http://dx.doi.org/10.1109/glocom.2018.8648081]&lt;br /&gt;
&lt;br /&gt;
* [https://hal.archives-ouvertes.fr/hal-02557052 https://hal.archives-ouvertes.fr/hal-02557052]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/8634808/8647127/08648081.pdf?arnumber=8648081 http://xplorestaging.ieee.org/ielx7/8634808/8647127/08648081.pdf?arnumber=8648081],&lt;br /&gt;
: [http://dx.doi.org/10.1109/glocom.2018.8648081 http://dx.doi.org/10.1109/glocom.2018.8648081]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/globecom/globecom2018.html#BirhanieMSAA18 https://dblp.uni-trier.de/db/conf/globecom/globecom2018.html#BirhanieMSAA18],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2916687019 https://academic.microsoft.com/#/detail/2916687019]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>