City-wide rooftop networkingCity-wide rooftop networking Μεταπτυχιακή Διατριβή Master Thesis 2017-12-202017enMesh (802.11s) networks are inherently resource constrained, in terms of transmission power, as well as bandwidth. It is essential to formulate coloring schemes that explicitly protect sensitive links. This work offers a coloring algorithm that protects specific links from interference, using network planner-defined weights. The network consists of nodes that accommodate a variable number of 802.11s radio interfaces, with different kinds of directive antennas, targeting city-wide deployments. The proposed algorithm is applied to a carefully crafted conflict graph, with merged vertices that share common radio interfaces. Semidefinite programming (SDP) is used to approximate the chromatic number of the conflict graph. Evaluation is performed both in terms of simulation in modified NS3 (to accommodate multiple directive radio interfaces per node), as well as experimental results across a city-wide deployment; the greater area of Chania city is covered, spanning ranges in the order of 5.5 km. It is demonstrated that the proposed link protection methodology outperforms prior art that avoids protecting specific links; improvements are observed both in terms of average, as well as minimum (worst-case) throughput. Such quality-of-service (QoS) improvement is a key attribute in critical applications and may be deemed crucial in practical, city-wide, rooftop networking.http://creativecommons.org/licenses/by/4.0/Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών ΥπολογιστώνOikonomakos_Panagiotis_MSc_2017.pdfChania [Greece]Library of TUC2017-12-20application/pdf2.2 MBfree Oikonomakos Panagiotis Οικονομακος Παναγιωτης Bletsas Aggelos Μπλετσας Αγγελος Karystinos Georgios Καρυστινος Γεωργιος Koutroulis Eftychios Κουτρουλης Ευτυχιος Πολυτεχνείο Κρήτης Technical University of Crete Resource allocation Mesh networks Rooftop networking Graph coloring