MAC and link layer optimization, and then extend the model to include routing optimization. The joint optimization minimizes the total energy consumption including both the transmission energy and the circuit processing energy across the network. We propose variable-length TDMA schemes where the slot

and link layer optimization, and then extend the model to include routing optimization. The joint optimization minimizes the total energy consumption including both the transmission energy and the circuit processing energy across the network. We propose variable-length TDMA schemes where the slot length

-range communications. We emphasize that the energy efficiency must be supported across all layers of the protocol stack through a cross-layer design. In this context, we analyze energy-efficient joint routing, scheduling, and link adaptation strategies that maximize the network lifetime. We propose variable-length

energy consumption necessary for collecting a certain amount of data from multiple sensors. The total energy consumption includes both the transmission energy and the circuit energy consumption. We propose a variable-length TDMA scheme where the slot length is adaptively assigned according to the number

delay spread values and various numbers of users. The results show that our proposed algorithm outperforms multiuser OFDM systems with static time-division multiple access (TDMA) or frequency-division multiple access (FDMA) techniques which employ fixed and predetermined time-slot or subcarrier

This paper presents a variable-length decision-feedback scheme that uses tail-biting convolutional codes and the tail-biting Reliability-Output Viterbi Algoritm (ROVA). Comparing with recent results in finite-blocklength information theory, simulation results for both the BSC and the AWGN channel

Abstract: Popular fault-tolerant1 TDMA-based protocols like TT-CAN ([Fu00] and [Mu02]), TTP ([KG93]) and FlexRay ([Fl02]) are using a static slotting scheme for bus arbitration. This paper describes a possible solution for a more exible handling of the slotting, by providing extra time of variable

We present a new variable-length encoding scheme for sequences of integers, Directly Addressable Codes (DACs), which enables direct access to any element of the encoded sequence without the need of any sampling method. Our proposal is a kind of implicit data structure that introduces synchronism

at the de-coder to improve the decoder’s probability-of-error performance. A new approach to joint source-channel maximum a posteri-ori probability (MAP) decoding applicable to systems employing variable-length source codes (VLCs) was recently developed by the authors – the resulting joint decoder’s

We study estimation in the class of stationary variable length Markov chains (VLMC) on a finite space. The processes in this class are still Markovian of higher order, but with memory of variable length yielding a much bigger and structurally richer class of models than ordinary higher order Markov