602 research outputs found

    Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis

    Full text link
    We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and receiver in a half-duplex mode. The half-duplex mode gives rise to a double unequal error protection (DUEP) phenomenon: the more a user repeats its packet, the higher the probability that this packet is decoded by other users, but the lower the probability for this user to decode packets from others. We analyze the performance of B-CSA over the packet erasure channel for a finite frame length. In particular, we provide a general analysis of stopping sets for B-CSA and derive an analytical approximation of the performance in the error floor (EF) region, which captures the DUEP feature of B-CSA. Simulation results reveal that the proposed approximation predicts very well the performance of B-CSA in the EF region. Finally, we consider the application of B-CSA to vehicular communications and compare its performance with that of carrier sense multiple access (CSMA), the current MAC protocol in vehicular networks. The results show that B-CSA is able to support a much larger number of users than CSMA with the same reliability.Comment: arXiv admin note: text overlap with arXiv:1501.0338

    Computing in Additive Networks with Bounded-Information Codes

    Full text link
    This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique. Technically, we provide efficient algorithms for fundamental distributed tasks in additive networks, such as solving various symmetry breaking problems, approximating network parameters, and solving an \emph{asymmetry revealing} problem such as computing a maximal input. The key method used is a novel random coding technique that allows a node to successfully decode the received information, as long as it does not contain too many distinct values. We then design our algorithms to produce a limited amount of information in each neighborhood in order to leverage our enriched toolbox for computing in additive networks

    Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access

    Full text link
    In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correcting codes via density evolution analysis. The capacity (in packets per slot) of the scheme is then analyzed in the context of the collision channel without feedback. Moreover, a capacity bound is developed and component code distributions tightly approaching the bound are derived.Comment: The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10 figure

    The Critical Challenges from International High-Tech and Computer-Related Crime at the Millennium

    Get PDF
    The automotive industry stands in front of a great challenge, to decrease its impact on the environment. One important part in succeeding with this is to decrease the structural weight of the body structure and by that the fuel consumption or the required battery power. Carbon fibre composites are by many seen as the only real option when traditional engineering materials are running out of potential for further weight reduction. However, the automotive industry lacks experience working with structural composites and the methods for high volume composite manufacturing are immature. The development of a composite automotive body structure, therefore, needs methods to support and guide the conceptual work to improve the financial and technical results. In this thesis a framework is presented which will provide guidelines for the conceptual phase of the development of an automotive body structure. The framework follows two main paths, one to strive for the ideal material diversity, which also defines an initial partition of the body structure based on the process and material selection. Secondly, a further analysis of the structures are made to evaluate if a more cost and weight efficient solution can be found by a more differential design and by that define the ideal part size. In the case and parameter studies performed, different carbon fibre composite material systems and processes are compared and evaluated. The results show that high performance material system with continuous fibres becomes both more cost and performance effective compared to industrialised discontinuous fibre composites. But also that cycle times, sometimes, are less important than a competitive feedstock cost for a manufacturing process. When further analysing the manufacturing design of the structures it is seen that further partition(s) can become cost effective if the size and complexity is large enough.      QC 20140527</p

    AirSync: Enabling Distributed Multiuser MIMO with Full Spatial Multiplexing

    Full text link
    The enormous success of advanced wireless devices is pushing the demand for higher wireless data rates. Denser spectrum reuse through the deployment of more access points per square mile has the potential to successfully meet the increasing demand for more bandwidth. In theory, the best approach to density increase is via distributed multiuser MIMO, where several access points are connected to a central server and operate as a large distributed multi-antenna access point, ensuring that all transmitted signal power serves the purpose of data transmission, rather than creating "interference." In practice, while enterprise networks offer a natural setup in which distributed MIMO might be possible, there are serious implementation difficulties, the primary one being the need to eliminate phase and timing offsets between the jointly coordinated access points. In this paper we propose AirSync, a novel scheme which provides not only time but also phase synchronization, thus enabling distributed MIMO with full spatial multiplexing gains. AirSync locks the phase of all access points using a common reference broadcasted over the air in conjunction with a Kalman filter which closely tracks the phase drift. We have implemented AirSync as a digital circuit in the FPGA of the WARP radio platform. Our experimental testbed, comprised of two access points and two clients, shows that AirSync is able to achieve phase synchronization within a few degrees, and allows the system to nearly achieve the theoretical optimal multiplexing gain. We also discuss MAC and higher layer aspects of a practical deployment. To the best of our knowledge, AirSync offers the first ever realization of the full multiuser MIMO gain, namely the ability to increase the number of wireless clients linearly with the number of jointly coordinated access points, without reducing the per client rate.Comment: Submitted to Transactions on Networkin

    Hidden Terminal Detection in Wide-Area 802.11 Wireless Networks

    Get PDF
    The hidden terminal problem is an important issue in wireless networks based on the CSMA medium access control scheme. Hidden terminals pose a complex challenge to network operators trying to identify the underlying cause of performance issues. This thesis describes new methods for the detection and measurement of the hidden terminal problem in wireless networks based on commodity hardware and software platforms. These new methods allow network operators to identify areas of a network where hidden terminals are likely to exist; detect instances of the hidden terminal problem occurring; and estimate the total impact hidden terminals are having on the performance of the network. A new framework for measurement of wireless networks is described which provides a new approach to wireless measurement on Linux based wireless routers. The new framework is used to implement the methods and they are deployed across an operational commercial wireless network and are shown to be useful
    corecore