An Interconnection Architecture for Seamless Inter and Intra-Chip Communication Using Wireless Links

As semiconductor technologies continues to scale, more and more cores are being integrated on the same multicore chip. This increase in complexity poses the challenge of efficient data transfer between these cores. Several on-chip network architectures are proposed to improve the design flexibility and communication efficiency of such multicore chips. However, in a larger system consisting of several multicore chips across a board or in a System-in-Package (SiP), the performance is limited by the communication among and within these chips. Such systems, most commonly found within computing modules in typical data center nodes or server racks, are in dire need of an efficient interconnection architecture. Conventional interchip communication using wireline links involve routing the data from the internal cores to the peripheral I/O ports, travelling over the interchip channels to the destination chip, and finally getting routed from the I/O to the internal cores there. This multihop communication increases latency and energy consumption while decreasing data bandwidth in a multichip system. Furthermore, the intrachip and interchip communication architectures are separately designed to maximize design flexibility. Jointly designing them could, however, improve the communication efficiency significantly and yield better solutions. Previous attempts at this include an all-photonic approach that provides a unified inter/intra-chip optical network, based on recent progress in nano-photonic technologies. Works on wireless inter-chip interconnects successfully yielded better results than their wired counterparts, but their scopes were limited to establishing a single wireless connection between two chips rather than a communication architecture for a system as a whole. In this thesis, the design of a seamless hybrid wired and wireless interconnection network for multichip systems in a package is proposed. The design utilizes on-chip wireless transceivers with dimensions spanning up to tens of centimeters. It manages to seamlessly bind both intrachip and interchip communication architectures and enables direct chip-to-chip communication between the internal cores. It is shown through cycle accurate simulations that the proposed design increases the bandwidth and reduces the energy consumption when compared to the state-of-the-art wireline I/O based multichip communications

Self-Organizing and Scalable Routing Protocol (SOSRP) for Underwater Acoustic Sensor Networks

Las redes de sensores acústicas submarinas (UASN) han ganado mucha importancia en los últimos años: el 71% de la superficie de la Tierra está cubierta por océanos. La mayoría de ellos, aún no han sido explorados. Aplicaciones como prospección de yacimientos, prevención de desastres o recopilación de datos para estudios de biología marina se han convertido en el campo de interés para muchos investigadores. Sin embargo, las redes UASN tienen dos limitaciones: un medio muy agresivo (marino) y el uso de señales acústicas. Ello hace que las técnicas para redes de sensores inalámbricas (WSN) terrestres no sean aplicables. Tras realizar un recorrido por el estado del arte en protocolos para redes UASN, se propone en este TFM un protocolo de enrutamiento denominado "SOSRP", descentralizado y basado en tablas en cada nodo. Se usa como criterio para crear rutas una combinación del valor de saltos hasta el nodo recolector y la distancia. Las funciones previstas del protocolo abarcan: autoorganización de las rutas, tolerancia a fallos y detección de nodos aislados. Mediante la implementación en MATLAB de SOSRP así como de un modelo de propagación y energía apropiados para entorno marino, se obtienen resultados de rendimiento en distintos escenarios (variando nºextremo de paquetes, consumo de energía o longitud de rutas creadas (con y sin fallo). Los resultados obtenidos muestran una operación estable, fiable y adecuada para el despliegue y operación de los nodos en redes UASN

Recursive quantum repeater networks

Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such as Bell pairs and GHZ, W, and cluster states.Comment: 14 page

A Scalable QoS Scheduling Architecture For WiMAX Multi-Hop Relay Networks.

WiMAX Mobile Multi-hop Relay (MMR) network has been introduced to increase the capacity and extend the coverage area of a single WiMAX Base Station (BS) by the use of a Relay Station (RS)

Cross-layer design for network performance optimization in wireless networks

In this dissertation, I use mathematical optimization approach to solve the complex network problems. Paper l and paper 2 first show that ignoring the bandwidth constraint can lead to infeasible routing solutions. A sufficient condition on link bandwidth is proposed that makes a routing solution feasible, and then a mathematical optimization model based on this sufficient condition is provided. Simulation results show that joint optimization models can provide more feasible routing solutions and provide significant improvement on throughput and lifetime. In paper 3 and paper 4, an interference model is proposed and a transmission scheduling scheme is presented to minimize the end-to-end delay. This scheduling scheme is designed based on integer linear programming and involves interference modeling. Using this schedule, there are no conflicting transmissions at any time. Through simulation, it shows that the proposed link scheduling scheme can significantly reduce end-to-end latency. Since to compute the maximum throughput is an NP-hard problem, efficient heuristics are presented in Paper 5 that use sufficient conditions instead of the computationally-expensive-to-get optimal condition to capture the mutual conflict relation in a collision domain. Both one-way transmission and two-way transmission are considered. Simulation results show that the proposed algorithms improve network throughput and reduce energy consumption, with significant improvement over previous work on both aspects. Paper 6 studies the complicated tradeoff relation among multiple factors that affect the sensor network lifetime and proposes an adaptive multi-hop clustering algorithm. It realizes the best tradeoff among multiple factors and outperforms others that do not. It is adaptive in the sense the clustering topology changes over time in order to have the maximum lifetime --Abstract, page iv

Wireless measurement Scheme for bandwidth Estimation in Multihop Wireless Adhoc network

The necessity to bear real time and multimedia application for users of Mobile 1D468;1D485;1D489;1D490;1D484; Network (1D474;1D468;1D475;1D46C;1D47B;) is becoming vital. Mobile 1D468;1D485;1D489;1D490;1D484; network facilitates decentralized network that can present multimedia users with mobility that they have demanded, if proficient 1D478;1D490;1D47A; multicast strategies were developed. By giving the guarantee of 1D478;1D490;1D47A; in 1D468;1D485;1D489;1D490;1D484; network, the proficient bandwidth estimation method plays a very important role. The research paper represented here presents a splendid method for estimating or measuring Bandwidth in 1D468;1D485;1D489;1D490;1D484; network whose character is decentralized in nature. Contrasting in the centralized formation, the bandwidth estimating in 1D468;1D485;1D489;1D490;1D484; is significant and this eventually makes an influence over the 1D478;1D490;1D47A; of the network communication. The admission control and dynamic bandwidth management method which is presented here, facilitates it with fairness and rate guarantees despite the distributed link layer fair scheduling being absent. Alteration has been made over 1D474;1D468;1D46A; layer and this method is appropriate where the peer-to-peer (1D477;1D7D0;1D477;) multimedia transmissions rates are amended in compliantly fashion.In the research work presented here the architecture of the 1D474;1D468;1D46A; layer has been altered and the data handling capacity has been increased. This technique is adopted to facilitate higher data rate transmission and eliminate congestion over the considerednetwork. The proposed technique implements the splitting of 1D474;1D468;1D46A; into two sub layer where one will be responsible for control data transmission while other effectively transmits the data bits. Thus it results into higher data rate transmission with better accuracy and optimized network throughput. The research work in the presented paper exhibits superior accuracy and is very much effective in bandwidth estimation and management application in multi hop Mobile Ad-H