Daniel Enrique Lucani

Daniel Enrique Lucani

Auto-generated profile, based on publicly available information

Daniel Enrique Lucani

Aarhus University

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2009
Verified
Conference Paper
Closed access
DLD. E. Lucani
D. E. Lucani
MSM. Stojanovic
M. Stojanovic
MMM. Medard
M. Medard
A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. We provide an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. We show that its performance is very close to that of a full duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also, we study the throughput performance of our scheme and compare it to existing half-duplex go-back-N and selective repeat ARQ schemes. Numerical results, obtained for different latencies, show that our scheme has similar performance to the selective repeat in most cases and considerable performance gain when latency and packet error probability is high.

1 April 2008
Verified
Conference Paper
Closed access
DLDaniel E. Lucani
Daniel E. Lucani
MSMilica Stojanovic
Milica Stojanovic
MMMuriel Medard
Muriel Medard
The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission bandwidth depends on the transmission distance, a feature that distinguishes an underwater acoustic system from a terrestrial radio system. The exact relationship between power, transmission band, distance and capacity for the Gaussian noise scenario is a complicated one. This work provides a closed-form approximate model for (1) power consumption, (2) band-edge frequency and (3) bandwidth as functions of distance and capacity required for a data link. This approximate model is obtained by numerical evaluation of analytical results which takes into account physical models of acoustic propagation loss and ambient noise. The closed-form approximations may become useful tools in the design and analysis of underwater acoustic networks.

1 May 2014 in IEEE Communications Magazine
Verified
Journal Article
Closed access
PPPeyman Pahlevani
Peyman Pahlevani
MHMartin Hundebøll
Martin Hundebøll
MPMorten V. Pedersen
Morten V. Pedersen
DLDaniel Lucani
Daniel Lucani
HCHassan Charaf
Hassan Charaf
MKMarcos Katz
Marcos Katz
Device-to-device communication is currently a hot research topic within 3GPP. Even though D2D communication has been part of previous ad hoc, meshed and sensor networks proposals, the main contribution by 3GPP is that the direct communication among two devices is carried out over a dynamically assigned, licensed spectrum; thus, it is under full control of the cellular network. D2D communication creates a market potential for new services, new approaches to efficient spectrum use, and security concepts. This is especially true if D2D communication is extended to larger communication groups organized in meshed clusters. In this article, we discuss the potential and shortcomings of D2D communication as proposed today, advocating for the use of network coding as an enabling technology for enhanced security and communication efficiency using the PlayNCool and CORE protocols as key examples to deliver smarter D2D systems.

21 April 2011 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MNMaricica Nistor
Maricica Nistor
DLDaniel E. Lucani
Daniel E. Lucani
TVTiago T. V. Vinhoza
Tiago T. V. Vinhoza
RCRui A. Costa
Rui A. Costa
JBJoao Barros
Joao Barros
A fundamental understanding of the delay behavior of network coding is key towards its successful application in real-time applications with strict message deadlines. Previous contributions focused mostly on the average decoding delay, which although useful in various scenarios of interest is not sufficient for providing worst-case delay guarantees. To overcome this challenge, we investigate the entire delay distribution of random linear network coding for any field size and arbitrary number of encoded symbols (or generation size). By introducing a Markov chain model we are able to obtain a complete solution for the erasure broadcast channel with two receivers. A comparison with Automatic Repeat reQuest (ARQ) with perfect feedback, round robin scheduling and a class of fountain codes reveals that network coding on GF(24) offers the best delay performance for two receivers. We also conclude that GF(2) induces a heavy tail in the delay distribution, which implies that network coding based on XOR operations although simple to implement bears a relevant cost in terms of worst-case delay. For the case of three receivers, which is mathematically challenging, we propose a brute-force methodology that gives the delay distribution of network coding for small generations and field size up to GF(24).

1 November 2009
Verified
Conference Paper
Closed access
DLDaniel E. Lucani
Daniel E. Lucani
MMMuriel Medard
Muriel Medard
MSMilica Stojanovic
Milica Stojanovic
We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study the case of a node broadcasting to several receivers. We show that the effect of the field size can be included in the transition probabilities of the Markov chain model of the system. Also, an improved upper bound on the mean number of coded packets required to decode M original data packets using random linear network coding is presented. This bound shows that even if the field size is 2, i.e. we perform XORs amongst randomly selected packets from the pool of M original ones, we will need on average at most M + 2 coded packets in order to decode. Thus, there will be only a very small degradation in performance if M is large. We present numerical results showing that the mean completion time of our scheme with a field size of 2 is close in performance to our scheme when we use larger field sizes. We also show that as M increases, the difference between using a field size of 2 and larger field sizes decreases. Finally, we show that we can get very close to the optimal performance with small field sizes, e.g. a field size of 4 or 8, even when M is not very large.

15 March 2012 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
DLDaniel E. Lucani
Daniel E. Lucani
MMMuriel Medard
Muriel Medard
MSMilica Stojanovic
Milica Stojanovic
In networks with large latency, feedback about received packets may lag considerably the transmission of the original packets, limiting the feedback's usefulness. Moreover, time duplex constraints may entail that receiving feedback may be costly. In this work, we consider tailoring feedback and coding jointly in such settings to reduce the expected delay for successful in order reception of packets. We find that, in certain applications, judicious choices provide results that are close to those that would be obtained with a full-duplex system. We study two cases of data transmission: one-to-all broadcast and all-to-all broadcast. We also analyze important practical considerations weighing the trade off between performance and complexity in applications that rely on random linear network coding. Finally, we study the problem of transmission of information under the large latency and time duplexing constraints in the presence of random packet arrivals. In particular, we analyze the problem of using a batch by batch approach and an online network coding approach with Poisson arrivals. We present numerical results to illustrate the performance under a variety of scenarios and show the benefits of the proposed schemes as compared to typical ARQ and scheduling schemes.