209 research outputs found

    逐次干渉除去を用いた多元接続システムのパワー割り当てに関する研究

    Get PDF
    In future wireless communication networks, the number of devices is likely to increase dramatically due to potential development of new applications such as the Internet of Things (IoT). Consequently, radio access network is required to support multiple access of massive users and achieve high spectral efficiency. From the information theoretic perspective, orthogonal multiple access protocols are suboptimal. To achieve the multiple access capacity, non-orthogonal multiple access protocols and multiuser detection (MUD) are required. For the non-orthogonal code-division multiple access (CDMA), several MUD techniques have been proposed to improve the spectrum efficiency. Successive interference cancellation (SIC) is a promising MUD techniques due to its low complexity and good decoding performance. Random access protocols are designed for the system with bursty traffic to reduce the delay, compared to the channelized multiple access. Since the users contend for the channel instead of being assigned by the base station (BS), collisions happen with a certain probability. If the traffic load becomes relatively high, the throughput of these schemes steeply falls down because of collisions. However, it has been well-recognized that more complex procedures can permit decoding of interfering signals, which is referred to as multi-packet reception (MPR). Also, an SIC decoder might decode more packets by successively subtracting the correctly decoded packets from the collision. Cognitive radio (CR) is an emerging technology to solve the problem of spectrum scarcity by dynamically sharing the spectrum. In the CR networks, the secondary users (SUs) are allowed to dynamically share the frequency bands with primary users (PUs) under primary quality-of-service (QoS) protection such as the constraint of interference temperature at the primary base station (PBS). For the uplink multiple access to the secondary base station (SBS), transmit power allocation for the SUs is critical to control the interference temperature at the PBS. Transmit power allocation has been extensively studied in various multiple access scenarios. The power allocation algorithms can be classified into two types, depending on whether the process is controlled by the base station (BS). For the centralized power allocation (CPA) algorithms, the BS allocates the transmit powers to the users through the downlink channels. For the random access protocols, there are also efforts on decentralized power allocation (DPA) that the users select transmit powers according to given distributions of power and probability, instead of being assigned the transmit power at each time slot by the BS. In this dissertation, the DPA algorithms for the random access protocols with SIC are investigated and new methods are proposed. First a decentralized multilevel power allocation algorithm to improve the MAC throughput performance is proposed, for the general SIC receiver that can decode multiple packets from one collision. Then an improved DPA algorithm to maximize the overall system sum rate is proposed, taking into account of both the MAC layer and PHY layer. Finally, a DPA algorithm for the CR secondary random access is proposed, considering the constraint of interference temperature and the practical assumption of imperfect cancellation. An opportunistic transmission protocol for the fading environment to further reduce the interference temperature is also proposed. For the future work, the optimal DPA for the random access with the SIC receiver is still an open problem. Besides, advanced multiple access schemes that aim to approach the multiple access capacity by combining the advantages of the network coded cooperation, the repetition slotted ALOHA, and the SIC receiver are also interesting.電気通信大学201

    Distributed scheduling algorithms for LoRa-based wide area cyber-physical systems

    Get PDF
    Low Power Wide Area Networks (LPWAN) are a class of wireless communication protocols that work over long distances, consume low power and support low datarates. LPWANs have been designed for monitoring applications, with sparse communication from nodes to servers and sparser from servers to nodes. Inspite of their initial design, LPWANs have the potential to target applications with higher and stricter requirements like those of Cyber-Physical Systems (CPS). Due to their long-range capabilities, LPWANs can specifically target CPS applications distributed over a wide-area, which is referred to as Wide-Area CPS (WA-CPS). Augmenting WA-CPSs with wireless communication would allow for more flexible, low-cost and easily maintainable deployment. However, wireless communications come with problems like reduced reliability and unpredictable latencies, making them harder to use for CPSs. With this intention, this thesis explores the use of LPWANs, specifically LoRa, to meet the communication and control requirements of WA-CPSs. The thesis focuses on using LoRa due to its high resilience to noise, several communication parameters to choose from and a freely modifiable communication stack and servers making it ideal for research and deployment. However, LoRaWAN suffers from low reliability due to its ALOHA channel access method. The thesis posits that "Distributed algorithms would increase the protocol's reliability allowing it to meet the requirements of WA-CPSs". Three different application scenarios are explored in this thesis that leverage unexplored aspects of LoRa to meet their requirements. The application scenarios are delay-tolerant vehicular networks, multi-stakeholder WA-CPS deployments and water distribution networks. The systems use novel algorithms to facilitate communication between the nodes and gateways to ensure a highly reliable system. The results outperform state-of-art techniques to prove that LoRa is currently under-utilised and can be used for CPS applications.Open Acces

    Non-linear echo cancellation - a Bayesian approach

    Get PDF
    Echo cancellation literature is reviewed, then a Bayesian model is introduced and it is shown how how it can be used to model and fit nonlinear channels. An algorithm for cancellation of echo over a nonlinear channel is developed and tested. It is shown that this nonlinear algorithm converges for both linear and nonlinear channels and is superior to linear echo cancellation for canceling an echo through a nonlinear echo-path channel

    Scalable wireless sensor networks for dynamic communication environments: simulation and modelling

    No full text
    This thesis explores the deployment of Wireless Sensor Networks (WSNs) on localised maritime events. In particular, it will focus on the deployment of a WSN at sea and estimating what challenges derive from the environment and how they affect communication. This research addresses these challenges through simulation and modelling of communication and environment, evaluating the implications of hardware selection and custom algorithm development. The first part of this thesis consists of the analysis of aspects related to the Medium Access Control layer of the network stack in large-scale networks. These details are commonly hidden from upper layers, thus resulting in misconceptions of real deployment characteristics. Results show that simple solutions have greater advantages when the number of nodes within a cluster increases. The second part considers routing techniques, with focus on energy management and packet delivery. It is shown that, under certain conditions, relaying data can increase energy savings, while at the same time allows a more even distribution of its usage between nodes. The third part describes the development of a custom-made network simulator. It starts by considering realistic radio, channel and interference models to allow a trustworthy simulation of the deployment environment. The MAC and Routing techniques developed thus far are adapted to the simulator in a cross-layer manner. The fourth part consists of adapting the WSN behaviour to the variable weather and topology found in the chosen application scenario. By analysing the algorithms presented in this work, it is possible to find and use the best alternative under any set of environmental conditions. This mechanism, the environment-aware engine, uses both network and sensing data to optimise performance through a set of rules that involve message delivery and distance between origin and cluster hea
    corecore