Scaling Simulations of Reconfigurable Meshes.

This dissertation deals with reconfigurable bus-based models, a new type of parallel machine that uses dynamically alterable connections between processors to allow efficient communication and to perform fast computations. We focus this work on the Reconfigurable Mesh (R-Mesh), one of the most widely studied reconfigurable models. We study the ability of the R-Mesh to adapt an algorithm instance of an arbitrary size to run on a given smaller model size without significant loss of efficiency. A scaling simulation achieves this adaptation, and the simulation overhead expresses the efficiency of the simulation. We construct a scaling simulation for the Fusing-Restricted Reconfigurable Mesh (FR-Mesh), an important restriction of the R-Mesh. The overhead of this simulation depends only on the simulating machine size and not on the simulated machine size. The results of this scaling simulation extend to a variety of concurrent write rules and also translate to an improved scaling simulation of the R-Mesh itself. We present a bus linearization procedure that transforms an arbitrary non-linear bus configuration of an R-Mesh into an equivalent acyclic linear bus configuration implementable on an Linear Reconfigurable Mesh (LR-Mesh), a weaker version of the R-Mesh. This procedure gives the algorithm designer the liberty of using buses of arbitrary shape, while automatically translating the algorithm to run on a simpler platform. We illustrate our bus linearization method through two important applications. The first leads to a faster scaling simulation of the R-Mesh. The second application adapts algorithms designed for R-Meshes to run on models with pipelined optical buses. We also present a simulation of a Directional Reconfigurable Mesh (DR-Mesh) on an LR-Mesh. This simulation has a much better efficiency compared to previous work. In addition to the LR-Mesh, this simulation also runs on models that use pipelined optical buses

Simulations and Algorithms on Reconfigurable Meshes With Pipelined Optical Buses.

Recently, many models using reconfigurable optically pipelined buses have been proposed in the literature. A system with an optically pipelined bus uses optical waveguides, with unidirectional propagation and predictable delays, instead of electrical buses to transfer information among processors. These two properties enable synchronized concurrent access to an optical bus in a pipelined fashion. Combined with the abilities of the bus structure to broadcast and multicast, this architecture suits many communication-intensive applications. We establish the equivalence of three such one-dimensional optical models, namely the LARPBS, LPB, and POB. This implies an automatic translation of algorithms (without loss of speed or efficiency) among these models. In particular, since the LPB is the same as an LARPBS without the ability to segment its buses, their equivalence establishes reconfigurable delays (rather than segmenting ability) as the key to the power of optically pipelined models. We also present simulations for a number of two-dimensional optical models and establish that they possess the same complexity, so that any of these models can simulate a step of one of the other models in constant time with a polynomial increase in size. Specifically, we determine the complexity of three two-dimensional optical models (the PR-Mesh, APPBS, and AROB) to be the same as the well known LR-Mesh and the cycle-free LR-Mesh. We develop algorithms for the LARPBS and PR-Mesh that are more efficient than existing algorithms in part by exploiting the pipelining, segmenting, and multicasting characteristics of these models. We also consider the implications of certain physical constraints placed on the system by restricting the distance over which two processors are able to communicate. All algorithms developed for these models assume that a healthy system is available. We present some fundamental algorithms that are able to tolerate up to N/2 faults on an N-processor LARPBS. We then extend these results to apply to other algorithms in the areas of image processing and matrix operations

QoS improvement in TCP/IP-based wireless sensor networks using cross-layer optimization

Dissertação de Mestrado, Engenharia Informática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015Internet of Things (IoT) is becoming a reality and new and advanced applications are expected to emerge. For applications with reliability needs to work well in IoT environments, robust data transportation is required. Approaches like TCP are known for not being adequate in sensor network environments, while UDP has been included in the 6LoWPAN stack allowing low-power and limited processing devices to participate in the IoT. However, UDP provides no reliability. One way of providing reliability is to use link-layer acknowledgements but this mechanism may lead to an inefficient use of resources if used unconditionally throughout all the network. Another way is to request the confirmation of messages sent, done at the application layer, but this is an end-to-end process that can only be applied for specific message type transactions. If used for all data then there will be long delays and inefficient use of resources also. Here we address the design of a cross-layer reactive mechanism that improves reliability of data delivery, in order to support applications that require some reliability level when delivering data notifications. This mechanism introduces link layer reliability at specific nodes, gradually and only when needed, having no scaling problems. Results show that this mechanism can improve data delivery and improve the use of network resources.Erasmus Mundus Iran Iraq Yemen (EMIIY

Prospects for Declarative Mathematical Modeling of Complex Biological Systems

Declarative modeling uses symbolic expressions to represent models. With such expressions one can formalize high-level mathematical computations on models that would be difficult or impossible to perform directly on a lower-level simulation program, in a general-purpose programming language. Examples of such computations on models include model analysis, relatively general-purpose model-reduction maps, and the initial phases of model implementation, all of which should preserve or approximate the mathematical semantics of a complex biological model. The potential advantages are particularly relevant in the case of developmental modeling, wherein complex spatial structures exhibit dynamics at molecular, cellular, and organogenic levels to relate genotype to multicellular phenotype. Multiscale modeling can benefit from both the expressive power of declarative modeling languages and the application of model reduction methods to link models across scale. Based on previous work, here we define declarative modeling of complex biological systems by defining the operator algebra semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects; we define semantics-preserving implementation and semantics-approximating model reduction transformations; and we outline a "meta-hierarchy" for organizing declarative models and the mathematical methods that can fruitfully manipulate them

DESIGN OF RELIABLE AND SUSTAINABLE WIRELESS SENSOR NETWORKS: CHALLENGES, PROTOCOLS AND CASE STUDIES

Integrated with the function of sensing, processing, and wireless communication, wireless sensors are attracting strong interest for a variety of monitoring and control applications. Wireless sensor networks (WSNs) have been deployed for industrial and remote monitoring purposes. As energy shortage is a worldwide problem, more attention has been placed on incorporating energy harvesting devices in WSNs. The main objective of this research is to systematically study the design principles and technical approaches to address three key challenges in designing reliable and sustainable WSNs; namely, communication reliability, operation with extremely low and dynamic power sources, and multi-tier network architecture. Mathematical throughput models, sustainable WSN communication strategies, and multi-tier network architecture are studied in this research to address these challenges, leading to protocols for reliable communication, energy-efficient operation, and network planning for specific application requirements. To account for realistic operating conditions, the study has implemented three distinct WSN testbeds: a WSN attached to the high-speed rotating spindle of a turning lathe, a WSN powered by a microbial fuel cell based energy harvesting system, and a WSN with a multi-tier network architecture. With each testbed, models and protocols are extracted, verified and analyzed. Extensive research has studied low power WSNs and energy harvesting capabilities. Despite these efforts, some important questions have not been well understood. This dissertation addresses the following three dimensions of the challenge. First, for reliable communication protocol design, mathematical throughput or energy efficiency estimation models are essential, yet have not been investigated accounting for specific application environment characteristics and requirements. Second, for WSNs with energy harvesting power sources, most current networking protocols do not work efficiently with the systems considered in this dissertation, such as those powered by extremely low and dynamic energy sources. Third, for multi-tier wireless network system design, routing protocols that are adaptive to real-world network conditions have not been studied. This dissertation focuses on these questions and explores experimentally derived mathematical models for designing protocols to meet specific application requirements. The main contributions of this research are 1) for industrial wireless sensor systems with fast-changing but repetitive mobile conditions, understand the performance and optimal choice of reliable wireless sensor data transmission methods, 2) for ultra-low energy harvesting wireless sensor devices, design an energy neutral communication protocol, and 3) for distributed rural wireless sensor systems, understand the efficiency of realistic routing in a multi-tier wireless network. Altogether, knowledge derived from study of the systems, models, and protocols in this work fuels the establishment of a useful framework for designing future WSNs

A Comprehensive Analysis of Literature Reported Mac and Phy Enhancements of Zigbee and its Alliances

Wireless communication is one of the most required technologies by the common man. The strength of this technology is rigorously progressing towards several novel directions in establishing personal wireless networks mounted over on low power consuming systems. The cutting-edge communication technologies like bluetooth, WIFI and ZigBee significantly play a prime role to cater the basic needs of any individual. ZigBee is one such evolutionary technology steadily getting its popularity in establishing personal wireless networks which is built on small and low-power digital radios. Zigbee defines the physical and MAC layers built on IEEE standard. This paper presents a comprehensive survey of literature reported MAC and PHY enhancements of ZigBee and its contemporary technologies with respect to performance, power consumption, scheduling, resource management and timing and address binding. The work also discusses on the areas of ZigBee MAC and PHY towards their design for specific applications