<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Jason's Computer Science Blog &#187; Ernst</title>
	<atom:link href="http://www.jasonernst.com/tag/ernst/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.jasonernst.com</link>
	<description>By Jason Ernst</description>
	<lastBuildDate>Wed, 28 Jul 2010 18:29:59 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>ICC 2010 &#8211; Cross-Layer Mixed Bias Scheduling for Wireless Mesh Networks</title>
		<link>http://www.jasonernst.com/2010/06/04/icc-2010-cross-layer-mixed-bias-scheduling-for-wireless-mesh-networks/</link>
		<comments>http://www.jasonernst.com/2010/06/04/icc-2010-cross-layer-mixed-bias-scheduling-for-wireless-mesh-networks/#comments</comments>
		<pubDate>Fri, 04 Jun 2010 15:30:29 +0000</pubDate>
		<dc:creator>Jason Ernst</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Featured]]></category>
		<category><![CDATA[News]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Wireless Networks]]></category>
		<category><![CDATA[2010]]></category>
		<category><![CDATA[Bias]]></category>
		<category><![CDATA[Ernst]]></category>
		<category><![CDATA[Guelph]]></category>
		<category><![CDATA[ICC 2010]]></category>
		<category><![CDATA[Jason]]></category>
		<category><![CDATA[Mieso Denko]]></category>
		<category><![CDATA[Mixed]]></category>
		<category><![CDATA[Presentation]]></category>
		<category><![CDATA[Publication]]></category>
		<category><![CDATA[Scheduling]]></category>
		<category><![CDATA[Wireless]]></category>

		<guid isPermaLink="false">http://www.jasonernst.com/?p=845</guid>
		<description><![CDATA[This post is somewhat motivated by Prof. Andrew Eckford&#8217;s post that encourages graduate students and faculty members to post more about their work on sites like Twitter. Since I attended the same conference (ICC 2010), I thought it would be good to share a bit about my presentation and my experience at the conference. While [...]]]></description>
			<content:encoded><![CDATA[<p>This post is somewhat motivated by <a href="http://andreweckford.blogspot.com/2010/06/you-should-be-tweeting.html">Prof. Andrew Eckford&#8217;s post</a> that encourages graduate students and faculty members to post more about their work on sites like Twitter. Since I attended the same conference (ICC 2010), I thought it would be good to share a bit about my presentation and my experience at the conference.</p>
<p>While I don&#8217;t have a video for you to watch the entire presentation, I do have some pictures, and I&#8217;ll post the paper and slides I presented in case any one is interested. If you have any questions feel free to post on here or email me directly and I&#8217;ll be happy to answer any of them.</p>
<p><span id="more-845"></span></p>
<p>J.B. Ernst and M.K. Denko, &#8220;Cross-Layer Mixed Bias Scheduling for Wireless Mesh Networks,&#8221; in <em>Proc. IEEE International Conference on Communications (ICC)</em>, Cape Town, South Africa, 2010.</p>
<p><center>
<div class="image"><img src="http://www.jasonernst.com/wp-content/uploads/2010/06/icc2010-presentation-300x225.jpg" alt="ICC 2010 - Jason Ernst"/></div>
<p></center></p>
<p><em>Abstract</em>—In this paper we propose a mixed bias approach which makes use of cross layer optimization. The cross-layer parameters are based on conditions in the network from multiple layers and are used to determine resource and time allocation for nodes in the network. Unlike existing proposals, we propose to bias against several parameters such as link quality and queue size in addition to node distance. We also propose a combined mixed bias approach which takes into account multiple parameters together. The scheme is evaluated using simulation experiments. The performance results are reported in this paper.</p>
<p><a href="http://www.jasonernst.com/wp-content/uploads/2010/06/icc2010.pdf">Download the paper (pdf)</a><br />
<a href="http://www.jasonernst.com/wp-content/uploads/2010/06/ICC2010-presentation.pdf">Download the presentation slides (pdf)</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.jasonernst.com/2010/06/04/icc-2010-cross-layer-mixed-bias-scheduling-for-wireless-mesh-networks/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Thesis Defense a Success!</title>
		<link>http://www.jasonernst.com/2009/05/19/thesis-defense-a-success/</link>
		<comments>http://www.jasonernst.com/2009/05/19/thesis-defense-a-success/#comments</comments>
		<pubDate>Wed, 20 May 2009 03:10:15 +0000</pubDate>
		<dc:creator>Jason Ernst</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[News]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Wireless Networks]]></category>
		<category><![CDATA[Defense]]></category>
		<category><![CDATA[Ernst]]></category>
		<category><![CDATA[Guelph]]></category>
		<category><![CDATA[Jason]]></category>
		<category><![CDATA[M.Sc.]]></category>
		<category><![CDATA[Thesis]]></category>

		<guid isPermaLink="false">http://www.jasonernst.com/?p=656</guid>
		<description><![CDATA[Last Friday I successfully defended my thesis at Guelph. The room was full with lots of friends, students and faculty and everything went fairly smoothly. It definitely feels great to be done after almost two years building up to this. Today I finished the final revisions and submitted all of the copies with an insane [...]]]></description>
			<content:encoded><![CDATA[<p>Last Friday I successfully defended my thesis at Guelph. The room was full with lots of friends, students and faculty and everything went fairly smoothly. It definitely feels great to be done after almost two years building up to this. Today I finished the final revisions and submitted all of the copies with an insane amount of paperwork to Grad Program Services. Two to three weeks from now I should get my final bound copy of my thesis and it should soon be available online and in libraries <img src='http://www.jasonernst.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> . For anyone interested in reading it, email me and I can send you a pdf copy. </p>
<p><span id="more-656"></span></p>
<p>Here are some pictures from the day:</p>
<p><center>
<div class="image"><img src="http://www.jasonernst.com/wp-content/uploads/2009/05/defense1-300x225.jpg" alt="M.Sc. Thesis Defense Jason Ernst, University of Guelph, May 15th 2009"/><br/>Preparing for the Defense before Everyone Arrives</div>
<p></center></p>
<p><center>
<div class="image"><img src="http://www.jasonernst.com/wp-content/uploads/2009/05/perwin-300x225.jpg" alt="Pervasive Computing and Wireless Network (PerWin) Research Group, University of Guelph"/><br/>Some Members of Pervasive Computing and Wireless Network (PerWin) Research Group, University of Guelph</div>
<p></center></p>
<p><center>
<div class="image"><img src="http://www.jasonernst.com/wp-content/uploads/2009/05/defense2-300x225.jpg" alt="M.Sc. Thesis Defense Jason Ernst, University of Guelph, May 15th 2009"/><br/>Answering Questions from the Committee at Guelph</div>
<p></center></p>
<p>After some relaxing, a conference in UK and some business related projects I will finally have some time (hopefully) to update the site with all the projects, articles and source I have been slowly working on the past few months in between working like crazy on my M.Sc. This fall I start my Ph.D. which will likely at least start from the work I just worked on.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.jasonernst.com/2009/05/19/thesis-defense-a-success/feed/</wfw:commentRss>
		<slash:comments>22</slash:comments>
		</item>
		<item>
		<title>COCOA 2008 Paper</title>
		<link>http://www.jasonernst.com/2008/08/15/cocoa-2008-paper/</link>
		<comments>http://www.jasonernst.com/2008/08/15/cocoa-2008-paper/#comments</comments>
		<pubDate>Fri, 15 Aug 2008 20:45:31 +0000</pubDate>
		<dc:creator>Jason Ernst</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[News]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[2008]]></category>
		<category><![CDATA[COCOA]]></category>
		<category><![CDATA[Conference]]></category>
		<category><![CDATA[Ernst]]></category>
		<category><![CDATA[Hongbing Fan]]></category>
		<category><![CDATA[Jason]]></category>
		<category><![CDATA[Laurier]]></category>
		<category><![CDATA[Publication]]></category>
		<category><![CDATA[Wilfrid]]></category>

		<guid isPermaLink="false">http://www.jasonernst.com/?p=45</guid>
		<description><![CDATA[Just a small update, my first conference paper &#8220;Algorithms and Implementation for Interconnection Graph Problem&#8221; by Hongbing Fan, Christian Hundt, Yu-Liang Wu and myself, will be presented at COCOA 2008 in St. John&#8217;s Newfoundland on Friday, August 22nd at 9:40am by Dr. Fan. I am unable to attend since I am quite busy working on [...]]]></description>
			<content:encoded><![CDATA[<p>Just a small update, my first conference paper &#8220;Algorithms and Implementation for Interconnection Graph Problem&#8221; by Hongbing Fan, Christian Hundt, Yu-Liang Wu and myself, will be presented at COCOA 2008 in St. John&#8217;s Newfoundland on Friday, August 22nd at 9:40am by Dr. Fan.  I am unable to attend since I am quite busy working on my thesis and other work. You can view the program for the rest of the conference at the <a href="http://www.cs.uregina.ca/cocoa08/index.php?page=program" target="_blank" title="COCOA 2008 Program">COCOA website</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.jasonernst.com/2008/08/15/cocoa-2008-paper/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Customized Reconfigureable Interconnection Network (CRIN) Paper</title>
		<link>http://www.jasonernst.com/2008/03/08/customized-reconfigureable-interconnection-network-crin-paper/</link>
		<comments>http://www.jasonernst.com/2008/03/08/customized-reconfigureable-interconnection-network-crin-paper/#comments</comments>
		<pubDate>Sat, 08 Mar 2008 19:02:58 +0000</pubDate>
		<dc:creator>Jason Ernst</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Simulation]]></category>
		<category><![CDATA[CRIN]]></category>
		<category><![CDATA[Customized]]></category>
		<category><![CDATA[Ernst]]></category>
		<category><![CDATA[Fan]]></category>
		<category><![CDATA[Hongbing]]></category>
		<category><![CDATA[Interconnection]]></category>
		<category><![CDATA[Jason]]></category>
		<category><![CDATA[Networks]]></category>
		<category><![CDATA[Paper]]></category>
		<category><![CDATA[Progress]]></category>
		<category><![CDATA[Reconfigurable]]></category>

		<guid isPermaLink="false">http://jasonernst.com/?p=5</guid>
		<description><![CDATA[Recently, I have begun working on a new research project dealing with some graph theory with Dr. Hongbing Fan at Wilfrid Laurier University. As the title suggests the problem works with customized reconfigurable interconnection networks (CRINs). Dr. Fan has proposed an algorithm which attempts to minimize the connections within a network based on a set [...]]]></description>
			<content:encoded><![CDATA[<p>Recently, I have begun working on a new research project dealing with some graph theory with <a href="http://physcomp1.wlu.ca/~hfan/">Dr. Hongbing Fan</a> at Wilfrid Laurier University.  As the title suggests the problem works with customized reconfigurable interconnection networks (CRINs).  Dr. Fan has proposed an algorithm which attempts to minimize the connections within a network based on a set of routing requirements.</p>
<p style="text-align: center"><a href="http://jasonernst.com/wp-content/uploads/2008/03/interconnection-graph.gif"><img src="http://jasonernst.com/wp-content/uploads/2008/03/interconnection-graph.thumbnail.gif" alt="This is an example of an Interconnection Graph Problem" /></a></p>
<p align="center">An example Interconnection Graph Problem, Click to Enlarge</p>
<p>Since December of 2007 I have been working at implementing, testing and experimenting the algorithm as well as providing feedback and new ideas for improvements.  The paper is almost ready to be submitted for publication this so hopefully I will be able to provide a link to it in the future.</p>
<p>In relation with my thesis, I am planning on making use of the CRIN algorithm to attempt to optimize wireless network protocols. There still needs to be some experimentation and research to determine if in fact the algorithm can be used in this way however I feel optimistic that this is the case.</p>
<p>There is also the potential that the source code for the CRIN implementation may be made open source and released for use by anyone. If this is the case it will be uploaded to this site in the future.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.jasonernst.com/2008/03/08/customized-reconfigureable-interconnection-network-crin-paper/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
