{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"institution":[{"id":[{"id":"https:\/\/ror.org\/03mb6wj31","id-type":"ROR","asserted-by":"publisher"},{"id":"https:\/\/www.isni.org\/000000041937028X","id-type":"ISNI","asserted-by":"publisher"},{"id":"https:\/\/www.wikidata.org\/entity\/Q1640731","id-type":"wikidata","asserted-by":"publisher"}],"name":"Universitat Polit\u00e8cnica de Catalunya","acronym":["UPC"]}],"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:26:44Z","timestamp":1769286404031,"version":"3.49.0"},"reference-count":0,"publisher":"Universitat Polit\u00e8cnica de Catalunya","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Internet access is still unavailable to one-third of the world population due to the lack of infrastructure, high cost, and the digital divide. Many access-limited communities opt for shared Internet access where they build common network infrastructures to mitigate the cost. Internet connectivity in such infrastructures is typically provided by several limited, sometimes non-dedicated, gateways. Client nodes, i.e., the end-user hosts, use one gateway and switch to another when the first fails. In this scheme, the gateway configuration is done manually on the end-user side. This form of Internet connectivity is widespread and has the advantage that no central control is required, but it is also unreliable and inefficient due to several factors, such as unbalanced traffic load across the gateways. There is no doubt that the network would benefit from a gateway selection mechanism that can provide good connectivity to the client node as well as balanced load distribution and a dynamic adaptation to the current network state. However, providing such a dynamic gateway selection is complicated: since the perceived performance of the gateways changes frequently and might depend on the location of the client node in the network, and optimal selection would require the continuous monitoring of the gateway performance by the client node. The cost of such network-wide performance monitoring is high in large-scale networks and can outweigh the benefits of the dynamic gateway selection. \r\n\r\nThe thesis's goal is to design a low-cost, distributed mechanism that provides an efficient and dynamic gateway selection while considering the overall balanced gateway selection distribution. To this end, we have split the problem of gateway selection into different sub-problems.\r\n\r\nFirst, we focus on reducing the cost of gateway performance monitoring. We propose an approach to reduce the number of monitoring requests generated by each node and analyze its effect on the gateway selection. Then, we present a collaborative monitoring method that allows neighbor nodes to share the load of the gateway monitoring. We show that every node can carry out the necessary tasks: performance monitoring, collaboration with its neighbors, and fault tolerance measures, with little computation and communication overhead. \r\n\r\nSecond, to improve the gateway selection, we focus on making a selection decision that fulfills the individual performance requirements of the client nodes as well as global load balancing requirements. The solutions developed by us for the different sub-problems are embedded into a general and extensible, layered framework for gateway selection that we have called the Sense-Share-Select framework.\r\n\r\nExperimental validation and comparison with existing methods show that our framework provides accurate collaborative performance monitoring, improves the QoE for the nodes, and distributes the client nodes over the gateways in a balanced manner. The simplicity and flexibility of the framework make it adaptable to other network domains such as IoT networks and other scenarios where resource monitoring and load balancing are required.<\/jats:p>\n                <jats:p>El acceso a Internet a\u00fan no est\u00e1 disponible para un tercio de la poblaci\u00f3n mundial debido a la falta de infraestructuras, el alto costo y la brecha digital. Muchas comunidades con acceso limitado optan por el acceso compartido a Internet donde construyen infraestructuras de red comunitaria para mitigar el costo. La conectividad a Internet en dichas infraestructuras suele estar a cargo de varias puerta de enlaces limitadas en recursos, y a veces no dedicadas. Los nodos de cliente, es decir, los hosts de usuario final, utilizan una puerta de enlace y cambian a otra cuando falla la primera. En este esquema, la configuraci\u00f3n de la puerta de enlace se realiza manualmente en el lado del usuario final. Esta forma de conectividad a Internet est\u00e1 muy extendida y tiene la ventaja de que no se requiere un control central, pero tampoco es confiable y eficiente debido a varios factores, como una carga desequilibrada de tr\u00e1fico a trav\u00e9s de las puertas de enlace. No hay duda de que la red se beneficiar\u00eda de un mecanismo de selecci\u00f3n de pasarela que pueda proporcionar una buena conectividad al nodo cliente, as\u00ed como una distribuci\u00f3n equilibrada de la carga y una adaptaci\u00f3n din\u00e1mica al estado actual de la red. Sin embargo, proporcionar una selecci\u00f3n de puerta de enlace tan din\u00e1mica es complicado: dado que el rendimiento percibido de las puertas de enlace cambia con frecuencia y podr\u00eda depender de la ubicaci\u00f3n del nodo cliente en la red, y la selecci\u00f3n \u00f3ptima requerir\u00eda la supervisi\u00f3n continua del rendimiento de la puerta de enlace por parte del nodo cliente. El costo de dicha supervisi\u00f3n del rendimiento en toda la red es muy alto en redes de gran escala y puede superar los beneficios de la selecci\u00f3n de puerta de enlace din\u00e1mica. El objetivo de la tesis es dise\u00f1ar un mecanismo distribuido de bajo costo que proporcione una selecci\u00f3n de puerta de enlace din\u00e1mica y eficiente al tiempo que considera la distribuci\u00f3n general de selecci\u00f3n de puerta de enlace equilibrada. Con este fin, hemos dividido el problema de la selecci\u00f3n de la puerta de enlace en diferentes subproblemas. Primero, nos enfocamos en reducir el coste del monitoreo del rendimiento de la puerta de enlace. Proponemos un enfoque para reducir la cantidad de solicitudes de monitoreo generadas por cada nodo y analizar su efecto en la selecci\u00f3n de la puerta de enlace. Luego, presentamos un m\u00e9todo de monitoreo colaborativo que permite a los nodos vecinos compartir la carga del monitoreo de la puerta de enlace. Demostramos que cada nodo puede realizar las tareas necesarias: monitoreo del rendimiento, colaboraci\u00f3n con sus vecinos y medidas de tolerancia a fallas, con poca sobrecarga de c\u00f3mputo y comunicaci\u00f3n. En segundo lugar, para mejorar la selecci\u00f3n de la puerta de enlace, nos centramos en tomar una decisi\u00f3n de selecci\u00f3n que cumpla con los requisitos de rendimiento individuales de los nodos del cliente, as\u00ed como con los requisitos de equilibrio de carga global. Las soluciones desarrolladas por nosotros para los diferentes subproblemas est\u00e1n integradas en un marco general y extensible en capas para la selecci\u00f3n de puertas de enlace que hemos llamado el marco Sense-Share-Select. La validaci\u00f3n experimental y la comparaci\u00f3n con los m\u00e9todos existentes muestran que nuestro marco proporciona un monitoreo de rendimiento colaborativo preciso, mejora la QoE para los nodos y distribuye los nodos del cliente a trav\u00e9s de las puertas de enlace de manera equilibrada. La simplicidad y flexibilidad del marco lo hacen adaptable a otros dominios de red, como las redes de IoT y otros escenarios donde se requiere monitoreo de recursos y equilibrio de carga.<\/jats:p>","DOI":"10.5821\/dissertation-2117-363409","type":"dissertation","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T01:43:43Z","timestamp":1689731023000},"approved":{"date-parts":[[2022,2,7]]},"source":"Crossref","is-referenced-by-count":0,"title":["Connectivity sharing for wireless mesh networks"],"prefix":"10.5821","author":[{"sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khulan","family":"Batbayar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"3865","container-title":[],"original-title":[],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T06:37:56Z","timestamp":1769236676000},"score":1,"resource":{"primary":{"URL":"https:\/\/hdl.handle.net\/2117\/363409"}},"subtitle":[],"editor":[{"given":"Roc","family":"Meseguer Pallar\u00e8s","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Ramin","family":"Sadre","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.5821\/dissertation-2117-363409","relation":{},"subject":[]}}