In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
In a wireless communications network, the movement of mobile users presents significant technical challenges to providing efficient access to the wired broadband network. In this ...
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...
Mobile ad-hoc networks (MANETs) present quite large packet loss bursts due to mobility. In this work we propose two models based on hidden Markov models for estimating packet arri...
Carlos Miguel Tavares Calafate, Pietro Manzoni, Ma...
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...