<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Sat, 05 Jul 2008 12:26:53 BST</pubDate>


	<title>CiteULike: erl's library [25 articles]</title>
	<description>CiteULike: erl's library [25 articles]</description>


	<link>http://www.citeulike.org/user/erl/article/1356427</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/erl/article/1356427"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/erl/article/1356427">
    <title>Rerouting Time and Queueing in Proactive Ad Hoc Networks</title>
    <link>http://www.citeulike.org/user/erl/article/1356427</link>
    <description>&lt;i&gt;Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa (2007), pp. 160-169.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In a MAINET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during transmission. The routing protocol is designed to find alternative paths in these situations. This rerouting takes time, and the latency is referred to as the rerouting time. This paper investigates the rerouting time of proactive routing protocols and shows that the rerouting time is considerably affected by queueing. Simulations and analysis are conducted to explore the problem. Finally, we propose a MAC-layer solution that reduces the rerouting time problems due to queueing. Simulations and analysis show that the solution is so effective that it eliminates the entire problem in many situations.</description>
    <dc:title>Rerouting Time and Queueing in Proactive Ad Hoc Networks</dc:title>

    <dc:creator>Vinh Pham</dc:creator>
    <dc:creator>Erlend Larsen</dc:creator>
    <dc:creator>Knut Ovsthus</dc:creator>
    <dc:creator>Paal Engelstad</dc:creator>
    <dc:creator>Oivind Kure</dc:creator>
    <dc:identifier>doi:10.1109/PCCC.2007.358891</dc:identifier>
    <dc:source>Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa (2007), pp. 160-169.</dc:source>
    <dc:date>2007-06-01T22:37:50-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa</prism:publicationName>
    <prism:startingPage>160</prism:startingPage>
    <prism:endingPage>169</prism:endingPage>
    <prism:category>own</prism:category>
</item>



</rdf:RDF>

