Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Niv Voskoboynik

dblp:158/6433 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 77% Wireless networking · 12% Internet of things and sensor networks · 12%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
multicast
0.312017
Network Coding Schemes for Data Exchange Networks With Arbitrary Transmission Delays · IEEE/ACM Trans. Netw. 2017
Internet architecture and protocols › multicast
network-coded multicast
0.312017
Network Coding Schemes for Data Exchange Networks With Arbitrary Transmission Delays · IEEE/ACM Trans. Netw. 2017
Coding theory
network coding
0.312017
Network Coding Schemes for Data Exchange Networks With Arbitrary Transmission Delays · IEEE/ACM Trans. Netw. 2017
Internet of things and sensor networks
energy efficiency
0.112017
Network Coding Schemes for Data Exchange Networks With Arbitrary Transmission Delays · IEEE/ACM Trans. Netw. 2017
Wireless networking
wireless network protocols
0.112017
Network Coding Schemes for Data Exchange Networks With Arbitrary Transmission Delays · IEEE/ACM Trans. Netw. 2017

Methods — techniques the papers use, named apart from their topics

simulation · 0.6
YearPublicationVenuePosition
2017 Network Coding Schemes for Data Exchange Networks With Arbitrary Transmission Delays
abstract
In this paper, we introduce construction techniques for network coding in bidirectional networks with arbitrary transmission delays. These coding schemes reduce the number of transmissions and achieve the optimal rate region in the corresponding broadcast model for both multiple unicast and multicast cases with up to three users, under the equal rate constraint. The coding schemes are presented in two phases; first, coding schemes for line, star and line-star topologies with arbitrary transmission delays are provided and second, any general topology with multiple bidirectional unicast and multicast sessions is shown to be decomposable into these canonical topologies to reduce the number of transmissions. As a result, the coding schemes developed for the line, star, and line-star topologies serve as building blocks for the construction of more general coding schemes for all networks. The proposed schemes are proved to be real time in the sense that they achieve the minimum decoding delay. With a negligible size header, these coding schemes are shown to be applicable to unsynchronized networks, i.e., networks with arbitrary transmission delays. Finally, we demonstrate the applicability of these schemes by extensive simulations. The implementation of such coding schemes on a wireless network with arbitrary transmission delays can improve performance and power efficiency.
Niv Voskoboynik, Haim H. Permuter, Asaf Cohen 0001
IEEE/ACM Trans. Netw.1