Linear network coding: Difference between revisions

Content deleted Content added
m Applications: Typo fixing, replaced: sytems → systems
m Applications: task, replaced: 5TH → 5th
Line 92:
* Distributed storage<ref name="Bilal, Muhammad 2019 1376–1385" /><ref>{{Cite web |last1=Acedański |first1=Szymon |last2=Deb |first2=Supratim |last3=Médard |first3=Muriel |last4=Koetter |first4=Ralf |title=How Good is Random Linear Coding Based Distributed Networked Storage? |url=http://web.mit.edu/~medard/www/page2/mpapers/netcod2005_accek.pdf |url-status=live |access-date=26 March 2022 |website=web.mit.edu}}</ref><ref>{{Cite arXiv |eprint = cs/0702015|last1 = Dimakis|first1 = Alexandros|title = Network Coding for Distributed Storage Systems|year = 2007}}</ref>
* Throughput increase in wireless mesh networks, e.g.: [[COPE (network coding)|COPE]],<ref name=":0">{{Cite journal |last1=Katti |first1=Sachin |last2=Rahul |first2=Hariharan |last3=Hu |first3=Wenjun |last4=Katabi |first4=Dina |last5=Médard |first5=Muriel |last6=Crowcroft |first6=Jon |date=2006-08-11 |title=XORs in the air: practical wireless network coding |url=http://nms.csail.mit.edu/~sachin/papers/copesc.pdf |journal=Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications |series=SIGCOMM '06 |___location=New York, NY, USA |publisher=Association for Computing Machinery |pages=243–254 |doi=10.1145/1159913.1159942 |isbn=978-1-59593-308-9 |s2cid=207160426}}</ref> [[CORE (network coding)|CORE]],<ref>{{cite book | doi = 10.1109/VTCSpring.2013.6692495 | title=CORE: COPE with MORE in Wireless Meshed Networks | journal=2013 IEEE 77th Vehicular Technology Conference (VTC Spring)| pages=1–6 | year=2013 | last1=Krigslund | first1=Jeppe | last2=Hansen | first2=Jonas | last3=Hundeboll | first3=Martin | last4=Lucani | first4=Daniel E. | last5=Fitzek | first5=Frank H. P. | isbn=978-1-4673-6337-2 | s2cid=1319567 }}</ref> [[Coding-aware routing]],<ref>{{Cite journal |last1=Sengupta |first1=S. |last2=Rayanchu |first2=S. |last3=Banerjee |first3=S. |date=May 2007 |title=An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing |url=https://ieeexplore.ieee.org/document/4215706 |journal=IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications |pages=1028–1036 |doi=10.1109/INFCOM.2007.124|isbn=978-1-4244-1047-7 |s2cid=3056111 }}</ref> and [[B.A.T.M.A.N.]]<ref>{{Cite web |title=NetworkCoding - batman-adv - Open Mesh |url=http://www.open-mesh.org/projects/batman-adv/wiki/NetworkCoding |url-status=live |archive-url=https://web.archive.org/web/20210512133041/https://www.open-mesh.org/projects/batman-adv/wiki/NetworkCoding |archive-date=12 May 2021 |website=www.open-mesh.org |accessdate=2015-10-28}}</ref>
* Buffer and delay reduction in spatial sensor networks: [[Spatial buffer multiplexing]]<ref>{{Cite journal |last1=Bhadra |first1=S. |last2=Shakkottai |first2=S. |date=April 2006 |title=Looking at Large Networks: Coding vs. Queueing |url=https://ieeexplore.ieee.org/document/4146919/;jsessionid=Vf_H7NM8pJZkcL5tUwrvGHQd45FXGbWGEGG9OyMg__IVxRlWxF8t!-1723551334 |journal=Proceedings IEEE INFOCOM 2006. 25TH25th IEEE International Conference on Computer Communications |pages=1–12 |doi=10.1109/INFOCOM.2006.266|isbn=1-4244-0221-2 |s2cid=730706 }}</ref>
* Wireless broadcast:<ref name=":11" /> RLNC can reduce the number of packet transmission for a single-hop wireless multicast network, and hence improve network bandwidth<ref name=":11">{{Cite journal | doi=10.1109/TVT.2008.927729| title=Wireless Broadcast Using Network Coding| journal=IEEE Transactions on Vehicular Technology| volume=58| issue=2| pages=914–925| year=2009| last1=Dong Nguyen| last2=Tuan Tran| last3=Thinh Nguyen| last4=Bose| first4=B.|citeseerx = 10.1.1.321.1962| s2cid=16989586}}</ref>
* Distributed file sharing<ref>{{Cite journal |last1=Firooz |first1=Mohammad Hamed |last2=Roy |first2=Sumit |date=24 March 2012 |title=Data Dissemination in Wireless Networks with Network Coding |journal=IEEE Communications Letters |volume=17 |issue=5 |pages=944–947 |doi=10.1109/LCOMM.2013.031313.121994 |arxiv=1203.5395 |s2cid=13576 |issn=1089-7798}}</ref>