Signal detection for distributed space-time block coding: 4 relay nodes under quasi-synchronisation

Most research on Distributed Space-Time Block Coding (D-STBC) has so far focused on the case of 2 relay nodes and assumed that the relay nodes are perfectly synchronised at the symbol level. This paper applies STBC to 4-relaynode systems under quasi-synchronisation and derives a new detector based on parallel interference cancellation, which proves to be very effective in suppressing the impact of imperfect synchronisation.

Full interference cancellation for two-path relay cooperative networks

This paper proposes the full interference cancellation (FIC) algorithm to cancel the inter-relay interference (IRI) in the two-path cooperative system. Arising from simultaneous data transmission from the source and relay nodes, IRI may significantly decrease the performance if it is not carefully handled. Compared to the existing partial interference cancellation (PIC) scheme, the FIC approach is more robust yet with less complexity. Numerical results are also given to verify the proposed scheme.

Delay analysis of enhanced relay-enabled distributed coordination function

This paper analyzes the delay performance of Enhanced relay-enabled Distributed Coordination Function (ErDCF) for wireless ad hoc networks under ideal condition and in the presence of transmission errors. Relays are nodes capable of supporting high data rates for other low data rate nodes. In ideal channel ErDCF achieves higher throughput and reduced energy consumption compared to IEEE 802.11 Distributed Coordination Function (DCF). This gain is still maintained in the presence of errors. It is also expected of relays to reduce the delay. However, the impact on the delay behavior of ErDCF under transmission errors is not known. In this work, we have presented the impact of transmission errors on delay. It turns out that under transmission errors of sufficient magnitude to increase dropped packets, packet delay is reduced. This is due to increase in the probability of failure. As a result the packet drop time increases, thus reflecting the throughput degradation.

Interference cancellation in two-path successive relay system with network coding

This paper proposes a novel interference cancellation algorithm for the two-path successive relay system using network coding. The two-path successive relay scheme was proposed recently to achieve full date rate transmission with half-duplex relays. Due to the simultaneous data transmission at the relay and source nodes, the two-path relay suffers from the so-called inter-relay interference (IRI) which may significantly degrade the system performance. In this paper, we propose to use the network coding to remove the IRI such that the interference is first encoded with the network coding at the relay nodes and later removed at the destination. The network coding has low complexity and can well suppress the IRI. Numerical simulations show that the proposed algorithm has better performance than existing approaches.

Maximin SNR beamforming strategies for two-way relay channels

In this letter, we consider beamforming strategies in amplified-and-forward (AF) two-way relay channels, where two terminals and the relay are equipped with multiple antennas. Our aim is to optimize the worse end-to-end signal-to-noise ratio of the two links so that the reliability of both terminals can be guaranteed. We show that the optimization problem can be recast as a generalized fractional programing and be solved by using the Dinkelbach-type procedure combined with semidefinite programming. Simulation results confirm the efficiency of the proposed strategies.

Power allocation strategies for distributed space-time codes in two-way relay networks

We study a two-way relay network (TWRN), where distributed space-time codes are constructed across multiple relay terminals in an amplify-and-forward mode. Each relay transmits a scaled linear combination of its received symbols and their conjugates,with the scaling factor chosen based on automatic gain control. We consider equal power allocation (EPA) across the relays, as well as the optimal power allocation (OPA) strategy given access to instantaneous channel state information (CSI). For EPA, we derive an upper bound on the pairwise-error-probability (PEP), from which we prove that full diversity is achieved in TWRNs. This result is in contrast to one-way relay networks, in which case a maximum diversity order of only unity can be obtained. When instantaneous CSI is available at the relays, we show that the OPA which minimizes the conditional PEP of the worse link can be cast as a generalized linear fractional program, which can be solved efficiently using the Dinkelback-type procedure.We also prove that, if the sum-power of the relay terminals is constrained, then the OPA will activate at most two relays.

Fast long-range connections in transportation networks

Multidimensional scaling is applied in order to visualize an analogue of the small-world effect implied by edges having different displacement velocities in transportation networks. Our findings are illustrated for two real-world systems, namely the London urban network (streets and underground) and the US highway network enhanced by some of the main US airlines routes. We also show that the travel time in these two networks is drastically changed by attacks targeting the edges with large displacement velocities. (C) 2011 Elsevier By. All rights reserved.

On the efficiency of transportation systems in large cities

We report an analysis of the accessibility between different locations in big cities, which is illustrated with respect to London and Paris. The effects of the respective underground systems in facilitating more uniform access to diverse places are also quantified and investigated. It is shown that London and Paris have markedly different patterns of accessibility, as a consequence of the number of bridges and large parks of London, and that in both cases the respective underground systems imply in general, thought in distinct manners, an increase of accessibility. Copyright (C) EPLA, 2010

Transportation in Maine

http://digitalcommons.colby.edu/atlasofmaine2005/1003/thumbnail.jpg

DRAFT PROPOSED PUBLIC TRANSPORTATION ROUTES FOR WATERVILLE, ME

http://digitalcommons.colby.edu/atlasofmaine2008/1024/thumbnail.jpg

Draft Proposed Public Transportation Routes for Waterville, ME

Currently, there is a public bus transportation route in Waterville, Maine. However, this system could be improved. Our goal was to use GIS to find optimal public transportation routes throughout the city based on given points of interest and high population density areas. Three different groups of points of interest were created in the North, West, and South sections of Waterville. Using the Network Analyst tool, which calculates optimal routes, using existing street data, based on the input of stops, barriers, and impedance, we ran an analysis of what we thought would be the routes that best served the greatest number of people. Two different sets of routes were found: one with length as the impedance (the shortest length between the selected stops was favored), and one with population density as the impedance (the roads with the highest population density were favored). Finally, the times of the resulting routes (given a constant speed limit of 25 mph) were calculated and evaluated.

Claude Elwood Shannon e a symbolic analysis of relay and switching circuits: tornando o computador uma máquina semiótica.

O nome de Claude Elwood Shannon não é totalmente estranho aos pesquisadores de Comunicação Social. No entanto, parte de sua importância para a história da comunicação no século XX é pouco conhecida. Sua dissertação de mestrado e o artigo dela derivado (A Symbolic Analysis of Relay and Switching Circuits) foram essenciais para que o computador se tornasse uma máquina de comunicação e, conseqüentemente, penetrasse em nossa sociedade na forma como ocorre hoje. Este artigo revisa o primeiro grande trabalho de Shannon e explicita sua participação no contexto atual da comunicação.

Future cenario planning in Brazilian logistics and transportation sector

Nas últimas décadas o setor de logística passou por grandes transformações pelo mundo. Assim, a eficiência do sistema logístico é importante para o crescimento econômico, a diversificação, redução dos custos operacionais e da pobreza. Segundo o Banco Mundial, o Brasil tornou-se uma das maiores economias do mundo, mas os custos logísticos elevados colocam em risco esse crescimento. Estes custos são em grande parte o resultado de diferenças em infraestrutura de cada região, juntamente com os encargos do setor rodoviário, que corresponde por 60% do total do transporte de carga do país. Entretanto, a logística brasileira está às portas de uma nova revolução, em práticas de negócios e eficiência, e também na qualidade e disponibilidade da infraestrutura de transportes e comunicações, e novos projetos e práticas para superar a situação. O objetivo deste estudo não é analisar o presente e as atuais tendências de logística do Brasil e do setor de transporte, mas sim modelar possíveis cenários futuros para os próximos anos. Em outras palavras, este trabalho mostra diferentes possibilidades de como o setor de logística e transporte poderá ser no futuro. Para isso, este trabalho irá utilizar a metodologia de cenários prospectivos e entrevistas com especialistas relacionados da área.