<?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>Sun, 27 Jul 2008 07:58:50 BST</pubDate>


	<title>CiteULike: erl's Li</title>
	<description>CiteULike: erl's Li</description>


	<link>http://www.citeulike.org/user/erl/author/Li</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/2966687"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/erl/article/333422"/>

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


<item rdf:about="http://www.citeulike.org/user/erl/article/2966687">
    <title>Gateway Placement for Throughput Optimization in Wireless Mesh Networks</title>
    <link>http://www.citeulike.org/user/erl/article/2966687</link>
    <description>&lt;i&gt;Communications, 2007. ICC '07. IEEE International Conference on (2007), pp. 4955-4960.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In this paper, we address the problem of gateway placement for throughput optimization in multi-hop wireless mesh networks. Assume that each mesh node in the mesh network has a traffic demand. Given the number of gateways need to be deployed (denoted by k) and the interference model in the network, we study where to place exactly k gateways in the mesh network such that the total throughput is maximized while it also ensures a certain fairness among all mesh nodes. We propose a novel grid-based gateway deployment method using a cross-layer throughput optimization. Our proposed method can also be extended to work with multi-channel and multi-radio mesh networks. Simulation result demonstrates that our method can effectively exploit the resources available and perform much better than random and fixed deployment methods.</description>
    <dc:title>Gateway Placement for Throughput Optimization in Wireless Mesh Networks</dc:title>

    <dc:creator>Fan Li</dc:creator>
    <dc:creator>Yu Wang</dc:creator>
    <dc:creator>Xiang-Yang Li</dc:creator>
    <dc:identifier>doi:10.1109/ICC.2007.818</dc:identifier>
    <dc:source>Communications, 2007. ICC '07. IEEE International Conference on (2007), pp. 4955-4960.</dc:source>
    <dc:date>2008-07-05T22:34:21-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Communications, 2007. ICC '07. IEEE International Conference on</prism:publicationName>
    <prism:startingPage>4955</prism:startingPage>
    <prism:endingPage>4960</prism:endingPage>
    <prism:category>gw_positioning</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/erl/article/333422">
    <title>Capacity of Ad Hoc wireless networks</title>
    <link>http://www.citeulike.org/user/erl/article/333422</link>
    <description>&lt;i&gt;(2001), pp. 61-69.&lt;/i&gt;</description>
    <dc:title>Capacity of Ad Hoc wireless networks</dc:title>

    <dc:creator>Jinyang Li</dc:creator>
    <dc:creator>Charles Blake</dc:creator>
    <dc:creator>Douglas De Couto</dc:creator>
    <dc:creator>Hu Lee</dc:creator>
    <dc:creator>Robert Morris</dc:creator>
    <dc:identifier>doi:10.1145/381677.381684</dc:identifier>
    <dc:source>(2001), pp. 61-69.</dc:source>
    <dc:date>2005-09-28T00:13:46-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:startingPage>61</prism:startingPage>
    <prism:endingPage>69</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>gw_positioning</prism:category>
</item>



</rdf:RDF>

