Broadband Channel Long Delay Cluster Measurements and Analysis at 2.4GHz in Subway Tunnels

The delay caused by the reflected ray in broadband communication has a great influence on the communications in subway tunnel. This paper presents measurements taken in subway tunnels at 2.4 GHz, with 5 MHz bandwidth. According to propagation characteristics of tunnel, the measurements were carried out with a frequency domain channel sounding technique, in three typical scenarios: line of sight (LOS), Non-line-of-sight (NLOS) and far line of sight (FLOS), which lead to different delay distributions. Firstly IFFT was chosen to get channel impulse response (CIR) h(t) from measured three-dimensional transfer functions. Power delay profile (PDP) was investigated to give an overview of broadband channel model. Thereafter, a long delay caused by the obturation of tunnel is observed and investigated in all the scenarios. The measurements show that the reflection can be greatly remained by the tunnel, which leads to long delay cluster where the reflection, but direct ray, makes the main contribution for radio wave propagation. Four important parameters: distribution of whole PDP power, first peak arriving time, reflection cluster duration and PDP power distribution of reflection cluster were studied to give a detailed description of long delay characteristic in tunnel. This can be used to ensure high capacity communication in tunnels

Blind reconiliation

Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation e?ciency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close to minimal information disclosure but heavily interactive procedures, like Cascade, or using less e?cient but also less interactive ?just one message is exchanged? procedures, like the ones based in low-density parity-check (LDPC) codes. The price to pay in the LDPC case is that good e?ciency is only attained for very long codes and in a very narrow range centered around the quantum bit error rate (QBER) that the code was designed to reconcile, thus forcing to have several codes if a broad range of QBER needs to be catered for. Real world implementations of these methods are thus very demanding, either on computational or communication resources or both, to the extent that the last generation of GHz clocked QKD systems are ?nding a bottleneck in the classical part. In order to produce compact, high performance and reliable QKD systems it would be highly desirable to remove these problems. Here we analyse the use of short-length LDPC codes in the information reconciliation context using a low interactivity, blind, protocol that avoids an a priori error rate estimation. We demonstrate that 2×103 bits length LDPC codes are suitable for blind reconciliation. Such codes are of high interest in practice, since they can be used for hardware implementations with very high throughput.

Un modelo de encaminamiento en las redes móviles ad hoc con QoS

En la última década ha aumentado en gran medida el interés por las redes móviles Ad Hoc. La naturaleza dinámica y sin infraestructura de estas redes, exige un nuevo conjunto de algoritmos y estrategias para proporcionar un servicio de comunicación fiable extremo a extremo. En el contexto de las redes móviles Ad Hoc, el encaminamiento surge como una de las áreas más interesantes para transmitir información desde una fuente hasta un destino, con la calidad de servicio de extremo a extremo. Debido a las restricciones inherentes a las redes móviles, los modelos de encaminamiento tradicionales sobre los que se fundamentan las redes fijas, no son aplicables a las redes móviles Ad Hoc. Como resultado, el encaminamiento en redes móviles Ad Hoc ha gozado de una gran atención durante los últimos años. Esto ha llevado al acrecentamiento de numerosos protocolos de encaminamiento, tratando de cubrir con cada uno de ellos las necesidades de los diferentes tipos de escenarios. En consecuencia, se hace imprescindible estudiar el comportamiento de estos protocolos bajo configuraciones de red variadas, con el fin de ofrecer un mejor encaminamiento respecto a los existentes. El presente trabajo de investigación muestra precisamente una solución de encaminamiento en las redes móviles Ad Hoc. Dicha solución se basa en el mejoramiento de un algoritmo de agrupamiento y la creación de un modelo de encaminamiento; es decir, un modelo que involucra la optimización de un protocolo de enrutamiento apoyado de un mecanismo de agrupación. El algoritmo mejorado, denominado GMWCA (Group Management Weighted Clustering Algorithm) y basado en el WCA (Weighted Clustering Algorithm), permite calcular el mejor número y tamaño de grupos en la red. Con esta mejora se evitan constantes reagrupaciones y que los jefes de clústeres tengan más tiempo de vida intra-clúster y por ende una estabilidad en la comunicación inter-clúster. En la tesis se detallan las ventajas de nuestro algoritmo en relación a otras propuestas bajo WCA. El protocolo de enrutamiento Ad Hoc propuesto, denominado QoS Group Cluster Based Routing Protocol (QoSG-CBRP), utiliza como estrategia el empleo de clúster y jerarquías apoyada en el algoritmo de agrupamiento. Cada clúster tiene un jefe de clúster (JC), quien administra la información de enrutamiento y la envía al destino cuando esta fuera de su área de cobertura. Para evitar que haya constantes reagrupamientos y llamados al algoritmo de agrupamiento se consideró agregarle un jefe de cluster de soporte (JCS), el que asume las funciones del JC, siempre y cuando este haya roto el enlace con los otros nodos comunes del clúster por razones de alejamiento o por desgaste de batería. Matemáticamente y a nivel de algoritmo se han demostrado las mejoras del modelo propuesto, el cual ha involucrado el mejoramiento a nivel de algoritmo de clustering y del protocolo de enrutamiento. El protocolo QoSG-CBRP, se ha implementado en la herramienta de simulación Network Simulator 2 (NS2), con la finalidad de ser comparado con el protocolo de enrutamiento jerárquico Cluster Based Routing Protocol (CBRP) y con un protocolo de enrutamiento Ad Hoc reactivo denominado Ad Hoc On Demand Distance Vector Routing (AODV). Estos protocolos fueron elegidos por ser los que mejor comportamiento presentaron dentro de sus categorías. Además de ofrecer un panorama general de los actuales protocolos de encaminamiento en redes Ad Hoc, este proyecto presenta un procedimiento integral para el análisis de capacidades de la propuesta del nuevo protocolo con respecto a otros, sobre redes que tienen un alto número de nodos. Estas prestaciones se miden en base al concepto de eficiencia de encaminamiento bajo parámetros de calidad de servicio (QoS), permitiendo establecer el camino más corto posible entre un nodo origen y un nodo destino. Con ese fin se han realizado simulaciones con diversos escenarios para responder a los objetivos de la tesis. La conclusiones derivadas del análisis de los resultados permiten evaluar cualitativamente las capacidades que presenta el protocolo dentro del modelo propuesto, al mismo tiempo que avizora un atractivo panorama en líneas futuras de investigación. ABSTRACT In the past decade, the interest in mobile Ad Hoc networks has greatly increased. The dynamic nature of these networks without infrastructure requires a new set of algorithms and strategies to provide a reliable end-to-end communication service. In the context of mobile Ad Hoc networks, routing emerges as one of the most interesting areas for transmitting information from a source to a destination, with the quality of service from end-to-end. Due to the constraints of mobile networks, traditional routing models that are based on fixed networks are not applicable to Ad Hoc mobile networks. As a result, the routing in mobile Ad Hoc networks has experienced great attention in recent years. This has led to the enhancement of many routing protocols, trying to cover with each one of them, the needs of different types of scenarios. Consequently, it is essential to study the behavior of these protocols under various network configurations, in order to provide a better routing scheme. Precisely, the present research shows a routing solution in mobile Ad Hoc networks. This solution is based on the improvement of a clustering algorithm, and the creation of a routing model, ie a model that involves optimizing a routing protocol with the support of a grouping mechanism. The improved algorithm called GMWCA (Group Management Weighted Clustering Algorithm) and based on the WCA (Weighted Clustering Algorithm), allows to calculate the best number and size of groups in the network. With this enhancement, constant regroupings are prevented and cluster heads are living longer intra-cluster lives and therefore stability in inter-cluster communication. The thesis details the advantages of our algorithm in relation to other proposals under WCA. The Ad Hoc routing protocol proposed, called QoS Group Cluster Based Routing Protocol (QoSG-CBRP), uses a cluster-employment strategy and hierarchies supported by the clustering algorithm. Each cluster has a cluster head (JC), who manages the routing information and sends it to the destination when is out of your coverage area. To avoid constant rearrangements and clustering algorithm calls, adding a support cluster head (JCS) was considered. The JCS assumes the role of the JC as long as JC has broken the link with the other nodes in the cluster for common restraining reasons or battery wear. Mathematically and at an algorithm level, the improvements of the proposed model have been showed, this has involved the improvement level clustering algorithm and the routing protocol. QoSG-CBRP protocol has been implemented in the simulation tool Network Simulator 2 (NS2), in order to be compared with the hierarchical routing protocol Cluster Based Routing Protocol (CBRP) and with the reactive routing protocol Ad Hoc On Demand Distance Vector Routing (AODV). These protocols were chosen because they showed the best individual performance in their categories. In addition to providing an overview of existing routing protocols in Ad Hoc networks, this project presents a comprehensive procedure for capacity analysis of the proposed new protocol with respect to others on networks that have a high number of nodes. These benefits are measured based on the concept of routing efficiency under the quality of service (QoS) parameters, thus allowing for the shortest possible path between a source node and a destination node. To meet the objectives of the thesis, simulations have been performed with different scenarios. The conclusions derived from the analysis of the results to assess qualitatively the protocol capabilities presented in the proposed model, while an attractive scenario for future research appears.

Sight distance for traffic safety analysis using GIS

Sight distance is of major importance for road safety either when designing new roads or analysing the alignment of existing roads. It is essential that available sight distance in roads is long enough for emergency stops or overtaking manoeuvres. Also, it is vital for engineers/researchers that the tools used for that analysis are both powerful and intuitive. Based on ArcGIS, the application to be presented not only performs an exhaustive sight distance calculation, but allows an accurate analysis of 3D alignment, using all new tools, from a Digital Elevation Model and vehicle trajectory. The software has been successfully utilised to analyse several two-lane rural roads in Spain. In addition, the software produces thematic maps representing sight distance in which supplementary information about crashes, traffic flow, speed or design consistency could be included, allowing traffic safety studies.

Neighborhood mobility: A Long-Gone Pardigm? Approaching proximity and land use mix using data from home based surveys.

El WCTR es un congreso de reconocido prestigio internacional en el ámbito de la investigación del transporte y aunque las actas publicadas están en formato digital y sin ISSN ni ISBN, lo consideramos lo suficientemente importante como para que se considere en los indicadores. Policies trying to increase walking within urban mobility modal split usually highlight the importance of the functional patterns and the environmental quality of the urban space as major drivers of citizens modal choices. Functional characteristics would be mainly associated to an appropriate mix of land uses within neighbourhoods, whereas environmental quality would be associated to the characteristics of urban spaces. The purpose of this research is threefold: first, to identify relevant proxy indicators, which could characterize pedestrian-friendly land use mix and environmental quality. Second, to assess, for both traits, existing disparities among neighbourhoods in a major metropolitan area. And finally, to explore the association between both indicators and children mobility patterns: according to their built environment, which neighbourhoods have a greater proportion of children and, how is their mobility? Using data from the 2004 household mobility survey in the 128 neighbourhoods of the municipality of Madrid, this paper concludes that potentially favourable conditions at the neighbourhood level seem to have only a modest influence in,mobility patterns , in terms of both, selection of closer destinations and a higher share of walking within modal split. The citys policy choices, with intensive investment in road and public transport infrastructure may explain why short-distance mobility is not as important as it could have been expected in those neighbourhoods with more pedestrian-friendly conditions. The metropolitan transport system is providing mobility conditions, which make far-away destinations attractive to most citizens.

From calcium blips to calcium puffs: Theoretical analysis of the requirements for interchannel communication

In the cytoplasm of cells of different types, discrete clusters of inositol 1,4,5-trisphosphate-sensitive Ca2+ channels generate Ca2+ signals of graded size, ranging from blips, which involve the opening of only one channel, to moderately larger puffs, which result from the concerted opening of a few channels in the same cluster. These channel clusters are of unknown size or geometrical characteristics. The aim of this study was to estimate the number of channels and the interchannel distance within such a cluster. Because these characteristics are not attainable experimentally, we performed computer stochastic simulations of Ca2+ release events. We conclude that, to ensure efficient interchannel communication, as experimentally observed, a typical cluster should contain two or three tens of inositol 1,4,5-trisphosphate-sensitive Ca2+ channels in close contact.

Quantification of spread of cerebellar long-term depression with chemical two-photon uncaging of glutamate

Localized, chemical two-photon photolysis of caged glutamate was used to map the changes in α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid-type glutamate receptors caused by long-term synaptic depression (LTD) in cerebellar Purkinje cells. LTD produced by pairing parallel fiber activity with depolarization was accompanied by a decline in the response of Purkinje cells to uncaged glutamate that accounted for both the time course and magnitude of LTD. This depression of glutamate responses was observed not only at the site of parallel fiber stimulation but also at more distant sites. The amount of LTD decreased with distance and was half-maximal 50 μm away from the site of parallel fiber activity. Estimation of the number of parallel fibers active during LTD induction indicates that LTD modified glutamate receptors not only at active synapses but also at 600 times as many inactive synapses on a single Purkinje cell. Therefore, both active and inactive parallel fiber synapses can undergo changes at a postsynaptic locus as a result of associative pre- and postsynaptic activity.

Genetically altered AMPA-type glutamate receptor kinetics in interneurons disrupt long-range synchrony of gamma oscillation

Gamma oscillations synchronized between distant neuronal populations may be critical for binding together brain regions devoted to common processing tasks. Network modeling predicts that such synchrony depends in part on the fast time course of excitatory postsynaptic potentials (EPSPs) in interneurons, and that even moderate slowing of this time course will disrupt synchrony. We generated mice with slowed interneuron EPSPs by gene targeting, in which the gene encoding the 67-kDa form of glutamic acid decarboxylase (GAD67) was altered to drive expression of the α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) glutamate receptor subunit GluR-B. GluR-B is a determinant of the relatively slow EPSPs in excitatory neurons and is normally expressed at low levels in γ-aminobutyric acid (GABA)ergic interneurons, but at high levels in the GAD-GluR-B mice. In both wild-type and GAD-GluR-B mice, tetanic stimuli evoked gamma oscillations that were indistinguishable in local field potential recordings. Remarkably, however, oscillation synchrony between spatially separated sites was severely disrupted in the mutant, in association with changes in interneuron firing patterns. The congruence between mouse and model suggests that the rapid time course of AMPA receptor-mediated EPSPs in interneurons might serve to allow gamma oscillations to synchronize over distance.