This dissertation addresses some of the most important issues in delay-sensitive communication over wireless systems and networks. Traditionally, the design of communication networks adopts a layered framework where each layer serves as a “black box” abstraction for higher layers. However, in the context of wireless networks with delay-sensitive applications such as Voice over Internet Protocol (VoIP), on-line gaming, and video conferencing, this layered architecture does not offer a complete picture. For example, an information theoretic perspective on the physical layer typically ignores the bursty nature of practical sources and often overlooks the role of delay in service quality. The purpose of this dissertation is to take on a cross-disciplinary approach to derive new fundamental limits on the performance, in terms of capacity and delay, of wireless systems and to apply these limits to the design of practical wireless systems that support delay-sensitive applications. To realize this goal, we consider a number of objectives. 1. Develop an integrated methodology for the analysis of wireless systems that support delay-sensitive applications based, in part, on large deviation theory. 2. Use this methodology to identify fundamental performance limits and to design systems which allocate resources efficiently under stringent service requirements. 3. Analyze the performance of wireless communication networks that takes advantage of novel paradigms such as user cooperation, and multi-antenna systems. Based on the proposed framework, we find that delay constraints significantly influence how system resources should be allocated. Channel correlation has a major impact on the performance of wireless communication systems. Sophisticated power control based on the joint space of channel and buffer states are essential for delaysensitive communications.

This thesis reports the development of a wide-bandwidth high-sensitivity mode-decoupled MEMS gyroscope showing robustness against ambient pressure variations. The designed gyroscope is based on a novel 2 degrees of freedom (DoF) sense mode oscillator, which allows increasing the operation bandwidth to the amount required by tactical-grade and inertial-grade operations while reaching the mechanical sensitivity of near matched-mode vibratory gyroscopes. Thorough theoretical study and finite element simulations verify the high performance operation of the proposed 2 DoF sense mode oscillator design. The designed gyroscope is fabricated using the in-house developed silicon-on-glass (SOG) micromachining technology at METU Microelectronics (METU-MET) facilities. The fabricated gyroscope measures only 5.1 x 4.6 mm square. The drive mode oscillator of the gyroscope reaches quality factor of 8760 under 25 mTorr vacuum environment, owing to high quality single crystal silicon structural layer. The sense mode bandwidth is measured to reach 2.5 kHz at 40 V proof mass voltage. When the fabricated gyroscope is operated with a relatively wide bandwidth of 1kHz, measurements show a relatively high raw mechanical sensitivity of 131 uV/(deg/s). Fabricated gyroscope is hybrid connected to external closed-loop drive mode amplitude control and open-loop sense mode readout electronics developed at METU-MEMS research group, to form a complete angular rate measurement system (ARMS). The scale factor of the ARMS is measured to be 13.1 mV/(deg/s) with a maximum R square nonlinearity of 0.0006 % and a maximum percent deviation nonlinearity of 0.141 %, while the maximum deviation of the scale factor for large vacuum level variations between 40 mTorr to 500 mTorr is measured to be only 0.38 %. The bias stability and angle random walk of the gyroscope are measured to be 131 deg/h and 1.15 deg/ rooth, respectively. It is concluded that, the mechanical structure can be optimized to show its theoretical limits of sensitivity with improvements in fabrication tolerances. The proposed 2 DoF sense mode oscillator design shows the potential of tactical-grade operation, while demonstrating extreme immunity to ambient pressure variations, by utilizing an optimized mechanical structure and connecting the gyroscope to dedicated low-noise electronics.

Alpha-Beta transition in quartz is studied using the Raman scattering. The Raman frequencies of some lattice modes are analyzed at various temperatures close to the alpha beta transition in quartz. For this analysis, the experimental data from the literature is used and the soft mode behavior of those Raman phonons is investigated . On the basis of the predictions of some models, the temperature dependencies for the Raman frequencies of the lattice modes which move towards zero (soft mode) and their bandwidths close to the transition temperature Tc are explained for the alpha-beta transition in quartz. In addition, by using the experimental volume data from literature, calculation of the temperature dependence of the Raman frequencies through the Gr&uuml / neisen parameter have been studied near the phase transition.

The objective of the proposed research is to develop a probabilistic model of speech production that exploits the multiplicity of mapping between the vocal tract area functions (VTAF) and speech spectra. Two thrusts are developed. In the first, a latent variable model that captures uncertainty in estimating the VTAF from speech data is investigated. The latent variable model uses this uncertainty to generate many-to-one mapping between observations of the VTAF and speech spectra. The second uses the probabilistic model of speech production to improve the performance of traditional speech algorithms, such as enhancement, acoustic model adaptation, etc. In this thesis, we propose to model the process of speech production with a probability map. This proposed model treats speech production as a probabilistic process with many-to-one mapping between VTAF and speech spectra. The thesis not only outlines a statistical framework to generate and train these probabilistic models from speech, but also demonstrates its power and flexibility with such applications as enhancing speech from both perceptual and recognition perspectives.

<p>A design of anautomatic network capacity markets, oftenreferred to as a bandwidth market, is presented. Three topicsare investigated. First, a network model is proposed. Theproposed model is based upon a trisection of the participantroles into network users, network owners, and market middlemen.The network capacity is defined in a way that allows it to betraded, and to have a well defined price. The network devicesare modeled as core nodes, access nodes, and border nodes.Requirements on these are given. It is shown how theirfunctionalities can be implemented in a network. Second, asimulated capacity market is presented, and a statisticalmethod for estimating the price dynamics in the market isproposed. A method for pricing network services based on sharedcapacity is proposed, in which the price of a service isequivalent to that of a financial derivative contract on anumber of simple capacity shares.Third, protocols for theinteraction between the participants are proposed. The marketparticipants need to commit to contracts with an auditableprotocol with a small overhead. The proposed protocol is basedon a public key infrastructure and on known protocols for multiparty contract signing. The proposed model allows networkcapacity to be traded in a manner that utilizes the networkeciently. A new feature of this market model, compared to othernetwork capacity markets, is that the prices are not controlledby the network owners. It is the end-users who, by middlemen,trade capacity among each-other. Therefore, financial, ratherthan control theoretic, methods are used for the pricing ofcapacity.</p><p><b>Keywords:</b>Computer network architecture, bandwidthtrading, inter-domain Quality-of-Service, pricing,combinatorial allocation, financial derivative pricing,stochastic modeling</p>

This dissertation presents the first reported systematic investigation on the implementation of multilayer patch antennas over Fe3O4-based polymer nanocomposite (PNC) magneto-dielectric substrates. The PNC substrate is created by the monodispersion of Fe3O4 nanopthesiss, with mean size of 7.5nm, in a polymeric matrix of Polydimethylsiloxane (PDMS). Recently, magneto-dielectric substrates have been proposed by several researchers as a means for decreasing the size and increasing the bandwidth of planar antennas. Nevertheless, factors such as high loss and diminished control over magnetic and dielectric properties have hindered the optimal performance of antennas. In addition, the incompatibility and elevated complexity prevents integration of conventional magnetic materials with antennas and standard fabrication processes at printed circuit boards (PCBs) and wafer levels. Additionally, the low hysteresis losses exhibited by uniformly embedded superparamagnetic nanopthesiss complemented by the ease of integration of polymer nanocomposites in standard fabrication processes, offer promising solutions to resolve any of the complications and concerns foresaid. Towards this dissertation work, one multilayer antenna was constructed over a molded PDMS substrate along with three similar antennas built on PDMS-Fe3O4 PNC substrates with different Fe3O4 nanopthesis loading concentrations in the PDMS matrix of 80%, 50% and 30% by weight. This pioneering work in the experimental implementation and characterization of magneto-dielectric PNC antennas has not only resulted in antennas with different operational frequencies in the 3-5GHz band, but also expanded our knowledge base by correlating the concentration of magnetic nanopthesiss to key antenna performance metrics such as antenna bandwidth, antenna efficiency and miniaturization factors. Among the most significant results a magneto-dielectric antenna with maximum miniaturization factor of 57%, and a 58% increase in bandwidth, whilst retaining an acceptable antenna gain of 2.12dBi, was successfully demonstrated through the deployment of molded PDMS-Fe3O4 PNC substrate under external DC bias magnetic fields. This dissertation also presents a versatile process for constructing flexible and multilayer antennas by the seamless incorporation of a variety of materials such as PDMS, Liquid Crystal Polymer (LCP) laminates, metal clads and molded magneto-dielectric polymer nanocomposites with evenly embedded magnetic nanopthesiss.

Κεντρικό αντικείμενο αυτής της Διδακτορικής Διατριβής αποτελεί η μελέτη του συνδυασμού δύο εκ των βασικότερων εξελίξεων που σχετίζονται με το επίπεδο του IP πρωτοκόλλου στο Internet: της δυνατότητας για την παροχή εγγυήσεων ποιότητας (Quality of Service) σε τμήμα της συνολικής κίνησης που διακινείται μέσα από τα IP δίκτυα, καθώς και της ανάγκης αναβάθμισης του IPv4 πρωτοκόλλου στο IPv6. Επίσης αντικείμενο της παρούσας εργασίας είναι η ανάπτυξη μηχανισμών και αλγορίθμων για την αποδοτική διαχείριση των πόρων, τον όσο το δυνατόν δίκαιο καταμερισμό της ποιότητας υπηρεσίας, καθώς και τη δυνατότητα συνεργασίας και διαλειτουργικότητας μεταξύ διαφορετικών αυτόνομων δικτυακών τμημάτων με αυτοματοποιημένο τρόπο (χωρίς δηλαδή να χρειάζεται η παρέμβαση ενός ανθρώπου διαχειριστή στις περισσότερες περιπτώσεις). Για το σκοπό αυτό έχουν προταθεί διάφορες προσεγγίσεις όσον αφορά μεσίτες εύρους ζώνης, οι οποίες μελετώνται στην εργασία αυτή, ενώ προτείνονται αλγόριθμοι και μηχανισμοί για τη βελτίωση της λειτουργίας και της απόδοσής τους. Το IPv4 είχε τη δυνατότητα υλοποίησης μηχανισμών QoS στο επίπεδο δικτύου με τη χρήση του πεδίου TOS (Type Of Service). Στην πράξη όμως το πεδίο αυτό έμεινε σε μεγάλο βαθμό ανεκμετάλλευτο. Το IPv6 επεκτείνει και βελτιώνει την ιδέα αυτή, παρέχοντας δύο νέα πεδία στην στάνταρ επικεφαλίδα, τα Traffic Class και Flow Label, τα οποία μπορούν να χρησιμοποιηθούν προς αυτήν την κατεύθυνση. Η χρήση των πεδίων αυτών, όπως και γενικότερα η χρήση του IPv6 βρίσκονται ακόμα σε πειραματικό επίπεδο. Καθώς όμως το IPv6 περνάει σιγά-σιγά στο προσκήνιο και ετοιμάζεται να υποκαταστήσει το κυρίαρχο έως τώρα IPv4, παρουσιάζει ιδιαίτερο ενδιαφέρον η διερεύνηση του τρόπου με τον οποίο θα αξιοποιηθούν πρακτικά οι QoS δυνατότητες που προσφέρει το IPv6. Μία σημαντική παράμετρος της υποστήριξης QoS Μηχανισμών από άκρο σε άκρο είναι η συνεργασία μεταξύ διαφορετικών αυτόνομων τμημάτων (domains) που απαιτείται προκειμένου η κίνηση να υφίσταται προνομιακή μεταχείριση καθ’ όλη τη διαδρομή της και να της παρέχονται οι αναγκαίες εγγυήσεις ποιότητας. Η διαπραγμάτευση της συνεργασίας αυτής είναι σαφές ότι πρέπει να είναι όσο το δυνατόν αυτοματοποιημένη για να μπορούν τέτοιου είδους υπηρεσίες να γνωρίσουν ευρύτερη διάδοση. Για το σκοπό αυτό έχει από το RFC 2638 της IETF οριστεί η μονάδα του Bandwidth Broker (μεσίτης εύρους ζώνης). Ελέγχει το δικτυακό φόρτο αποδεχόμενη ή απορρίπτοντας αιτήματα για συγκεκριμένο bandwidth με εγγυήσεις QoS. Οι Bandwidth Brokers χρειάζεται να εγκαθιδρύσουν σχέσεις περιορισμένης εμπιστοσύνης με τις αντίστοιχες μονάδες στα γειτονικά domains, αντίθετα με άλλες αρχιτεκτονικές που απαιτούν τον καθορισμό των χαρακτηριστικών μιας ροής στους δρομολογητές κατά μήκος του από άκρο σε άκρο μονοπατιού. Επομένως η αρχιτεκτονική του Bandwidth Broker δίνει τη δυνατότητα να κρατηθεί η πληροφορία στο επίπεδο του διαχειριστικού domain, αντί να πρέπει να κρατηθεί σε κάθε δρομολογητή, και η DiffServ αρχιτεκτονική δίνει τη δυνατότητα να περιοριστεί η πληροφορία αυτή μόνο για τους ακραίους δρομολογητές κάθε domain. Στα πλαίσια της εργασίας αυτής ασχοληθήκαμε επίσης με τη μονάδα ελέγχου αποδοχής ενός Bandwidth Broker. Προτείνεται και αξιολογείται ένας προσαρμοστικός αλγόριθμος για αιτήματα κράτησης πόρων που καταφτάνουν νωρίτερα από τον καθορισμένο χρόνο έναρξης της κράτησης. Το γεγονός αυτό επιτρέπει στον αλγόριθμο να συγκεντρώνει ένα σύνολο από πολλαπλά αιτήματα και να κάνει καλύτερη αξιοποίηση του δικτύου, χρησιμοποιώντας την υπάρχουσα βιβλιογραφία για προβλήματα χρονοδρομολόγησης. Η σημασία της παρακολούθησης και της προσαρμογής της υπολογιστικής επιβάρυνσης για τον Bandwidth Broker φαίνεται σαφέστερα όταν υπάρχει μεγάλος ρυθμός άφιξης αιτημάτων, ενώ το ζητούμενο bandwidth για κάθε κράτηση είναι μικρό, όπως στην περίπτωση πολλαπλών VoIP αιτημάτων σε μία σύνδεση υψηλού bandwidth. / The main goal of this dissertation is the study of two of the main developments related to the Internet network layer: the provisioning of Quality of Service guarantees to part of the total traffic traversing ΙΡ networks, as well as the need for upgrading the IPv4 protocol to IPv6. Also goal of this dissertation is the development of mechanisms and algorithms for the effective administration of resources, the best possible fairness in distributing the quality of service, and the possibility of cooperation and interoperability between different domains in an automated way (without the need for human intervention in most cases). For this reason, a number of approaches have been proposed related to Bandwidth Brokers. These approaches are studied in this dissertation, while new algorithms and mechanisms are proposed for the improvement of their operation and performance. IPv4 was capable of supporting QoS mechanisms at the network layer using the TOS field (Type Of Service). IPv6 advances and improves on this idea, by supplying two new fields in the standard header, called Traffic Class and Flow Label, which can be used for this purpose. The usage of these fields, as well as the usage of IPv6 is still at an early stage. However, while IPv6 comes to the foreground and becomes mature enough to replace the dominant IPv4, it is especially interesting to investigate the way that IPv6 QoS capabilities are practically going to be exploited. An important parameter for supporting end-to-end QoS mechanisms is the interaction between multiple domains so that the designated traffic is subjected to preferential treatment along the whole path. The negotiation of this interaction clearly has to be as much automated as possible, if such services are to be widely supported. For this reason, RFC 2638 from IETF has defined the Bandwidth Broker entity. According to the RFC definition, it controls the network load by accepting or rejecting requests for specific bandwidth with QoS guarantees. Bandwidth Brokers only need to establish relationships of limited trust with their peers in adjacent domains, unlike schemes that require the setting of flow specifications in routers throughout an end-to-end path. In practical technical terms, the Bandwidth Broker architecture makes it possible to keep state on an administrative domain basis, rather than at every router and the service definitions of Premium and Assured service make it possible to confine per flow state to just the leaf routers. In the framework of this dissertation we have also studied the admission control module of a Bandwidth Broker. An adaptive algorithm for advance resource reservation requests is proposed and evaluated. The algorithm gathers and evaluates multiple requests in order to better utilize the network, using previous work on timescheduling problems. The importance of monitoring and adapting the computational overhead for the Bandwidth Broker is clearly demonstrated for high request arrival rates and small bandwidth requests, such as the case for multiple VoIP requests that use a high bandwidth link.

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Due to its ability to deliver scalable and fault-tolerant solutions, applications based on the peer-to-peer (P2P) paradigm are used by millions of users on the internet. Recently, wireless mesh networks (WMNs) have attracted a lot of interest from both academia and industry, because of their potential to provide flexible and alternative broadband wireless internet connectivity. However, due to various reasons such as unstable wireless link characteristics and multi-hop forwarding operation, the performance of current P2P systems is rather low in WMNs. This dissertation studies the technological challenges involved while deploying P2P systems over WMNs. We study the benefits of location-awareness and resource replication to the P2P overlay while targeting efficient resource lookup in WMNs. We further propose a cross-layer information exchange between the P2P overlay and the WMN in order to reduce resource lookup delay by augmenting the overlay routing table with physical neighborhood and resource lookup history information. Aiming to achieve throughput maximization and fairness in P2P systems, we model the peer selection problem as a mathematical optimization problem by using a set of mixed integer linear equations. A study of the model reveals the relationship between peer selection, resource replication and channel assignment on the performance of P2P systems over WMNs. We extend the model by formulating the P2P download problem as chunk scheduling problem. As a novelty, we introduce constraints to model the capacity limitations of the network due to the given routing and channel assignment strategy. Based on the analysis of the model, we propose a new peer selection algorithm which incorporates network load information and multi-path routing capability. By conducting testbed experiments, we evaluate the achievable throughput in multi-channel multi-radio WMNs. We show that the adjacent channel interference (ACI) problem in multi-radio systems can be mitigated, making better use of the available spectrum. Important lessons learned are also outlined in order to design practical channel and channel bandwidth assignment algorithms in multi-channel multi-radio WMNs.

<p>Covert Channels have existed for more than twenty years now. Although they did not receive a special attention in their early years, they are being more and more studied nowadays. This work focuses on network covert channels and it attempts to give an overview on their basics to later analyse several existing implementations which may compromise the security perimeter of a corporate network. The features under study are the bandwidth provided by the channel and the ease of detection. The studied tools have turned out to be in most cases unreliable and easy to detect with current detection techniques and the bandwidth provided is usually moderate but they might pose a threat if not taken into consideration.</p>