Wireless Bidirectional Relaying using Physical Layer Network Coding with Heterogeneous PSK Modulation

In bidirectional relaying using Physical Layer Network Coding (PLNC), it is generally assumed that users employ same modulation schemes in the Multiple Access phase. However, as observed by Zhang et al., it may not be desirable for the users to always use the same modulation schemes, particularly when user-relay channels are not equally strong. Such a scheme is called Heterogeneous PLNC. However, the approach in [1] uses the computationally intensive Closest Neighbour Clustering (CNC) algorithm to find the network coding maps to be applied at the relay. Also, the treatment is specific to certain cases of heterogeneous modulations. In this paper, we show that, when users employ heterogeneous but symmetric PSK modulations, the network coding maps and the mapping regions in the fade state plane can be obtained analytically. Performance results are provided in terms of Relay Error Rate (RER) and Bit Error Rate (BER).Comment: 10 pages, 10 figures and 3 table

Performance Analysis of Physical Layer Network Coding for Two-way Relaying over Non-regenerative Communication Satellites

Two-way relaying is one of the major applications of broadband communication satellites, for which an efficient technique is Physical Layer Network Coding (PLNC). Earlier studies have considered satellites employing PLNC with onboard processing. This paper investigates the performance of PLNC over non-regenerative satellites, as a majority of the operational and planned satellites have no onboard processing. Assuming that the channel magnitudes of the two users are equal, two operating conditions are considered with uncoded-QPSK relaying. In the first condition, both users are completely synchronized in phase and transmit power, and in the second condition, phase is not synchronized. The peak power constraint imposed by the satellite amplifier is considered and the error performance bounds are derived for both the conditions. The simulation results for end-to-end Bit Error Rate (BER) and throughput are provided. These results shall enable communication system designers to decide system parameters like power and linearity, and perform tradeoff analysis between different relaying schemes.Comment: 9 pages and 13 figure

Microwave shielding properties of Co/Ni attached to single walled carbon nanotubes

Cobalt/nickel nanoparticles attached to single-walled carbon nanotubes (Co/Ni@SWCNTs) were prepared by dc-arc discharge technique. Co/Ni@SWCNTs were characterized by scanning electron microscopy, high resolution transmission electron microscopy (HRTEM), Raman spectroscopy and energy dispersive X-ray analysis techniques. HRTEM results confirmed attachment of magnetic nanoparticles onto SWCNTs having 1.2 nm diameter. A microwave shielding effectiveness value of 24 dB (blocking >99% radiation) by a 1.5 mm thick sample in the frequency range of 12.4-18 GHz was observed. In order to understand the mechanism of shielding, dielectric andmagnetic attributes of the shielding effectiveness of Co/Ni@SWCNTs have been evaluated. Eddy currents and natural resonances due to the presence of magnetic nanoparticles, electronic polarization and their relaxation, interfacial polarization and unique composition of the shield contributed significantly in achieving good shielding effectiveness. The observed microwave shielding crossed the limit required for commercial applications which suggests that these nanocomposites are promising microwave shielding materials in the Ku band

Revisited experimental comparison of node-link and matrix representations

Visualizing network data is applicable in domains such as biology, engineering, and social sciences. We report the results of a study comparing the effectiveness of the two primary techniques for showing network data: node-link diagrams and adjacency matrices. Specifically, an evaluation with a large number of online participants revealed statistically significant differences between the two visualizations. Our work adds to existing research in several ways. First, we explore a broad spectrum of network tasks, many of which had not been previously evaluated. Second, our study uses a large dataset, typical of many real-life networks not explored by previous studies. Third, we leverage crowdsourcing to evaluate many tasks with many participants

Network Archaeology: Uncovering Ancient Networks from Present-day Interactions

Often questions arise about old or extinct networks. What proteins interacted in a long-extinct ancestor species of yeast? Who were the central players in the Last.fm social network 3 years ago? Our ability to answer such questions has been limited by the unavailability of past versions of networks. To overcome these limitations, we propose several algorithms for reconstructing a network's history of growth given only the network as it exists today and a generative model by which the network is believed to have evolved. Our likelihood-based method finds a probable previous state of the network by reversing the forward growth model. This approach retains node identities so that the history of individual nodes can be tracked. We apply these algorithms to uncover older, non-extant biological and social networks believed to have grown via several models, including duplication-mutation with complementarity, forest fire, and preferential attachment. Through experiments on both synthetic and real-world data, we find that our algorithms can estimate node arrival times, identify anchor nodes from which new nodes copy links, and can reveal significant features of networks that have long since disappeared.Comment: 16 pages, 10 figure

Are crossings important for drawing large graphs?

Reducing the number of edge crossings is considered one of the most important graph drawing aesthetics. While real-world graphs tend to be large and dense, most of the earlier work on evaluating the impact of edge crossings utilizes relatively small graphs that are manually generated and manipulated. We study the effect on task performance of increased edge crossings in automatically generated layouts for graphs, from different datasets, with different sizes, and with different densities. The results indicate that increasing the number of crossings negatively impacts accuracy and performance time and that impact is significant for small graphs but not significant for large graphs. We also quantitatively evaluate the impact of edge crossings on crossing angles and stress in automatically constructed graph layouts. We find a moderate correlation between minimizing stress and the minimizing the number of crossings. © Springer-Verlag Berlin Heidelberg 2014.National Science Foundation, NSF: CCF-1115971National Science Foundation, NSF: DEB-105357