<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://hdl.handle.net/2117/1162">
    <title>DSpace Community:</title>
    <link>http://hdl.handle.net/2117/1162</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/2117/1173" />
      </rdf:Seq>
    </items>
    <dc:date>2013-06-19T21:02:56Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/2117/1173">
    <title>Improving reactive routing on wireless multirate ad-hoc networks</title>
    <link>http://hdl.handle.net/2117/1173</link>
    <description>Title: Improving reactive routing on wireless multirate ad-hoc networks
Authors: Paoliello Guimarães, Rafael; Cerdà Alabern, Llorenç
Abstract: Traditional ad-hoc routing protocols typically choose minimum hop &#xD;
paths for transmissions. In a multi-rate environment, where nodes may elect&#xD;
between several transmission rates in order to accommodate different channel&#xD;
conditions, these protocols usually choose paths that contain long range links,&#xD;
with low effective throughput and low reliability. In this paper, we propose&#xD;
a mechanism for reactive routing protocols that &#xD;
leads to the election of high throughput routes while not increasing &#xD;
significantly the signaling overhead. By allowing a node to have a complete&#xD;
knowledge of its one-hop neighborhood topology, we are able to increase &#xD;
significantly the performance of the network through the improvement of the &#xD;
route election process on multi-rate environments.</description>
    <dc:date>2007-09-04T12:16:38Z</dc:date>
  </item>
</rdf:RDF>

