Today Moblity Management is one of the most important tasks that need to be accomplished to secure availability and performance of communication between people. This paper explains how moblity management is currently structured and what algorithms and approaches from Peer-To-Peer technology could be used to increase availability and performance.

In the context of the Internet of Things (IoT), commissioning is the process of securely adding a new device to a network. It covers many different tasks, including the physical deployment of devices and configuration of parameters. It is network installers who need to manually commission each device one by one with the help of commissioning tools. In practice, the first task for a network installer is to identify each device correctly before configuring it with proper parameters. Individually identifying each device, especially in a large network, is a very time-consuming process. This is also known as the identification problem. This project is going to address the problem.A novel device identification approach is presented in the thesis, and there is no human intervention involved in the identification process. Devices are trying to identify themselves based on predefined rules and given information. The approach is therefore called device self-identification, and it is implemented in two different algorithms. One is the centralized device selfidentification, and the other is the distributed device self-identification. In short, only one device participates in the device identification process in the centralized approach, and in the distributed counterpart, every device is part of the identification process.The results of the implementations show the potential of the new way to identify devices in IoT. Devices in both the centralized approach and the distributed approach are able to identify themselves given necessary information about the network. A detailed discussion regarding the two proposed algorithms and the network information is presented in the thesis. / I samband med Internet of Things (IoT) är igångkörning processen att säkert lägga till en ny enhet i ett nätverk. Den täcker många olika uppgifter, inklusive fysisk distribution av enheter och konfigurering av parametrar. Det är nätverksinstallatörer som måste manuellt beställa varje enhet en efter en med hjälp av installationsverktyg. I praktiken är den första uppgiften för en nätverksinstallatör att korrekt identifiera varje enhet innan den konfigureras med lämpliga parametrar. Att identifiera varje enhet speciellt i ett stort nätverk är en mycket tidskrävande process. Detta är också känt som identifieringsproblemet. Detta projekt kommer att ta itu med problemet.En nyhetsidentifieringsmetod presenteras i avhandlingen och det finns ingen mänsklig intervention involverad i identifieringsprocessen. Enheter försöker identifiera sig baserat på fördefinierade regler och information. Tillvägagångssättet kallas därför enhetens självidentifiering och det implementeras i två olika algoritmer, en är centraliserad enhetens självidentifiering och den andra är distribuerad enhetens självidentifiering. Kort sagt, endast en enhet deltar i enhetsidentifieringsprocessen i centraliserat tillvägagångssätt, och i distribuerad motsvarighet är varje enhet en del av identifieringsprocessen.Resultaten av implementationerna visar potentialen för det nya sättet att identifiera enheter i IoT. Enheter i både centraliserat tillvägagångssätt och distribuerat tillvägagångssätt kan identifiera sig med den information som krävs för nätverket. En detaljerad diskussion om de två föreslagna algoritmerna och nätverksinformationen presenteras i avhandlingen.

This thesis presents an exploratory study into the development of digital societies and it examines public sector modernization and innovation from a technology management perspective. The study presents reasons why most city-wide or council-wide development of wireless broadband access networks currently end in failure or are unsustainable. It also suggests its links with wider problems of innovation management and the commercial failure of otherwise technically competent solutions It explores the modernisation of society, government, the underlying theories that influence it as well as the innovations triggered by its wake. The exercise reveals a myriad of innovations; firstly in the modernisation of the infrastructure of government and secondly in the development of societal infrastructure in the form of broadband networks.

<p>Solar energy is a clean and abundant renewable energy source which is currently used in many types of photovoltaic (PV) designs. In practical PV systems, solar panels are used to harvest solar energy and convert it into a usable form of electricity. Due to the intermittent nature of solar energy input however, battery storage, in combination with solar panels, must be used to provide an uninterrupted source of power.</p> <p>The process of assigning solar panel and battery configurations for a PV system is referred to as energy resource provisioning. Unfortunately, energy provisioning costs are still relatively high, and this is one of the main obstacles that inhibits the adoption of solar power for many applications. These costs however, can be substantially reduced through cost-efficient resource provisioning methods. The focus of this thesis is on the development of efficient algorithms and energy management methods that will reduce energy provisioning costs in solar powered systems.</p> <p>First, we consider resource provisioning in solar powered wireless mesh networks. In practical solar powered systems, there are usually restrictions in the way that the mesh nodes can be positioned, and this results in a time-varying and node-dependent attenuation of the available solar energy. Unfortunately, conventional resource provisioning methods cannot take this into account and therefore the deployed system may be unnecessarily expensive. In this part of the thesis, the resource provisioning problem is considered from this point of view. We first review conventional resource provisioning mechanisms and give an example which shows the value of introducing positional solar insolation awareness. A Position Aware Provisioning (PAP) algorithm is then introduced that takes known positional variations into consideration when performing the energy provisioning. Simulation results show that reductions in total network provisioning cost can be obtained using the proposed methodology compared to conventional algorithms.</p> <p>In the second part of the thesis, we consider communication infrastructure that is operated from the power grid with a solar powered addition. Resource provisioning and energy management algorithms are introduced to minimize the capital expenditure (CAPEX) and operating expenditure (OPEX) costs. We first derive lower bounds on the costs using a linear programming (LP) formulation where solar components are sized using solar insolation and projected loading data. A variety of different node configurations are considered. Three energy scheduling algorithms are then introduced to optimize online OPEX costs, namely, Grid Purchase Last (GPL), Solar Load Optimization (SLO) and Solar Load Simulation (SLS) algorithms. Simulation results show the extent to which a solar powered add-on can reduce total cost.</p> <p>Finally, we consider solar powered systems where part of their energy demands are deferrable, up to some maximum tolerable delay. The objective is to exploit the flexibility of deferrable energy demands in a way that decreases the total provisioning cost. A mixed integer linear optimization program is derived which gives a lower bound on the provisioning cost. A Delay Aware Provisioning (DAP) algorithm is then proposed to determine practical cost-efficient energy provisioning. The performance of DAP is compared to the provisioning bound and the conventional Stand-alone Node Provisioning (SNP) algorithm. Results are presented which show the significant provisioning cost savings that can be obtained.</p> / Doctor of Philosophy (PhD)

This thesis dissertation addresses the problem of providing video streaming services over mobile wireless ad hoc networks. This sort of network represents a hostile environment for this kind of realtime data transmission to the extent that obtaining a good quality of viewer experience is challenging and still under study. Besides the research point of view, providing high-quality multimedia services is decisive for the practical usability and feasibility of wireless ad hoc networks so that service providers can broaden the range of services offered. So far, mobile wireless ad hoc networks have been used to provide network connection among users who could not have connectivity otherwise. However, quality expectations and requirements have been increased notably, fostered by the advent of real-time multimedia applications over mobile devices. Due to the considerable processing and bandwidth constraints underlying these types of devices, coupled with their ability to move freely, it becomes a difficult task to achieve an acceptable quality of service throughout the entire video transmission. Thus, the contribution of this thesis work is twofold. On the one hand, the main problems and limitations that may be encountered and should be faced when deploying real-time services over mobile wireless ad hoc networks are analyzed and discussed. Bandwidth constraints and node mobility are portrayed as the major causes that prevent good quality of service and smooth video playback. On the other hand, following then the aim of improving video streaming quality, this thesis proposes practical solutions that involve diverse routing and cross-layer techniques. One of the proposed approaches focuses on hierarchical routing. Hierarchical arrangement of network nodes may reduce packet interference as well as offer a structured architecture that reduces control traffic overhead. Particularly, the proposed hierarchical routing protocol aims at providing scalability when the number of nodes grows, while maintaining complexity as low as possible. The resulting reduction in packet losses and video playback interruptions finally enhances the quality of received video streams. Furthermore, on the basis that the nodes in an ad hoc network are willing to perform routing tasks, every node could become essential for the proper network operation and routing performance. In tune with this philosophy, a new cross-layer mechanism for recovering lost packets is proposed. By overhearing packets over the wireless shared medium, any node in the surrounding area of the destination endpoint can altruistically retransmit those video packets that have not been correctly received at destination. Moreover, due to the video awareness and frame prioritization algorithm considered in this proposal, it becomes very convenient for real-time video streaming services. The results show that the presented mechanism succeeds in improving video quality and user experience, especially when packet losses are caused due to the mobility of the destination node. / Arce Vila, P. (2014). Hierarchical routing and cross-layer mechanisms for improving video streaming quality of service over mobile wireless ad hoc networks [Tesis doctoral]. Editorial Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/36538

近年來興起一個前瞻性無線技術，稱之為無線網狀網路（Wireless Mesh Networks），WMNs 以所費低廉方式提供無線網路最後一哩存取Internet，同時具備ad hoc 網路全部優點，例如自我組織（self-organization）、自我組態（self-configuration）等。儘管WMNs 骨幹部分與平面式ad hoc 網路相似，多網卡（multi-radio）的Mesh Routers 節點卻是固定不動且沒有電力限制。有鑑於此，設計於ad hoc 網路上之路由協定並不適合於WMNs。 WCETT（Weighted Cumulated Expected Transmission Time）metric 考量到intra-flow 干擾，卻未捕捉到inter-flow 干擾；而LBAR（Load-Balanced Ad hoc Routing）協定以計算節點之活躍值（nodal activity）與訊務流量干擾選擇路徑，並無支援多網卡路由，LBAR 可以在單一網卡環境表現良好，在多網卡環境卻不一定。因此，我們提出一個WMNs 上考量到Intra/Inter-flow干擾之多網卡路由協定，稱為MiRii。模擬結果顯示出我們路由協定可以改善網路效能，包含了封包成功傳送率及平均點對點延遲。 / A new promising wireless technology has emerged recently, called wireless mesh networks (WMNs). WMNs are inexpensive way to provide wireless last-mile broadband Internet access and have all the advantages of ad hoc network, such as self-organization, self-configuration. Although WMNs backbone is similar to flat ad hoc network, mesh routers with multi-radio are stationary and have no power constraints. As a result, routing protocols designed for ad hoc network may not be appropriate for WMNs. The WCETT (Weighted Cumulated Expected Transmission Time) metric takes intra-flow interference into consideration, but does not capture inter-flow interference. LBAR (Load-Balanced Ad hoc Routing) calculates nodal activity and traffic interference for choosing a path, but does not supporting multi-radio. LBAR may be perform well in single-radio environment, but do not perform as well in multi-radios. Consequently, we incorporate a new Multi-Interface Routing with Intra/Inter-flow Interference in Wireless Mesh Networks, called MiRii. The simulations show that our routing protocol can improve the network performance including the Packet Delivery Ratio and average end-to-end delay.

Approved for public release, distribution is unlimited / Wireless mesh networking has emerged as the successor of the traditional ad hoc networks. New technological advances, the standardization of protocols and interfaces and the maturity of key components have made it possible for current mesh research groups to set goals that are really close to the world's expectations. The objective of this research is to design and implement a simulation toolkit for wireless mesh clusters that can be used as an additional performance evaluation technique for the Tactical Network Topology program of Naval Postgraduate School. This toolkit is implemented in the OPNET simulation environment and it incorporates various nodes running different ad hoc routing protocols. Furthermore, the investigation of a suitable combination of protocols for the Tactical Network Topology is achieved by creating scenarios and running a number of simulations using the mesh toolkit. / Captain, Hellenic Air Force

L'évolution importante des réseaux sans fil tend à fournir les supports nécessaires aux applications ubiquitaires émergentes dans les réseaux Mesh sans fil. Les réseaux mesh comprennent des nœuds stationnaires qui remplissent la fonction de routage et appelés routeurs Mesh sans fil (WMR) et qui consitutent le réseau backbone sans fil (WBMN) ainsi que des nœuds clients mesh sans fil (WMCs). Alors que les WMCs sont limités en termes de fonctions et de resources radio, les WMRS fournissent des fonctions de pont et de passerelle afin de connecter les réseaux WMNs aux autres réseaux comme les réseaux cellulaires, les réseaux IEEE 802.11, les réseaux IEEE 802.16, ou tout simplement à Internet. Par conséquent, les réseaux WMRs sont construits à partir sur la base d'équipement radio de communication rapide et/ou multi-radio et multi-canaux. Les routeurs WMRs sont supposes être auto-organisés, auto-configurés et constituant un réseau WNMN robuste ce qui nécessite de soutenir des volumes importants de trafic de données et sur de longues périodes. Cependant, répondre à attentes élevées en termes de services nécessite le développement d'approches décentralisés pour le control dynamique des puissances de transmission (DTPC). La présente thèse se focalise sur le problème DTPC pour les deux cas de réseaux; utilisant un canal de communication et multicanaux. Pour les réseaux exploitant un seul canal, le problème est formulé en termes de problème d'optimisation où l'objectif est de minimiser en même temps des critères convexes associés aux liens et aux réseaux. Afin de résoudre ce problème, des modèles et des algorithmes, appelés MATA (multiple access transmission aware), ont été proposés. Pour les réseaux WBMNs utilisant des systèmes multi-radio et multi-canaux (MRMC), le réseau est modélisé par un ensemble de graphes appelés UCGs (unified channel graphs), chacun consistant les utilisateurs connectés au point d'accès en utilisant le même canal fréquentiel. Pour chaque ensemble UCG, le problème à résoudre un problème quadratique et stochastique soumis aux contraintes des états des liens dynamiques LSI (Link State Information) de tous les UCGs. Le protocole PMMUP, mutli-radio et minimisant la consummation énegétique, est propose au niveau de la couche liaison. Algorithmes d'estimation prédictive base sur ce protocol sont proposes pour résoudre les problèmes d'optimisation associés aux UGCs. Les problèmes énergétiques, les instabilités des queues et les interférences, sont formulés en termes de problèmes de commande optimale couplée, appelés SPWC (singularly-perturbed weakly-coupled). Pour résoudre les problèmes SPWC caractérisant le problème de commande optimal des energies de transmission, l'algorithme HORA (aeneralized higher-order recursive algorithm) qui permet d'obtenir les solutions stables pour les équations de Riccati a été développé. Les performes des modèles et algorithmes proposés dans le cadre de la présente thèse ont été évalués tant sur le plan théorique qu'en simulation. Différentes simulations ont été effectuées sur un large ensemble de topologies réseaux générés aléatoirement. Les résultats de simulation et analytiques Simulation confirment l'efficacité des algorithmes proposés par rapport à la majorité des techniques existantes / The remarkable evolution of wireless networks into the next generation to provide ubiquitous and seamless broadband applications has recently triggered the emergence of Wireless Mesh Networks (WMNs). The WMNs comprise stationary Wireless Mesh Routers (WMRs) forming Wireless Backbone Mesh Networks (WBMNs) and mobile Wireless Mesh Clients (WMCs) forming the WMN access. While WMCs are limited in function and radio resources, the WMRs are expected to support heavy duty applications : that is, WMRs have gateway and bridge functions to integrate WMNs with other networks such as the Internet, cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor networks, et cetera. Consequently, WMRs are constructed from fast switching radios or multiple radio devices operating on multiple frequency channels. WMRs are expected to be self-organized, self-configured and constitute a reliable and robust WBMN which needs to sustain high traffic volumes and long “online” time. However, meeting such stringent service expectations requires the development of decentralized dynamic transmission power control (DTPC) approaches. This thesis addresses the DTPC problem for both single and multiple channel WBMNs. For single channel networks, the problem is formulated as the minimization of both the link-centric and network-centric convex cost function. In order to solve this issue, multiple access transmission aware (MATA) models and algorithms are proposed. For multi-radio multi-channel (MRMC) WBMNs, the network is modelled as sets of unified channel graphs (UCGs), each consisting of interconnected active network users communicating on the same frequency channel. For each UCG set, the minimization of stochastic quadratic cost functions are developed subject to the dynamic Link State Information (LSI) equations from all UCGs. An energy-efficient multi-radio unification protocol (PMMUP) is then suggested at the Link-Layer (LL). Predictive estimation algorithms based on this protocol are proposed to solve such objective functions. To address transmission energy and packet instabilities, and interference across multiple channels, singularly-perturbed weakly-coupled (SPWC) control problems are formulated. In order to solve the SPWC transmission power control problem, a generalized higher-order recursive algorithm (HORA) that obtains the Riccati Stabilizing Solutions to the control problem is developed. The performance behaviours of the proposed models and algorithms are evaluated both analytically and through computer simulations. Several simulations are performed on a large number of randomly generated topologies. Simulation and analytical results confirm the efficacy of the proposed algorithms compared to the most recently studied techniques

Les réseaux maillés sans fil (RMSF), grâce à leurs caractéristiques avantageuses, sont considérés comme une solution efficace pour le support des services de voix, vidéo et de données dans les réseaux de prochaine génération. Le standard IEEE 802.16-d a spécifié pour les RMSF, à travers son mode maillé, deux mécanismes de planifications de transmission de données; à savoir la planification centralisée et la planification distribuée. Dans ce travail, on a évalué le support de la qualité de service (QdS) du standard en se focalisant sur la planification distribuée. Les problèmes du système dans le support du trafic de voix ont été identifiés. Pour résoudre ces problèmes, on a proposé un protocole pour le support de VoIP (AVSP) en tant qu’extension au standard original pour permettre le support de QdS au VoIP. Nos résultats préliminaires de simulation montrent qu’AVSP offre une bonne amélioration au support de VoIP. / Wireless mesh networks (WMNs), because of their advantageous characteristics, are considered as an effective solution to support voice services, video and data in next generation networks. The IEEE 802.16-d specified for WMNs, through its mesh mode, two mechanisms of scheduling data transmissions; namely centralized scheduling and distributed scheduling. In this work, we evaluated the support of the quality of service (QoS) of the standard by focusing on distributed scheduling. System problems in the support of voice traffic have been identified. To solve these problems, we proposed a protocol for supporting VoIP, called Assisted VoIP Scheduling Protocol (AVSP), as an extension to the original standard to support high QoS to VoIP. Our preliminary simulation results show that AVSP provides a good improvement to support VoIP.

We study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh networks, where the nodes in the network are subjected to energy expenditure rate constraints. As wireless scenario does not allow all the links to be active all the time, only a subset of given links can be active simultaneously. We model the inter-link interference using the link contention graph. All the nodes in the network are power-constrained and we model this constraint using energy expenditure rate matrix. Then we formulate the problem as a network utility maximization (NUM) problem. We notice that this is a convex optimization problem with affine constraints. We apply duality theory and decompose the problem into two sub-problems namely, network layer congestion control and routing problem, and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. The optimal scheduler selects that set of non-interfering links, for which the sum of link prices is maximum. We study the effects of energy expenditure rate constraints of the nodes on the maximum possible network utility. It turns out that the dominant of the two constraints namely, the link capacity constraint and the node energy expenditure rate constraint affects the network utility most. Also we notice the fact that the energy expenditure rate constraints do not affect the nature of optimal link scheduling problem. Following this fact, we study the problem of distributed link scheduling. Optimal scheduling requires selecting independent set of maximum aggregate price, but this problem is known to be NP-hard. We first show that as long as scheduling policy selects the set of non-interfering links, it can not go unboundedly away from the optimal solution of network utility maximization problem. Then we proceed and evaluate a simple greedy scheduling algorithm. Analytical bounds on performance are provided and simulations indicate that the greedy heuristic performs well in practice.