<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Polli_2012a</id>
		<title>Polli 2012a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Polli_2012a"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Polli_2012a&amp;action=history"/>
		<updated>2026-05-11T12:01:32Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Polli_2012a&amp;diff=188401&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 814768669 to Polli 2012a</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Polli_2012a&amp;diff=188401&amp;oldid=prev"/>
				<updated>2021-01-26T12:23:52Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_814768669&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 814768669&quot;&gt;Draft Content 814768669&lt;/a&gt; to &lt;a href=&quot;/public/Polli_2012a&quot; title=&quot;Polli 2012a&quot;&gt;Polli 2012a&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 12:23, 26 January 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>http://www.colloquiam.com/wd/index.php?title=Polli_2012a&amp;diff=188400&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  This thesis focuses on the QoS-constrained Traffic Engineering (TE) of Wireless Mesh Networks (WMNs) affected by Multiple Access Interference (MAI). The goal...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Polli_2012a&amp;diff=188400&amp;oldid=prev"/>
				<updated>2021-01-26T12:23:47Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  This thesis focuses on the QoS-constrained Traffic Engineering (TE) of Wireless Mesh Networks (WMNs) affected by Multiple Access Interference (MAI). The goal...&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;
This thesis focuses on the QoS-constrained Traffic Engineering (TE) of Wireless Mesh Networks (WMNs) affected by Multiple Access Interference (MAI). The goal is to develop a tool for the optimization of network/physical resource allocation that enable to design WMNs supporting multicast multimedia sessions with different Quality of Service (QoS) requirements when intra-session Network Coding (NC), besides routing, can be performed at the network nodes.  A wide-applicability integrated framework is proposed, that allows to jointly optimize session utilities, flow control, QoS differentiation, intra-session network coding, Media Access Control (MAC) design and power control. To cope with the nonconvex nature of the resulting cross-layer optimization problem, this thesis proposes a two-level decomposition that provides the means to attain the optimal solution through suitably designed convex subproblems. Sufficient conditions for the feasibility of the primary (nonconvex) problem and for the equivalence to its related (convex) version are derived. Furthermore, a general procedure to devise simple polyhedral outer-bounds of the capacity region, which will be shown to have a key role in the decomposition, has been developed.  Algorithmic implementation of the two-level decomposition is discussed in both centralized and distributed approaches. Moreover, the asynchronous, iterative  Distributed Resource Allocation Algorithm (DRAA), that quickly self-adapts to network time-evolutions (e.g., node failures and/or fading fluctuations), is developed. Numerical results that delve into the potential of both the proposed solution and the resource allocation algorithm, are provided. In detail, the two-level decomposition will be tested in unicast, multicast and multisource scenarios so as to show the performance gain achievable by the joint optimization with respect to the conventional solutions.&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://hdl.handle.net/10805/1384 http://hdl.handle.net/10805/1384] under the license http://creativecommons.org/licenses/by-nc-nd/3.0/it/&lt;br /&gt;
&lt;br /&gt;
* [http://hdl.handle.net/11573/917025 http://hdl.handle.net/11573/917025]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>