371 research outputs found

    A Mobile Satellite Experiment (MSAT-X) network definition

    Get PDF
    The network architecture development of the Mobile Satellite Experiment (MSAT-X) project for the past few years is described. The results and findings of the network research activities carried out under the MSAT-X project are summarized. A framework is presented upon which the Mobile Satellite Systems (MSSs) operator can design a commercial network. A sample network configuration and its capability are also included under the projected scenario. The Communication Interconnection aspect of the MSAT-X network is discussed. In the MSAT-X network structure two basic protocols are presented: the channel access protocol, and the link connection protocol. The error-control techniques used in the MSAT-X project and the packet structure are also discussed. A description of two testbeds developed for experimentally simulating the channel access protocol and link control protocol, respectively, is presented. A sample network configuration and some future network activities of the MSAT-X project are also presented

    ALOHA With Collision Resolution(ALOHA-CR): Theory and Software Defined Radio Implementation

    Full text link
    A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important difference: simultaneous transmissions of two users can be successful. If more than two users transmit in the same slot the collision cannot be resolved and retransmission is required. If only one user transmits, the transmitted packet is recovered with some probability, depending on the state of the channel. If two users transmit the collision is resolved and the packets are recovered by first over-sampling the collision signal and then exploiting independent information about the two users that is contained in the signal polyphase components. The ALOHA-CR throughput is derived under the infinite backlog assumption and also under the assumption of finite backlog. The contention probability is determined under these two assumptions in order to maximize the network throughput and maintain stability. Queuing delay analysis for network users is also conducted. The performance of ALOHA-CR is demonstrated on the Wireless Open Access Research Platform (WARP) test-bed containing five software defined radio nodes. Analysis and test-bed results indicate that ALOHA-CR leads to significant increase in throughput and reduction of service delays

    Using CDMA as Anti-Collision Method for RFID - Research & Applications

    Get PDF

    Self managed Access Scheme for Demand Request in TDM TDMA Star Topology Network

    Get PDF
    In demand assignment protocol, resources are granted on the basis of demand, governing some rules, policies in resource assignment and after the completion of need, resources are released back to the central pool for further requests. In star topology TDM/TDMA network of VSATs, large number of participating terminals generate signaling packet on common demand request channel. It is desired that these signaling terminals to have higher chances of successful access to the media and at the same time with minimal number of collision over the shared channel. Under these circumstances, performance of media access protocol is really crucial. Aloha is the simplistic technique to access the shared channel but suffers from extremely low throughput. Its immediate successor slotted Aloha improves the throughput by cutting down the vulnerable period to half by agreeing on transmission at slot boundaries. This improvement is also not adequate to provide the better chances of packets getting through when multiple nodes are participating. The large latency network where one hop delay is of the order of 270ms, feedback time and timeouts are also of high order this further worsen the problem. In this paper, we propose self-managed access scheme for demand request that tries to reduce the collision by managing the multiple requests and distributing them over different slots

    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

    Performance analysis of slotted fiber-optic code-division multiple-access (CDMA) packet networks

    Get PDF
    This paper examines code-division multiple-access (CDMA) techniques used in slotted fiber-optic packet networks. Since the inherent properties and signal processing of the conventional communication channels are different from those of the fiber-optic channels, new code sequences must be constructed for fiber-optic applications. The goal of our research is to analyze the performance of fiber-optic CDMA packet networks using code sequences with given orthogonality properties. © 1997 IEEE.published_or_final_versio

    Packet data communications over coded CDMA with hybrid type-II ARQ

    Get PDF
    This dissertation presents in-depth investigation of turbo-coded CDNIA systems in packet data communication terminology. It is divided into three parts; (1) CDMA with hybrid FEC/ARQ in deterministic environment, (2) CDMA with hybrid FEC/ARQ in random access environment and (3) an implementation issue on turbo decoding. As a preliminary, the performance of CDMA with hybrid FEC/ARQ is investigated in deterministic environment. It highlights the practically achievable spectral efficiency of CDMA system with turbo codes and the effect of code rates on the performance of systems with MF and LMMSE receivers, respectively. For given ensemble distance spectra of punctured turbo codes, an improved union bound is used to evaluate the error probability of ML turbo decoder with MF receiver and with LMMSE receiver front-end and, then, the corresponding spectral efficiency is computed as a function of system load. In the second part, a generalized analytical framework is first provided to analyze hybrid type-11 ARQ in random access environment. When applying hybrid type-11 ARQ, probability of packet success and packet length is generally different from attempt to attempt. Since the conventional analytical model, customarily employed for ALOHA system with pure or hybrid type-I ARQ, cannot be applied for this case, an expanded analytical model is introduced. It can be regarded as a network of queues and Jackson and Burke\u27s theorems can be applied to simplify the analysis. The second part is further divided into two sub topics, i.e. CDMA slotted ALOHA with hybrid type-11 ARQ using packet combining and CDMA unslotted ALOHA with hybrid type-11 ARQ using code combining. For code combining, the rate compatible punctured turbo (RCPT) codes are examined. In the third part, noticing that the decoding delay is crucial to the fast ARQ, a parallel MAP algorithm is proposed to reduce the computational decoding delay of turbo codes. It utilizes the forward and backward variables computed in the previous iteration to provide boundary distributions for each sub-block MAP decoder. It has at least two advantages over the existing parallel scheme; No performance degradation and No additional computation

    Performance Evaluation of LoRaWAN for Green Internet of Things

    Get PDF
    LoRa is a long-range, low power and single-hop wireless technology that has been envisioned for Internet of Things (IoT) applications having battery driven nodes. Nevertheless, increase in number of end devices and varying throughput requirements impair the performance of pure Aloha in LoRaWAN. Considering these limitations, we evaluate the performance of slotted Aloha in LoRaWAN using extensive simulations. We employed packet error rate (PER), throughput, delay, and energy consumption of devices under different payload sizes and varying number of end devices as benchmarks. Moreover, an analytical analysis of backlogged and non-backlogged under slotted Aloha LoRaWAN environment is also performed. The simulation shows promising results in terms of PER and throughput compared to the pure Aloha. However, increase in delay has been observed during experimental evaluation.Finally, we endorse slotted aloha LoRaWAN for Green IoT Environment

    Performance evaluation of LoRaWAN for Green Internet of Things

    Get PDF
    LoRa is a long-range, low power and single-hop wireless technology that has been envisioned for Internet of Things (IoT) applications having battery driven nodes. Nevertheless, increase in number of end devices and varying throughput requirements impair the performance of pure Aloha in LoRaWAN. Considering these limitations, we evaluate the performance of slotted Aloha in LoRaWAN using extensive simulations. We employed packet error rate (PER), throughput, delay, and energy consumption of devices under different payload sizes and varying number of end devices as benchmarks. Moreover, an analytical analysis of backlogged and non-backlogged under slotted Aloha LoRaWAN environment is also performed. The simulation shows promising results in terms of PER and throughput compared to the pure Aloha. However, increase in delay has been observed during experimental evaluation.Finally, we endorse slotted aloha LoRaWAN for Green IoT Environment

    Combining distributed queuing with energy harvesting to enable perpetual distributed data collection applications

    Get PDF
    This is the peer reviewed version of the following article: Vazquez-Gallego F, Tuset-Peiró P, Alonso L, Alonso-Zarate J. Combining distributed queuing with energy harvesting to enable perpetual distributed data collection applications. Trans Emerging Tel Tech. 2017;e3195 , which has been published in final form at https://doi.org/10.1002/ett.3195. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.This paper presents, models, and evaluates energy harvesting–aware distributed queuing (EH-DQ), a novel medium access control protocol that combines distributed queuing with energy harvesting (EH) to address data collection applications in industrial scenarios using long-range and low-power wireless communication technologies. We model the medium access control protocol operation using a Markov chain and evaluate its ability to successfully transmit data without depleting the energy stored at the end devices. In particular, we compare the performance and energy consumption of EH-DQ with that of time-division multiple access (TDMA), which provides an upper limit in data delivery, and EH-aware reservation dynamic frame slotted ALOHA, which is an improved variation of frame slotted ALOHA. To evaluate the performance of these protocols, we use 2 performance metrics: delivery ratio and time efficiency. Delivery ratio measures the ability to successfully transmit data without depleting the energy reserves, whereas time efficiency measures the amount of data that can be transmitted in a certain amount of time. Results show that EH-DQ and TDMA perform close to the optimum in data delivery and outperform EH-aware reservation dynamic frame slotted ALOHA in data delivery and time efficiency. Compared to TDMA, the time efficiency of EH-DQ is insensitive to the amount of harvested energy, making it more suitable for energy-constrained applications. Moreover, compared to TDMA, EH-DQ does not require updated network information to maintain a collision-free schedule, making it suitable for very dynamic networks.Peer ReviewedPostprint (author's final draft
    • …
    corecore