A Very Fast Tags Polling Protocol for Single and Multiple Readers RFID Systems, and its Applications

Autor: Francesca Martelli, Maurizio A. Bonuccelli

Publikováno v: Ad hoc networks 71 (2018): 14–30. doi:10.1016/j.adhoc.2017.12.002
info:cnr-pdr/source/autori:Bonuccelli M.A.; Martelli F./titolo:A very fast tags polling protocol for single and multiple readers RFID systems, and its applications/doi:10.1016%2Fj.adhoc.2017.12.002/rivista:Ad hoc networks/anno:2018/pagina_da:14/pagina_a:30/intervallo_pagine:14–30/volume:71

In this paper, we present a very fast and simple protocol for polling tags in an RFID system formed by one or more readers, and a multitude of tags. Actually, the protocol is time-optimal for single reader systems, while being very fast for multiple

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb297a1ebf9d72e8837eb55692717def
http://hdl.handle.net/11568/887731

Goodput Maximization in Opportunistic Spectrum Access Networks under Constraints on the Inter-Packet Transmission Waiting Time

Autor: Loreto Pescosolido, Maurizio A. Bonuccelli, Donatella Ermini, Chiara Petrioli

We consider the problem of selecting the packet size, the Forward Error Correction (FEC) coding rate, and the duration of the spectrum sensing interval, which maximize the communication goodput (payload bits correctly received per unit time) of the S

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d67cabce73054be58045bea727f20927
http://hdl.handle.net/11568/770733

[Untitled]

Autor: Alan A. Bertossi, Roberto Battiti, Maurizio A. Bonuccelli

Publikováno v: Wireless Networks. 5:195-209

In the Code Division Multiple Access (CDMA) framework, collisions that can occur in wireless networks are eliminated by assigning orthogonal codes to stations, a problem equivalent to that of coloring graphs associated to the physical network. In thi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6d1208cf1bb3e27503aa49cb9ac8e8a7
https://doi.org/10.1023/a:1019146910724

Minimum Message Waiting Time Scheduling in Distributed Systems

Autor: Francesca Martelli, Maurizio A. Bonuccelli

Publikováno v: IEEE transactions on parallel and distributed systems
99 (2012): 1–7. doi:10.1109/TPDS.2012.284
info:cnr-pdr/source/autori:Martelli Francesca, Bonuccelli Maurizio Angelo/titolo:Minimum Message Waiting Time Scheduling in Distributed Systems/doi:10.1109%2FTPDS.2012.284/rivista:IEEE transactions on parallel and distributed systems (Print)/anno:2012/pagina_da:1/pagina_a:7/intervallo_pagine:1–7/volume:99

In this paper, we examine the problem of packet scheduling in a single-hop multichannel system, with the goal of minimizing the average message waiting time. Such an objective function represents the delay incurred by the users before receiving the d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1b6386c99a1dd40453c885f206c9c43
http://hdl.handle.net/11568/159064

Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems

Autor: Maurizio A. Bonuccelli, Piera Barcaccia

Publikováno v: IEEE/ACM Transactions on Networking. 2:247-251

Considers the optimal (i.e., minimum length) time slot assignment problem for variable bandwidth switching systems. Existing algorithms for this problem are known to be pseudo-polynomial. The practical question of finding a fast optimal algorithm, as

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86c997533df71813c7f38fd5e32e84f1
https://doi.org/10.1109/90.311622