No description available.

[pt] Este trabalho avalia a coleta esporádica de dados em uma rede sem fio Bluetooth Mesh, usando o simulador OMNET (mais mais) INET. O coletor de dados é um nó sink em movimento, que poderia ser um smartphone ou outro dispositivo portátil, carregado por um pedestre, ciclista, animal, ou um drone. O nó sink poderia se conectar a uma rede mesh em áreas de difícil acesso onde não há acesso a internet, e coletar dados de sensores. Após implementar extensões ao Bluetooth Mesh, funcionalidades de nós Low Power e Friends no OMNET (mais mais), conseguimos propor e avaliar algoritmos para roteamento adaptativo, e com foco em mobilidade, de dados de sensores em direção ao nó sink. Uma variação de um dos algoritmos de roteamento propostos alcançou um aumento de 173,54 por cento na quantidade de dados únicos entregues ao nó sink em comparação ao algoritmo de roteamento padrão do Bluetooth Mesh. Neste caso, houve um aumento de apenas 4,63 por cento no consumo de energia para o mesmo cenário. Além disso, a taxa de entrega aumentou em 111.82 por cento. / [en] This work evaluates sporadic data collection on a Bluetooth Mesh network, using the OMNET (plus plus) INET simulator. The data collector is a roaming sink node, which could be a smartphone or other portable device, carried by a pedestrian, a biker, an animal, or a drone. The sink node could connect to a mesh network in hard-to-reach areas that do not have internet access and collect sensor data. After implementing Bluetooth Mesh relay extensions, Low Power, and Friend features in OMNET (plus plus), we were able to propose and evaluate algorithms for mobility-aware, adaptive, routing of sensor data towards the sink node. One variation of a proposed routing algorithm achieved a 173.54 percent increase in unique data delivered to the sink node compared to Bluetooth Mesh s default routing algorithm. In that case, there was only a 4.63 percent increase in energy consumption for the same scenario. Also, the delivery rate increased by 111.82 percent.

L'essor considérable de la technologie CMOS a permis l'accroissement de la densité d'intégration selon la loi de Moore. Cependant, la poursuite de cette évolution est en voie de ralentissement dû aux contraintes physiques et économiques. Le défi devient alors de pouvoir utiliser un maximum de circuits tout en tolérant des défauts physiques présents en leur sein. Les circuits reconfigurables de type FPGA (Field Programmable Gate Array) connaissent un succès croissant car leurs performances et leurs capacités d'intégrer des applications très complexes ont directement bénéficié de l'évolution technologique. Le but de cette thèse est de proposer une architecture de FPGA contenant des mécanismes permettant de tolérer plus de 20% d'éléments défectueux après fabrication. La première partie du manuscrit étudie les différentes architectures de FPGA (matricielles et arborescentes) ainsi que les différentes techniques de contournement des défauts. Dans la seconde partie de cette thèse, nous présentons l'architecture cible matricielle (matrice de grappes ou groupes). Cette architecture combine les avantages des architectures matricielles (sa généricité) et arborescentes (réduction du taux d'utilisation de l'interconnexion. La troisième partie de cette thèse présente le développement d'une méthode d'identification des blocs les plus critiques contenus dans le FPGA ainsi que l'impact des différentes techniques de contournement retenues et proposées sur l'architecture et sur la criticité des blocs de base du FPGA. Pour finir, nous définissons les performances des différentes techniques de contournements en termes de tolérance aux défauts, de performances temporelles et de surface. / The increasing integration density according to Moore’s law is being slowed due to economic and physical limits. However, this technological evolution involves an higher number of physical defects after manufacturing circuit. As yield goes down, one of the future challenges is to find a way to use a maximum of fabricated circuits while tolerating physical defects spread all over the chip. Fiel Programmable Gate Array (FPGA) are integrated circuits that contain logic blocks and reconfigurable interconnect. Their ability to integrate more complex applications, their flexibility and good performance make FPGAs the perfect target architecture. The aim of this thesis is to propose an FPGA architecture containing mechanisms to tolerate more than 20% of defective resources after manufacture. The first part of the manuscript studies the different FPGA architectures (mesh and tree) and different defects bypass techniques. In the second part of this thesis, we present the target architecture called Mesh of Clusters (MoC). This architecture combines the advantages of mesh architectures (genericity) and tree (reduction of the interconnect). The third contribution of this thesis is the development of a method to identify the most critical blocks in the FPGA and the impact of all bypass techniques on the architecture and on the criticality. Finally, we define the performance of all bypass techniques in terms of defect tolerance, timing and area overhead. Finally, thanks to these local redundancy techniques, we are able to tolerate more than 20% of defect on the FPGA architecture. In addition, the designer can fix his own metric in terms of area, timing and defect tolerance.

No description available.

A development of high resolution NFT model for simulation of incompressible flows is presented. The model uses finite volume spatial discretisation with edge based data structure and operates on unstructured meshes with arbitrary shaped cells. The key features of the model include non-oscillatory advection scheme Multidimensional Positive Definite Advection Transport Algorithm (MPDATA) and non-symmetric Krylov-subspace elliptic solver. The NFT MPDATA model integrates the Reynolds Average Navier Stokes (RANS) equations. The implementation of the Spalart-Allmaras one equations turbulence model extends the development further to turbulent flows. An efficient non-staggered mesh arrangement for pressure and velocity is employed and provides smooth solutions without a need of artificial dissipation. In contrast to commonly used schemes, a collocated arrangement for flow variables is possible as the stabilisation of the NFT MPDATA scheme arises naturally from the design of MPDATA. Other benefits of MPDATA include: second order accuracy, strict sign-preserving and full multidimensionality. The flexibility and robustness of the new approach is studied and validated for laminar and turbulent flows. Theoretical developments are supported by numerical testing. Successful quantitative and qualitative comparisons with the numerical and experimental results available from literature confirm the validity and accuracy of the NFT MPDATA scheme and open the avenue for its exploitation for engineering problems with complex geometries requiring flexible representation using unstructured meshes.

ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada / The scope of this document is the description of design and implementation of the wireless sensor network realized as a part of our Senior Design Capstone Project. The various components and sub-systems that comprise the final product are discussed, followed by the implementation procedures and results.

Wireless Mesh Networks (WMNs) are bringing revolutionary change in the field of wireless networking. It is a trustworthy technology in applications like broadband home networking, network management and latest transportation systems. WMNs consist of mesh routers, mesh clients and gateways. It is a special kind of wireless Ad-hoc networks. One of the issues in WMNs is resource management which includes routing and for routing there are particular routing protocols that gives better performance when checked with certain parameters. Parameters in WMNs include delay, throughput, network load etc. There are two types of routing protocols i.e. reactive protocols and proactive protocols. Three routing protocols AODV, DSR and OLSR have been tested in WMNs under certain parameters which are delay, throughput and network load. The testing of these protocols will be performed in the Optimized Network Evaluation Tool (OPNET) Modeler 14.5. The obtained results from OPNET will be displayed in this thesis in the form of graphs. This thesis will help in validating which routing protocol will give the best performance under the assumed conditions. Moreover this thesis report will help in doing more research in future in this area and help in generating new ideas in this research area that will enhance and bring new features in WMNs. / Wireless Mesh Networks (WMNs) bringar revolutionerande förändring inom området för trådlösa nätverk. Det är en pålitlig teknik i tillämpningar såsom bredband hemma nätverk, nätverkshantering och senaste transportsystem. WMNs består av mesh routrar, kunder mesh och gateways. Det är en speciell typ av trådlöst ad-hoc-nätverk. En av frågorna i WMNs är resurshushållning som inkluderar routing och routing det finns särskilda routingprotokoll som ger bättre prestanda vid kontroll med vissa parametrar. Parametrar i WMNs omfatta dröjsmål, genomströmning, belastningen på nätet etc. Det finns två typer av routingprotokoll dvs reaktiva protokoll och proaktiva protokoll. Tre routingprotokoll AODV, DSR och OLSR har testats i WMNs under vissa parametrar som är försenade, genomströmning och belastningen på nätet. Testning av dessa protokoll kommer att utföras i den optimerade Network Evaluation Tool (OPNET) Modeler 14.5. De erhållna resultaten från OPNET kommer att visas i denna avhandling i form av grafer. Denna uppsats kommer att bidra till att godkänna vilka routingprotokoll kommer att ge bäst resultat enligt den antagna förhållanden. Dessutom kommer denna uppsats rapport kommer att bidra till att göra mer forskning i framtiden på detta område och bidra till att generera nya idéer inom detta forskningsområde som kommer att öka och att nya funktioner i WMNs. / +46762749245

No description available.

No description available.

Recent advances in Wireless Mesh Networks (WMNs) have overcome the drawbacks of traditional wired networks and wireless ad hoc networks. WMNs will play a leading role in the next generation of networks, and the question of how to provide smooth mobility for WMNs is the driving force behind the research. The inherent characteristics of WMNs, such as relatively static backbones and highly mobile clients, require new handoff management solutions to be designed and implemented. This thesis first presents our research work on handoff management schemes in traditional WMNs. In general, a handoff process includes two parts, the MAC layer handoff and the network layer handoff. For the MAC layer handoff, a self-configured handoff scheme with dynamic adaptation is presented. Before the mobile node starts the probe process, it configures parameters for each channel to optimize the scan process. Moreover, a fast authentication scheme to reduce authentication latency for WiFi-based mesh networks is introduced. A tunnel is introduced to forward data packets between the new access router and the original reliable access router to recover data communication before the complete authentication process is finished. To minimize the network layer handoff latency, a hybrid routing protocol for forwarding packets is proposed: this involves both the link layer routing and the network layer routing. Based on the hybrid routing protocol, both intra-domain and inter-domain handoff management have been designed to support smooth roaming in WMNs. In addition, we extend our work to Vehicular Mesh Networks (VMNs). Considering the characteristics of VMNs, a fast handoff scheme is introduced to reduce handoff latency by using a multi-hop clustering algorithm. Using this scheme, vehicle nodes are divided into different multi-hop clusters according to the relative mobility. Some vehicle nodes are selected as assistant nodes; and these assistant nodes will help the cluster head node to determine the next access router for minimizing handoff latency. Extensive simulation results demonstrate that the proposed scheme can reduce handoff latency significantly.