Electronic systems of the future require a very high bandwidth communications infrastructure within the system. This way the massive amount of compute power which will be available can be inter-connected to realize future powerful advanced electronic systems. Today, electronic inter-connects between 3D chip-stacks, as well as intra-connects within 3D chip-stacks are approaching data rates of 100 Gbit/s soon. Hence, the question to be answered is how to efficiently design the communications infrastructure which will be within electronic systems. Within this paper approaches and results for building this infrastructure for future electronics are addressed.

Analog-to-digital converters (ADCs) are key design blocks in state-of-art image, capacitive, and biomedical sensing applications. In these sensing applications, algorithmic ADCs are the preferred choice due to their high resolution and low area advantages. Algorithmic ADCs are based on the same operating principle as that of pipelined ADCs. Unlike pipelined ADCs where the residue is transferred to the next stage, an N-bit algorithmic ADC utilizes the same hardware N-times for each bit of resolution. Due to the cyclic nature of algorithmic ADCs, many of the low power techniques applicable to pipelined ADCs cannot be directly applied to algorithmic ADCs. Consequently, compared to those of pipelined ADCs, the traditional implementations of algorithmic ADCs are power inefficient. This thesis presents two novel energy efficient techniques for algorithmic ADCs. The first technique modifies the capacitors' arrangement of a conventional flip-around configuration and amplifier sharing technique, resulting in a low power and low area design solution. The other technique is based on the unit multiplying-digital-to-analog-converter approach. The proposed approach exploits the power saving advantages of capacitor-shared technique and capacitor-scaled technique. It is shown that, compared to conventional techniques, the proposed techniques reduce the power consumption of algorithmic ADCs by more than 85\%. To verify the effectiveness of such approaches, two prototype chips, a 10-bit 5 MS/s and a 12-bit 10 MS/s ADCs, are implemented in a 130-nm CMOS process. Detailed design considerations are discussed as well as the simulation and measurement results. According to the simulation results, both designs achieve figures-of-merit of approximately 60 fJ/step, making them some of the most power efficient ADCs to date.

Wireless sensor networks (WSNs) have a wide variety of applications in civilian, medical and military applications. However, the nodes in such a network are limited to one type of action: sensing the environment. With increasing requirements for intelligent interaction with the environment, there is a need to not only perceive but also control the monitored environment. This has led to the emergence of a new class of networks, referred to as wireless sensor and actor networks (WSANs), capable of performing both sensing and acting tasks on the environment. The evolution from WSNs, which can be thought of as performing only read operations, to WSANs, which can perform both read and write operations, introduces unique and new challenges that need to be addressed. In this research, the fundamental challenges required for effective operation of WSANs are analyzed from the following three different perspectives: (i) operation correctness, (ii) resource optimality, and (iii) operation performance. The solutions proposed to address the challenges are evaluated with the optimal solution and other competing approaches through analytical and simulation results. The feasibility of the proposed solutions is demonstrated through a testbed implementation.

In this thesis study, a valveless hydraulic servo system controlled by two pumps is investigated and its performance characteristics are compared with a conventional valve controlled system both experimentally and analytically. The two control techniques are applied on the position control of a single rod linear actuator. In the valve controlled system, the flow rate through the actuator is regulated with a servovalve / whereas in the pump controlled system, two variable speed pumps driven by servomotors regulate the flow rate according to the needs of the system, thus eliminating the valve losses. To understand the dynamic behaviors of two systems, the order of the differential equations defining the system dynamics of the both systems are reduced by using the fact that the dynamic pressure changes in the hydraulic cylinder chambers become linearly dependent on leakage coefficients and cylinder chamber volumes above and below some prescribed cut off frequencies. Thus the open loop speed response of the pump controlled and valve controlled systems are defined by v second order transfer functions. The two systems are modeled in MATLAB Simulink environment and the assumptions are validated. For the position control of the single rod hydraulic actuator, a linear state feedback control scheme is applied. Its state feedback gains are determined by using the linear and linearized reduced order dynamic system equations. A linear Kalman filter for pump controlled system and an unscented Kalman filter for valve controlled system are designed for estimation and filtering purposes. The dynamic performances of both systems are investigated on an experimental test set up developed by conducting open loop and closed loop frequency response and step response tests. MATLAB Real Time Windows Target (RTWT) module is used in the tests for application purposes.

Thermal mass can be successfully implemented in the hot‐humid region of Austin, TX especially when well designed and with supplementary aids like nightcooling and day‐lighting. This study shows that in some situations thermal mass can be actually more beneficial at reducing electricity demands in hot‐humid regions than in the hot‐dry regions that are so emphasized in the literature. / text

Τα ασύρματα δίκτυα μικροαισθητήρων αποτελούνται από ένα πολύ μεγάλο πλήθος συσκευών που τοποθετούνται σε μία περιοχή ενδιαφέροντος και αυτοοργανώνονται σε ένα αδόμητο δίκτυο, προκειμένου να καταγράψουν/μετρήσουν/παρακολουθήσουν κάποια περιβαλλοντική μετρική ή φαινόμενο και εν συνεχεία να μεταφέρουν τα δεδομένα σε κάποιο κέντρο ελέγχου. Λόγω των πολύ περιορισμένων δυνατοτήτων των συσκευών, ειδικά όσον αφορά την εμβέλεια επικοινωνίας και τα αποθέματα ενέργειας, αλλά και λόγω του πλήθους τους, είναι απαραίτητη η ανάπτυξη νέων αλγορίθμων και πρωτοκόλλων σχεδιασμένων για τα ιδιαίτερα προβλήματα των δικτύων αισθητήρων. Στην παρούσα διατριβή παρουσιάζουμε έρευνα επικεντρωμένη στην ανάπτυξη, προσομοίωση και αξιολόγηση ενεργειακά αποδοτικών αλγορίθμων, δηλαδή βασικός στόχος είναι η ελαχιστοποίηση της κατανάλωσης ενέργειας. Παρά τη ραγδαία εξέλιξη της τεχνολογίας του υλικού το πρόβλημα βελτιστοποίησης της ενέργειας των συσκευών αισθητήρων παραμένει επίκαιρο αφού οι υπάρχουσες και άμεσα διαφαινόμενες λύσεις μέσω υλικού δεν έχουν δώσει ικανοποιητική απάντηση. Επικεντρώνουμε την έρευνά μας σε τρεις βασικές κατευθύνσεις που στοχεύουν στην εξοικονόμηση και βελτιστοποίηση της κατανάλωσης ενέργειας σε διαφορετικά επίπεδα. Κοινός στόχος είναι η μείωση του κόστους επικοινωνίας, μέσω της ανάδειξης καινοτόμων τεχνικών που δίνουν ώθηση στην ανάπτυξη νέων αλγορίθμων. Συγκεκριμένα, διερευνήσαμε τεχνικές κατανεμημένης προσαρμογής της λειτουργίας ενός πρωτοκόλλου όπου χρησιμοποιούμε πληροφορία διαθέσιμη τοπικά σε κάθε κόμβο ώστε με καθαρά τοπικές επιλογές, να βελτιώσουμε τη συνολική συμπε- ριφορά ενός πρωτοκόλλου. Επίσης προτείνουμε τεχνικές τοπικής συλλογής και εκμετάλλευσης περιορισμένης γνώσης των συνθηκών του δικτύου. Με ενεργειακά αποδοτικό τρόπο συλλέγουμε επιπλέον πληροφορία που χρησιμοποιούμε προκειμένου να επιτευχθούν βελτιστοποιήσεις όπως ο σχηματισμός ενεργειακά αποδοτικών, χαμηλής καθυστέρησης και ανθεκτικών σε σφάλματα μονοπατιών για μετάδοση δεδομένων. Ακόμα, διερευνούμε τεχνικές διαχείρισης της κινητικότητας σε περιπτώσεις δικτύων όπου χαρακτηριστικό είναι η κίνηση τόσο του κέντρου ελέγχου όσο και των συσκευών αισθητήρων. Εξετάσαμε μεθόδους διαπέρασης και κάλυψης του δικτύου από κινητά κέντρα ελέγχου που βασίζονται σε πιθανοτική κίνηση που ευνοεί την επίσκεψη κάποιων περιοχών με βάση τοπικά κριτήρια (συχνότητα προηγούμενων επισκέψεων, τοπική πυκνότητα δικτύου). Οι αλγόριθμοι που αναπτύσσουμε βασισμένοι σε αυτές τις τεχνικές λειτουργούν α) σε επίπεδο διαχείρισης της ίδιας της συσκευής, β) σε επίπεδο πρωτοκόλλου δρομολόγησης και γ) συνολικά σε επίπεδο δικτύου, αναδεικνύοντας μακροσκοπική συμπεριφορά από τοπικές αλληλεπιδράσεις. Οι αλγόριθμοι εφαρμόζονται σε περιπτώσεις δικτύων με διαφορές στην πυκνότητα, κατανομή κόμβων, διαθέσιμη ενέργεια αλλά και με ριζικές διαφοροποιήσεις στο μοντέλο αφού εξετάζουμε δίκτυα με παρουσία σφαλμάτων, σταδιακή ανάπτυξη κόμβων ακόμα και με κινούμενους κόμβους. Σε όλες αυτές τις περιπτώσεις οι τεχνικές μας πετυχαίνουν σημαντικά οφέλη γεγονός που αναδεικνύει την αξία τους σαν εργαλεία αλγοριθμικής σχεδίασης. / -

Network Coding is a new possibility to transmit data through a network. By combining different packets instead of simply forwarding, network coding offers the opportunity to reach the Min-Cut/Max-Flow capacity in multicast data transmissions. However, the basic schemes are vulnerable to so-called pollution attacks, where an attacker can jam large parts of the transmission by infiltrating only one bogus message. In the literature we found several approaches which aim at handling this kind of attack with different amounts of overhead. Though, the cost for a specific secure network coding scheme highly depends on the underlying network. The goal of this paper is on the one hand to describe which network parameters influence the efficiency of a certain scheme and on the other hand to provide concrete suggestions for selecting the most efficient secure network coding scheme considering a given network. We will illustrate that there does not exist “the best” secure network scheme concerning efficiency, but all selected schemes are more or less suited under certain network topologies.

Baigiamojo darbo užduotys – išanalizuoti mokslinę literatūrą, kurioje aprašomos pasyvių namų konstrukcijos; sukurti mechanizmą, kurį naudojant pagal pasirinktus kriterijus būtų galima įvertinti pastato atnaujinimo galimybes ir atsipirkimo laiką; aprašyti reikalavimus pastato atnaujinimui, kad atnaujintas jis atitiktų pasyviojo namo standartą. Darbą sudaro du skyriai. Pirmame skyriuje analizuojama mokslinė literatūra. Antrą skyrių sudaro trys poskyriai. Pirmame poskyryje aprašoma metodika, kuri bus naudojama pasirinkto statinio modernizavimo klausimui spręsti. Antrame poskyryje atliekami skaičiavimai pagal pirmojo poskyrio metodiką. Trečiame poskyryje atliekami pasirinkto statinio skaičiavimai „Pasyvių namų projektavimo programa“. Viską apibendrinus, pateikiamos išvados, kaip ir kokias konstrukcijas naudoti, norint atnaujinti pasirinktą objektą taip, kad jis atitiktų pasyvaus namo standartą. / Thesis assignments are to analyse scientific literature which describes passive house constructions, to create a mechanism using which, according to a selected criteria, it would be possible to evaluate building‘s renovation possibilities and the payback period; also, to depict the requirements for building renovation as upgraded it would meet the passive house standard. The paper consists of two parts. The first part deals with the scientific literature. The second consists of the three subsections. The first subsection involves a description of the methodology, which will be used for solving the chosen building‘s modernization issue. In the second section according to the methodology mentioned, calculations will be performed. The third subsection deals with the calculations of the chosen building by using “ Passive House Planning Package“. Finally, it will be concluded how and which structures to use in order to upgrade the selected object so that it would meet the passive house standard.

Probabilistic-Write/Copy-Select (PWCS) is a novel synchronization scheme suggested by Nicholas Mc Guire which avoids expensive atomic operations for synchronizing access to shared objects. Instead, PWCS makes inconsistencies detectable and recoverable. It builds on the assumption that, for typical workloads, the probability for data races is very small. Mc Guire describes PWCS for multiple readers but only one writer of a shared data structure. In this paper, we report on the formal analysis of the PWCS protocol using a continuous-time Markov chain model and probabilistic model checking techniques. Besides the original PWCS protocol, we also considered a variant with multiple writers. The results were obtained by the model checker PRISM and served to identify scenarios in which the use of the PWCS protocol is justified by guarantees on the probability of data races. Moreover, the analysis showed several other quantitative properties of the PWCS protocol.

With the rapid advancement of mobile devices, people have become more attached to them than ever. This rapid growth combined with millions of applications (apps) make smartphones a favourite means of communication among users. In general, the available contents on smartphones, apps and the web, come into two versions: (i) free contents that are monetized via advertisements (ads), and (ii) paid ones that are monetized by user subscription fees. However, the resources (energy, bandwidth, processing power) on-board are limited, and the existence of ads in either websites or free apps can adversely impact these resources. These issues brought the need for good understanding of the mobile advertising eco-system and how such limited resources can be efficiently used. This thesis focuses on mobile web browsing. Surfing web-pages on smatphones is one of the most commonly used task among smartphone users. However, web-page complexity is increasing, especially when designed for desktop computers. On one hand, the existence of ads in web-pages is essential for publishers' monetization strategy. On the other hand, their existence in webpages leads to even higher complexity of the webpages. This complexity in the smartphone environment, where the battery and bandwidth resources are limited, is reflected in longer loading time, more energy consumed, and more bytes transferred. With this view, quantifying the energy consumption due to web ads in smartphones is essential for publishers to optimize their webpages, and for system designers to develop an energy-aware applications (browsers) and protocols. Apart from their energy impact, ads consume network bandwidth as well. Therefore, quantifying the bandwidth consumption due to downloading web ads is crucial to creating more energy and bandwidth aware applications. This thesis first classifies web content into: (i) core information, and (ii) forced ``unwanted" information, namely ads. Then, describes an approach that enables the separation of web content in a number of a websites. Having done so, the energy cost due to downloading, rendering, and displaying web ads over Wi-Fi and 3G networks is evaluated. That is, how much energy web ads contribute to the total consumed energy when a user accesses the web. Furthermore, the bandwidth consumed by web ads in a number of well-known websites is also evaluated. Motivated by our findings about ads' impact on the energy and bandwidth, the thesis proposes and implements a novel web-browsing technique that adapts the webpages delivered to smartphones, based on a smartphone's current battery level and the network type. Webpages are adapted by controlling the amount of ads to be displayed. Validation tests confirm that the system, in some cases, can extend smartphone battery life by up to ~ 30\% and save wireless bandwidth up to ~ 44\%.