Optical networks offering ultra-high capacity and low energy consumption per bit are considered as a good option to handle the rapidly growing traffic volume inside data center (DCs). However, most of the optical interconnect architectures proposed for DCs so far are mainly focused on the aggregation/core tiers of the data center networks (DCNs), while relying on the conventional top-of-rack (ToR) electronic packet switches (EPS) in the access tier. A large number of ToR switches in the current DCNs brings serious scalability limitations due to high cost and power consumption. Thus, it is important to investigate and evaluate new optical interconnects tailored for the access tier of the DCNs. We propose and evaluate a passive optical ToR interconnect (POTORI) architecture for the access tier. The data plane of the POTORI consists mainly of passive components to interconnect the servers within the rack as well as the interfaces toward the aggregation/core tiers. Using the passive components makes it possible to significantly reduce power consumption while achieving high reliability in a cost-efficient way. Meanwhile, our proposed POTORI’s control plane is based on a centralized rack controller, which is responsible for coordinating the communications among the servers in the rack. It can be reconfigured by software-defined networking (SDN) operation. A cycle-based medium access control (MAC) protocol and a dynamic bandwidth allocation (DBA) algorithm are designed for the POTORI to efficiently manage the exchange of control messages and the data transmission inside the rack. Simulation results show that under realistic DC traffic scenarios, the POTORI with the proposed DBA algorithm is able to achieve an average packet delay below 10 μs with the use of fast tunable optical transceivers. Moreover, we further quantify the impact of different network configuration parameters on the average packet delay. / <p>QC 20170503</p>

No description available.

In the past decades, wireless Machine-to-Machine (M2M) networks have been developed in various industrial and public service areas and envisioned to improve our daily life in next decades, e.g., energy, manufacturing, transportation, healthcare, and safety. With the advantage of low cost, flexible deployment, and wide coverage as compared to wired communications, wireless communications play an essential role in providing information exchange among the distributed devices in wireless M2M networks. However, an intrinsic problem with wireless communications is that the limited radio spectrum resources may result in unsatisfactory performance in the M2M networks. With the number of M2M devices projected to reach 20 to 50 billion by 2020, there is a critical need to solve the problems related to the design and applications in the wireless M2M networks. In this dissertation work, we study the wireless M2M networks design from three closely related aspects, the wireless M2M communication reliability, efficiency, and Demand Response (DR) control in smart grid, an important M2M application taking the advantage of reliable and efficient wireless communications. First, for the communication reliability issue, multiple factors that affect communication reliability are considered, including the shadowing and fading characteristics of wireless channels, and random network topology. A general framework has been proposed to evaluate the reliability for data exchange in both infrastructure-based single-hop networks and multi-hop mesh networks. Second, for the communication efficiency issue, we study two challenging scenarios in wireless M2M networks: one is a network with a large number of end devices, and the other is a network with long, heterogeneous, and/or varying propagation delays. Media Access Control (MAC) protocols are designed and performance analysis are conducted for both scenarios by considering their unique features. Finally, we study the DR control in smart grid. Using Lyapunov optimization as a tool, we design a novel demand response control strategy considering consumer’s comfort requirements and fluctuations in both the renewable energy supply and customers’ load demands. By considering those unique features of M2M networks in data collection and distribution, the analysis, design and optimize techniques proposed in this dissertation can enable the deployment of wireless M2M networks with a large number of end devices and be essential for future proliferation of wireless M2M networks. / Graduate / 0544 / flintlei@gmail.com

In this thesis, research is described which leads to the proposal of a link-directionality-based dual channel MAC (Medium Access Control) protocol (DCP) for carrier sense wireless ad hoc networks. It attempts to double the capacities of such networks using an industrial standard (the single-channel IEEE 802.11 protocol) as a benchmark. Simulations show that the proposed scheme can increase the capacities to more than 1.7 times of the single-channel IEEE 802.11 protocol in large-scale random network topologies. The algorithm, however, requires extra radio spectrum resource which could be costly. In addition to DCP, a signal-to-interference ratio comparison algorithm (SCA) is proposed to further release the protocol constraints imposed by the virtual carrier-sensing mechanism. Interestingly, while the capacity of the pure DCP decreases when link lengths are short, the capacity of the pure SCA increases when link lengths are short. The two algorithms compensate for the downside of each other to bring about a more uniform capacity improvement. Simulations show that the integrated scheme can further increase the network throughputs to more than 2.13 times in random topologies. This thesis also clarifies inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). By colouring the l-graphs, independent data streams obtained by Multi-Carrier Code Division Multiple Access (MC-CDMA) are assigned for transmitting up-link and down-link traffic separately in order to eliminate the hidden-node and exposed-node problems in wireless local area networks (WLAN). Finally, a generic approach for capacity analysis is proposed to show that the concept of link-directionality can also be adopted with other network models, protocols and parameter settings. However, in certain scenarios where links are densely packed together, the advantage of using link-directionality could be diminished. Therefore, the proposed generic approach for capacity analysis allows one to determine whether channel allocations according to link-directionalities should be applied to a given network.

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

A wireless local area network (WLAN) provides high bandwidth to users in a limited geographical area. This network faces certain challenges and constraints that are not imposed on their wired counterparts. They are: frequency allocation, interference and reliability, security, power consumption, human safety, mobility, connection to wired LAN,service area, handoff and roaming, dynamic configuration and the throughput. But the wireless medium relies heavily on the features of MAC protocol and the MAC protocol is the core of medium access control for WLANs. The available MAC protocols all have their own merits and demerits. In our research works, we propose a hybrid MAC protocol forWLAN. In the design, we have combined the merits of the TDMA and CDMA systems to improve the throughput of the WLAN in a picocellular environment. We have used the reservation and polling methods of MAC protocols to handle both the low and high data traffics of the mobile users. We have strictly followed the standards specified by IEEE 802.11 for WLANs to implement the designed MAC protocol. We have simulated the hybrid TDMA/CDMA based MAC protocols combined with RAP (Randomly Addressed Polling) for Wireless Local Area Networks. We have developed a closed form mathematical expressions analytically for this protocol. We have also studied the power control aspects in this environment and we derived a closed form mathematical expressions analytically for this power control technique. This hybrid protocol is capable of integrating different types of traffic (like CBR,VBR and ABR services) and compiles with the requirements of next-generation systems.The lower traffic arrival is dealt with the Random Access and the higher traffic arrival is with the Polling methods. This enables us to obtain higher throughput and lowmean delay performance compared to the contention-reservation-based MAC schemes. The protocol offers the ability to integrate different types of services in a flexible way by the use of multiple slots per frame, while CDMA allows multiple users to transmit simultaneously using their own codes. The RAP uses an efficient "back-off" algorithm to improve throughput at higher arrival rates of user's data. The performance is evaluated in terms of throughput, delay, and rejection rate using computer simulation. A detailed simulation is carried out regarding the maximum number of users that each base station can support on a lossy channel. This work has analyzed the desired user's signal quality in a single cell CDMA (Code Division Multiple Access) system in the presence of MAI (Multiple Access Interference). Earlier power control techniques were designed to assure that all signals are received with equal power levels. Since these algorithms are designed for a imperfect control of power, the capacity of the system is reduced for a given BER (Bit-Error Rate). We proposed an EPCM (Efficient Power Control Mechanism) based system capacity which is designed for the reverse link (mobile to base station) considering the path loss, log-normal shadowing and Rayleigh fading. We have simulated the following applications for the further improvement of the performance of the designed MAC protocol:Designed protocol is tested under different traffic conditions. The protocol is tested for multimedia traffic under application oriented QoS requirements. Buffer Management and resource allocation. Call Admission Control (hand-offs, arrival of new users). The adaptability to the variable nature of traffic.The propagation aspects in the wireless medium. The proposed MAC protocol has been simulated and analysed by using C++/MATLAB Programming in IBM/SUN-SOLARIS UNIX environment. The results were plotted using MATLAB software. All the functions of the protocol have been tested by an analysis and also by simulation. Call admission control function of the protocol has been tested by simulation and analysis in a multimedia wireless network topology and from analysis we found that at low traffic the throughput is high and at high traffic the throughput is kept constant at a reasonable high value. The simulation results also justify/ coordinate the analysis results. Dynamic channel allocation function of the protocol was tested and analysed and the coordinated results show that at low traffic, high throughput and at high traffic the throughput is constant. Buffer management function of the protocol simulation shows the results that the packet loss can be controlled to a minimum by adjusting the buffer threshold level at any traffic conditions. Maintenance of data transfer during the hand-offs function was simulated and the results show that the blocked calls are less during low traffic and at high traffic the blocked calls can be kept constant at low value. Thus, the proposed model aimed at having high throughput, high spectral efficiency, low delay, moderate BER and moderate blocking probability. We have considered a pico cell with a maximum of several users and studied the power efficiency of combined channel coding and modulation with perfect power controlled CDMA system. Thus our simulation of the "software radio" has flexibility in choosing the proper channel coders dynamically depending upon the variations of AWGN channel.

Les progrès technologiques permettent aujourd'hui l’intégration à bas coût d'objets multi-capteurs hétérogènes communicants sans fil notamment pour la surveillance dans les environnements considérés à risques ou non accessibles. Le but de ces travaux de thèse est de contribuer à la sécurisation des personnes et de leur environnement de vie par la mise en réseau de dispositifs multi-capteurs de mesures sans fil. Ceux-ci doivent être spécifiés et configurés pour rendre par exemple l'environnement qu'ils surveillent intelligent et sécurisé. Le travail effectué porte sur la conception et le prototypage réel d’un réseau composé de dispositifs hétérogènes autonomes en énergie. Nos contributions comportent trois volets essentiels :Le premier volet concerne la conception d’un modèle de réseau ambiant adapté : nous avons proposé un modèle qui repose sur une architecture multi-niveaux caractérisée par des nœuds hétérogènes dont le captage (détection), le traitement et le stockage des données sont distribués par niveau. Cette architecture hiérarchique offre plusieurs avantages par rapport aux architectures linéaires classiques en termes d’évolutivité, de faible coût, de meilleure couverture, de hautes fonctionnalités et de fiabilité. Nous avons défini le comportement adapté pour chaque nœud dans le modèle et montré l’avantage de la solution par la simulation.Le deuxième volet concerne la proposition originale d’un protocole d’accès au médium efficace en énergie nommé « T-TMAC » et adapté à l’application, permettant d'organiser les échanges des messages dans l’architecture du réseau retenu. L’originalité du protocole est qu’il est composé de mécanismes de maintenance performants permettant la gestion de la mobilité et la reconfiguration du réseau (ajout et suppression d’un capteur). Pour cela, une adaptation et un paramétrage du standard IEEE 802.15.4 sont proposés.Le dernier volet présente l’évaluation et l’analyse de performances du protocole développé dans le cadre de scénarios de tests. Nous avons étudié en particulier l’impact de la taille des données et la périodicité de transfert sur l’énergie et le délai. Le protocole est validé à l’aide d’un modèle analytique dont les résultats ont été comparés à ceux obtenus par prototypage matériel. / Today technological advances allow low-cost deployment of wireless heterogeneous sensors in specific environments such as those considered risky or not accessible. The aim of this thesis is to contribute to the application of Wireless Sensor Networks (WSN) for health-care monitoring. Currently the integrated sensors must be specified and configured to make the monitored environment intelligent and secured. Our work focuses on the design of this network and the prototyping of the real devices that constitute it. Our contributions include three key components:The first part concerns the design of an ambient adapted network: we proposed a model based on a network architecture characterized by multiple tiers with heterogeneous nodes distributed: sensing, processing and data storage. This architecture offers more advantages than classical single tier architecture in terms of scalability, low cost, coverage, functionality and reliability. We have defined the appropriate behavior for each node in this network model and we showed the advantages of our solution through simulation.The second part deals with the proposition of an energy efficient medium access protocol named "T-TMAC": the protocol is adapted to the application requirements. It permits to organize the data exchange in the chosen network architecture. The originality of this protocol is that it includes efficient maintenance mechanisms that allow managing mobility and network reconfiguration (addition of a sensor, removing a sensor). In this way an adaptation and a parameterization of the IEEE 802.15.4 Standard are proposed.The final part of this work presents the performance evaluation and analysis of the proposed MAC protocol in use cases. We studied the impact of packets size and dissemination interval parameters on energy and delay. The protocol is validated by an analytical model. We proposed a reel evaluation by prototyping. A comparison of results obtained from the different approaches is finally presented.

Abstract In this thesis we study the spatial throughput of interference-limited wireless networks from different perspectives, considering that the spatial distribution of nodes follows a 2-dimensional homogeneous Poisson point process and transmitters employ Gaussian point-to-point codes. To carry out this analysis, we model the interrelations between network elements using concepts from stochastic geometry, communication theory and information theory. We derive closed-form equations to compute/approximate the performance metric that is chosen to evaluate the system for each given specific scenario. Our first contribution is an investigation about whether it is preferable to have a large number of short single-hop links or a small number of long hops in multi-hop wireless networks, using a newly proposed metric denominated aggregate multi-hop information efficiency. For single-hop systems, we revisit the transmission capacity framework to study medium access protocols that use asynchronous transmissions and allow for packet retransmissions, showing when a carrier sensing capability is more suitable than synchronous transmissions, and vice-versa. We also cast the effective link throughput and the network spatial throughput optimization problems to find the combination of medium access probability, coding rate and maximum number of retransmissions that maximize each metric under packet loss and queue stability constraints, evincing when they do (and do not) have the same solution. Furthermore we analyze the expected maximum achievable sum rates over a given area – or spatial capacity – based on the capacity regions of Gaussian point-to-point codes for two decoding rules, namely (i) treating interference as noise (IAN) and (ii) jointly detecting the strongest interfering signals treating the others as noise (OPT), proving the advantages of the second. We additionally demonstrate that, when the same decoding rule and network density are considered, the spatial-capacity-achieving scheme always outperforms the spatial throughput obtained with the best predetermined fixed rate strategy. With those results in hand, we discuss general guidelines on the construction of ad hoc adaptive algorithms that would improve the information flow throughout the interference network, respecting the nodes’ internal and external constraints. / Tiivistelmä Tässä työssä tutkitaan häiriörajoitteisten langattomien verkkojen tila-alueen suorituskykyä, olettaen verkkosolmujen sijoittuvan 2-ulotteisen Poissonin pisteprosessin mukaisesti, sekä olettaen lähettimien hyödyntävän Gaussisia pisteestä-pisteeseen -koodeja. Suorituskykyanalyysi pohjautuu stokastiseen geometriaan, tietoliikenneteoriaan sekä informaatioteoriaan. Suljetun muodon suorituskyky-yhtälöitä hyödyntäen arvioidaan suorityskykymetriikoita eri skenaarioissa. Työn aluksi esitetään uusi monihyppyverkkojen informaatiotehokkuuteen perustuva metriikka. Sen avulla voidaan tutkia onko tehokkaampaa käyttää useita lyhyen hypyn linkkejä vai pienempää määrää pidempien hyppyjen linkkejä. Yhden hypyn verkoissa tutkitaan mediaanpääsyprotokollia asynkronisissa verkoissa pakettien uudelleenlähetykseen perustuen ja verrataan tätä synkroniseen lähetykseen ilman vapaan kanavan tunnistusmekanismia. Työssä tutkitaan myös linkin efektiivisen suorituskyvyn ja verkon tila-alueen suorituskyvyn optimointia, jotta sopiva yhdistelmä mediaan pääsyn todennäköisyydelle, koodausnopeudelle ja uudelleenlähetysten maksimilukumäärälle löytyisi ja samalla maksimoisi jokaisen käytetyn metriikan ehdollistettuna paketin menetyksille ja jonon stabiilisuudelle. Lisäksi arvioidaan maksimaalista odotettavaa nettosiirtonopeutta tietyllä alueella, eli tila-alueen kapasiteettia, Gaussimaisen pisteestä-pisteeseen koodien kapasiteettialueisiin perustuen kahta eri dekoodaussääntöä hyödyntäen: (i) olettaen häiriön olevan kohinaa tai (ii) ilmaisemalla voimakkaimmat häiriösignaalit ja olettaen muiden olevan kohinaa. Jälkimmäinen osoittautui tehokkaammaksi menetelmäksi. Työssä osoitetaan myös, että samalla dekoodaussäännöllä ja verkon tiheydellä tila-alueen kapasiteetin saavuttava menetelmä on aina tehokkaampi kuin tavanomainen tila-alueen suorituskykyyn perustuva kiinteän siirtonopeuden menetelmä. Saavutettujen tulosten valossa työssä esitetään yleisiä suunnittelumenetelmiä mukautuville ad hoc -algoritmeille, joiden avulla voidaan parantaa tiedonsiirtoa häiriörajoitteisissa verkoissa, ehdollistettuna verkon solmujen sisäisille ja ulkoisille rajoitteille.

Ce mémoire de thèse se place dans le contexte des applications de surveillance de l’environnement nécessitant des mesures régulières de caractéristiques biologiques ou géo-physiques. Il s’agit par exemple de mesurer la propagation de polluants dans les cours d’eau, de surveiller le développement de bactérie dans des eaux de baignade. Les réseaux de capteurs sans fils (RCsF) apparaissent comme des solutions économiques et fiables pour permettre l’automatisation de la collecte de telles données. Le bon fonctionnement de ces réseaux dépend de la qualité des transmissions radio, ce qui est particulièrement vrai dans des milieux où les conditions sont peu favorables à la propagation des ondes radio et où les liens peuvent donc se révéler intermittents. L’objectif de ce travail est de proposer une solution protocolaire efficace dans de telles conditions, dans le cas particulier d’un réseau de capteur déployé à la surface de l’eau. Le mémoire débute par la description d’une méthodologie, des mécanismes et d’une plate-forme destinée à explorer la qualité d’un lien radio situé à la surface de l’eau. Nous présentons différentes mesures qui ont été effectuées. Les solutions protocolaires que nous proposons prennent en compte le caractère évolutif de la topologie due à l’instabilité des liens radio afin d’améliorer l’efficacité de la collecte et de réduire la consommation énergétique des noeuds. Notre approche est basée sur la reconstruction périodique de la topologie, la communication entre les noeuds par rendez-vous définis par des fenêtres de transmissions, l’utilisation du multi-canal pour drainer les données et l’adaptation de la taille des fenêtres de transmission en fonction du trafic local. L’ensemble de ces propositions est validé par prototypage et par simulation sur NS-3. Les résultats montrent que notre solution est capable de collecter les données dans une topologie dynamique tout en réduisant à la fois le délai de collecte et la consommation énergétique. / This thesis takes place in the context of environmental monitoring applications requiring regular measurements of biological or geophysical characteristics. These applications include for instance the measuring of the spread of pollutants in rivers, monitoring of the development of bacteria in bathing waters, etc. Wireless Sensor Networks (WSNs) provide cost-effective and reliable solutions to allow the automation of such data gathering. The good functioning of these networks depends on the quality of the radio transmissions, which is particularly true in environments where the conditions are not suitable for the propagation of radio waves and where the links may therefore be intermittent. The objective of this work is to propose an effective protocol solution under such conditions, in the particular case of a sensor network deployed on the water surface. The thesis begins with a description of the methodology, mechanisms and a platform for exploring the quality of a radio link displayed at the water surface. We present different measures that have been carried out. The protocol solutions we propose take into account the evolutionary nature of the topology due to the instability of the radio links in order to improve the efficiency of the data gathering and to reduce the energy consumption of the nodes. Our approach is based on the periodic reconstruction of the topology, the communication between nodes by appointments defined by transmission windows, the use of the multi-channel to drain the data and the adaptation of the transmission window size as a function of local traffic. All these propositions are validated by prototyping and simulation using NS-3. The results show that our solution is capable of collecting data in a dynamic topology while reducing both gathering time and energy consumption.