Search results for "Data_CODINGANDINFORMATIONTHEORY"

showing 10 items of 196 documents

A TDMA-Based MAC Protocol Supporting Cooperative Communications in Wireless Mesh Networks

2011

This paper proposes a TDMA-based medium access control protocol which enables cooperative communications in multi-hop wireless mesh networks. According to the proposed scheme, each router at the two-hop neighbourhood of each other is allocated to a specific time slot for accommodating either direct or cooperative transmissions in a coordinated manner, controlled by mini-slots which are part of the time slot. Benefiting from the elaborate mini-slot design, channel resources are fairly and efficiently allocated to each router so that no handshake is needed prior to each packet transmission. By providing access priority to cooperative transmission through an optimal relay which is determined b…

RouterHandshakeWireless mesh networkComputer Networks and Communicationsbusiness.industryComputer scienceNetwork packetComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSTime division multiple accessAccess controlData_CODINGANDINFORMATIONTHEORYlaw.inventionHardware and ArchitectureRelaylawbusinessRelay channelComputer networkInternational journal of Computer Networks & Communications
researchProduct

A mini-slot-based cooperative MAC protocol for wireless mesh networks

2010

This paper proposes a TDMA-based medium access control protocol with cooperative communications enabled in wireless mesh networks. The proposed scheme is based on a multi-hop scenario which is extended from the conventional one-hop triangle cooperative transmission scenario. Benefiting from the elaborate mini-slot design, channel resources are fairly and efficiently allocated to each router so that no handshake is needed prior to every packet transmission. By giving priority for channel access to cooperative transmission performed by an optimal helper which is determined based on the received SNR, higher successful transmission rate can be achieved. Numerical results demonstrate that the pr…

Routing protocolRouterChannel allocation schemesWireless mesh networkbusiness.industryNetwork packetComputer scienceComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSTime division multiple accessThroughputData_CODINGANDINFORMATIONTHEORYComputer Science::PerformanceTransmission (telecommunications)Computer Science::Networking and Internet ArchitectureWirelessbusinessComputer networkCommunication channel2010 IEEE Globecom Workshops
researchProduct

Throughput and energy efficiency comparison of one-hop, two-hop, virtual relay and cooperative retransmission schemes

2010

Two main types of approaches exist for implementing cooperative communications at the MAC layer: virtual-hop relay and cooperative retransmission. While the virtual-hop relay schemes employ relay nodes to forward packets when higher end-to-end throughput can be achieved compared with the direct transmission, the cooperative retransmission schemes use relays to retransmit data only after the direct transmission fails. However, the performance of the these different approaches has not been compared in the literature, especially when energy efficiency is considered. In order to find out the best transmission scheme, this paper evaluates and compares the performance of the one-hop direct transm…

Routing protocolbusiness.industryNetwork packetWireless networkComputer scienceRetransmissionDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSThroughputData_CODINGANDINFORMATIONTHEORYlaw.inventionComputer Science::PerformanceRelaylawComputer Science::Networking and Internet ArchitectureFadingbusinessComputer Science::Information TheoryComputer networkEfficient energy use2010 European Wireless Conference (EW)
researchProduct

Lightweight algorithms for constructing and inverting the BWT of string collections

2013

Recent progress in the field of \{DNA\} sequencing motivates us to consider the problem of computing the Burrows‚ÄìWheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the \{BWT\} at their heart, and it would be of great interest to explore their applications to sequence collections such as these. However, computing the \{BWT\} for 100 billion characters or more of data remains a computational challenge. In this work we ad…

SequenceTheoretical computer scienceSettore INF/01 - InformaticaGeneral Computer ScienceComputer scienceString (computer science)Search engine indexingProcess (computing)Data_CODINGANDINFORMATIONTHEORYData structureField (computer science)Theoretical Computer ScienceBWTConstant (computer programming)Text indexeBWT; Text indexes; Next-generation sequencingText indexesNext-generation sequencingAlphabetAlgorithmAuxiliary memoryTheoretical Computer Science
researchProduct

A New Multicast Technique for Video Transmission over ABR Services in ATM Networks

2000

Multicast techniques are the only way to simultaneously provide flows of information from one source to several destinations. The intention of this paper is to study and to evaluate different multicast techniques using a video coder based on an adaptive video compression algorithm with subband coding and a best effort network service like ATM with the Available Bit Rate (ABR) service. This video transmission can adapt faster and easily to changing network conditions. In this way, we present an evaluation process for a determined network configuration. Thereafter we discuss the results obtained by simulation and propose for this video transmission a trade-off between these multicast techniqu…

Service (systems architecture)Multicastbusiness.industryComputer scienceQuality of serviceATM adaptation layerNetwork serviceProcess (computing)Data_CODINGANDINFORMATIONTHEORYbusinessComputer networkSub-band codingData compression
researchProduct

A New Class of Searchable and Provably Highly Compressible String Transformations

2019

The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the domains of strings. However, efforts to find non-trivial alternatives of the original, now 25 years old, Burrows-Wheeler string transformation have met limited success. In this paper we bring new lymph to this area by introducing a whole new family of transformations that have all the "myriad virtues" of the BWT: they can be computed and inverted in linear time, they produce provably highly compressible strings, and they support linear time pattern search direc…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniFOS: Computer and information sciences050101 languages & linguisticsBurrows-wheeler transformation; Combinatorics on words; Data indexing and compression000 Computer science knowledge general worksSettore INF/01 - InformaticaCombinatorics on words05 social sciences02 engineering and technologyData_CODINGANDINFORMATIONTHEORYComputer ScienceBurrows-wheeler transformationComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencesData Structures and Algorithms (cs.DS)Data indexing and compressionCombinatorics on word
researchProduct

Bayesian System for Differential Cryptanalysis of DES

2014

AbstractThis paper proposes a new formalization for the differential cryptanalysis of DES (Data Encryption Standard) based on Bayesian Networks (BN), an artificial intelligence framework used for reasoning on data affected by uncertainty. Through the proposed approach it is possible to analyze DES from a novel point of view, thus paving the way for the development of a new class of cryptanalysis methods.

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniNeural cryptographyTheoretical computer scienceDifferential cryptanalysisbusiness.industryBayesian probabilityBayesian networkCryptographyData_CODINGANDINFORMATIONTHEORYEncryptionDESlaw.inventionBayesian Networks;lawCryptographyBayesian NetworksPoint (geometry)Cryptanalysisbusinessdifferential cryptanalysiMathematicsdifferential cryptanalysisIERI Procedia
researchProduct

Bluetooth-3G wireless transmission system for neural signal telemetry

2007

In this contribution a wireless transmission system for neural signals is developed. This system includes data compression algorithms at the information source, namely neural signals recorded by micro-electrode arrays. The signals are transmitted over Bluetooth to a mobile device that, without any processing or storing, retransmits it over 3G to a remote server where signal post-processing and analysis is performed. The overall transmission rate of the system is limited by the Bluetooth link between the information source and the mobile phone, as well as by the limited processing capabilities of the mobile device and also by the 3G-link. Data compression allows the transmission of up to 7 n…

Signal processingbusiness.industryComputer scienceComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSData_CODINGANDINFORMATIONTHEORYSignallaw.inventionBluetoothTransmission (telecommunications)lawMobile phoneEmbedded systemWirelessbusinessMobile deviceComputer hardwareData compression2007 Wireless Telecommunications Symposium
researchProduct

A performance study of LTE MIMO-OFDM systems using the extended one-ring MIMO channel model

2012

In this paper, we consider a long-term evolution (LTE) system for the downlink by using multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) techniques. The downlink channel is modeled by the socalled extended MIMO one-ring model. This model extends the well-known narrowband one-ring model with respect to frequency selectivity. The symbol error rate (SER) performance of the LTE MIMO-OFDM system is investigated for the downlink by employing different kinds of spatial encoders, where it is assumed that the channel state information (CSI) is perfectly known. For comparison, the space-time block coding (STBC) scheme, the vertical Bell Laboratories layered spac…

Space–time block code3G MIMOOrthogonal frequency-division multiplexingComputer scienceChannel state informationReal-time computingMIMOTelecommunications linkData_CODINGANDINFORMATIONTHEORYMIMO-OFDMTopologyMulti-user MIMOComputer Science::Information TheoryThe 2012 International Conference on Advanced Technologies for Communications
researchProduct

A limited feedback scheme based on spatially correlated channels for coordinated multipoint systems

2012

High spectral efficiency can be achieved in the downlink of multi-antenna coordinated multi-point systems provided that the multiuser interference is appropriately managed at the transmitter side. For this sake, downlink channel information needs to be sent back by the users, thus reducing the rate available at the uplink channel. The amount and type of feedback information required has been extensively studied and many limited feedback schemes have been proposed lately. A common pattern to all of them is that achieving low rates of feedback information is possible at the cost of increasing complexity at the user side and, sometimes, assuming that some statistics of the channel are known. I…

Spatial correlationWireless communicationsComputer Networks and CommunicationsComputer scienceMIMOData_CODINGANDINFORMATIONTHEORYPrecodingTelecomunicacióControl theoryTEORIA DE LA SEÑAL Y COMUNICACIONESTelecommunications linkZero-forcing precodingWirelessComunicació i tecnologiaComputer Science::Information Theorybusiness.industryQuantization (signal processing)TransmitterLimited feedbackPrecodingComputer Science ApplicationsMIMOSignal ProcessingBit error ratebusinessAlgorithmCommunication channelEURASIP Journal on Wireless Communications and Networking
researchProduct