Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/node/2833' in /dati/webiit-old/includes/database.pgsql.inc on line 159 Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/node/2833' in /dati/webiit-old/includes/database.pgsql.inc on line 159 A Queuing Modeling Approach for Load-Aware Route Selection in Heterogenous Mesh Networks | IIT - CNR - Istituto di Informatica e Telematica
IIT Home Page CNR Home Page

A Queuing Modeling Approach for Load-Aware Route Selection in Heterogenous Mesh Networks

Wireless mesh networks are primarily used to provide Internet access by sharing the Internet connections of a limited number of gateways. If traffic is routed in the mesh without considering load distribution, unevenly network congestion may arise and some gateways may rapidly get overloaded, which causes a significant reduction of the network capacity. To address this issue, in this paper we firstly develop a queuing network model that accurately predicts the residual capacity of paths in heterogeneous mesh networks, and precisely identify network bottlenecks. By taking advantage of this model, we design a novel Load-Aware Route Selection  algorithm, named LARS, which improves the network capacity. This objective is obtained by allowing each mesh node to distribute the traffic load among multiple gateways in  order to ensure evenly utilization of Internet connections. Simulation results show that LARS significantly outperforms shortest path routing using contentionaware link costs, achieving throughput improvements of up to 210% in the considered network scenarios.


IEEE WoWMoM 2009, Kos (Greece), 2009

Autori IIT:

Tipo: Articolo in Atti di convegno internazionale con referee
Area di disciplina: Information Technology and Communication Systems
Da pagina 1 a pagina 9