{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:41:52Z","timestamp":1649018512793},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,7,9]],"date-time":"2013-07-09T00:00:00Z","timestamp":1373328000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Intersession network coding (NC) can provide significant performance benefits via mixing packets at wireless routers; these benefits are especially pronounced when NC is applied in conjunction with intelligent scheduling. NC, however, imposes certain processing operations, such as encoding, decoding, copying, and storage. When not utilized carefully, all these operations can induce tremendous processing overheads in practical settings. Our testbed measurements suggest that such processing operations can severely degrade the router throughput, especially at high bit rates. Motivated by this, we design network coding framework for rate adaptive wireless links (NCRAWL). The design of NCRAWL facilitates low overhead NC operations, thereby effectively approaching the theoretically expected throughput benefits of joint NC and scheduling. We implement and evaluate NCRAWL on a wireless testbed. Our experiments demonstrate that NCRAWL meets the theoretical predicted throughput gain while requiring much less CPU processing, compared to related frameworks.<\/jats:p>","DOI":"10.1186\/1687-1499-2013-187","type":"journal-article","created":{"date-parts":[[2013,7,9]],"date-time":"2013-07-09T12:09:41Z","timestamp":1373371781000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A modular framework for implementing joint wireless network coding and scheduling algorithms"],"prefix":"10.1186","volume":"2013","author":[{"given":"Ioannis","family":"Broustis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios S","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Syrivelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Georgiadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandros","family":"Tassiulas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,9]]},"reference":[{"issue":"4","key":"771_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li R, Yeung RW, S Y: Network information flow. IEEE Trans. Inform. Theory 2000, 46(4):1204-1216. 10.1109\/18.850663","journal-title":"IEEE Trans. Inform. Theory"},{"key":"771_CR2","doi-asserted-by":"crossref","unstructured":"Chaporkar P, Proutiere A: Adaptive network coding and scheduling for maximizing throughput in wireless networks. In Paper presented at the 13th ACM MobiCom. Montreal, Canada, 9\u201314 September 2007;","DOI":"10.1145\/1287853.1287870"},{"issue":"3","key":"771_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TNET.2008.923722","volume":"16","author":"S Katti","year":"2008","unstructured":"Katti S, Rahul H, Hu W, Katabi D, Medard M, Crowcroft J: XORs in the air: practical wireless network coding. IEEE\/ACM Trans. Netw 2008, 16(3):497-510.","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"771_CR4","doi-asserted-by":"crossref","unstructured":"Kim JW, Lho YU, Kim YJ, Kim KB, Lee SW: A memory copy reduction scheme for networked multimedia service in Linux kernel. In Paper presented at EurAsia-ICT. Shiraz, Iran, 29\u201331 October 2002;","DOI":"10.1007\/3-540-36087-5_22"},{"key":"771_CR5","volume-title":"Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications Higher Speed PHY Layer Extension in the 2.4 GHz Band,","author":"IEEE 802.11 WG part 11b","year":"1999","unstructured":"IEEE 802.11 WG part 11b: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications Higher Speed PHY Layer Extension in the 2.4 GHz Band,. 1999."},{"key":"771_CR6","doi-asserted-by":"crossref","unstructured":"Scheuermann B, Hu W, Crowcroft J: Near-optimal co-ordinated coding in wireless multihop networks. In Paper presented at ACM CoNEXT. Columbia University New York USA 10\u201313 December 2007;","DOI":"10.1145\/1364654.1364666"},{"key":"771_CR7","doi-asserted-by":"crossref","unstructured":"Rozner E, Iyer A, Mehta Y, Qiu L, Jafry M: E R: Efficient retransmission scheme for wireless LANs. In Paper presented at ACM CONEXT. Columbia University New York USA 10\u201313 December 2007;","DOI":"10.1145\/1364654.1364665"},{"key":"771_CR8","doi-asserted-by":"crossref","unstructured":"Rayanchu S, Sen S, Wu J, Banerjee S, Sengupta S: Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation. In Paper presented at ACM SIGMETRICS. Annapolis, MD USA 2\u20136 June 2008;","DOI":"10.1145\/1375457.1375468"},{"key":"771_CR9","doi-asserted-by":"crossref","unstructured":"Chachulski S, Jennings M, Katti S, Katabi D: Trading structure for randomness in wireless opportunistic routing. In Paper presented at ACM SIGCOMM. Kyoto Japan 27\u201331 August 2007;","DOI":"10.1145\/1282380.1282400"},{"key":"771_CR10","unstructured":"Engineering UCLA: Click modular router. (University of California 2013); . Accessed (10 September 2011) http:\/\/read.cs.ucla.edu\/click\/"},{"key":"771_CR11","doi-asserted-by":"crossref","unstructured":"Kim TS, Vural S, Broustis I, Syrivelis D, Krishnamurthy SV, La Porta TF: A framework for joint network coding and transmission rate control in wireless networks. In Paper presented at IEEE INFOCOM. San Diego USA 14\u201319 March 2010;","DOI":"10.1109\/INFCOM.2010.5462127"},{"key":"771_CR12","doi-asserted-by":"crossref","unstructured":"Katti S, Katabi D, Balakrishnan H, Medard M: Symbol-level network coding for wireless mesh networks. In Paper presented at ACM SIGCOMM. Seattle USA 17\u201322 August 2008;","DOI":"10.1145\/1402958.1403004"},{"issue":"6","key":"771_CR13","doi-asserted-by":"publisher","first-page":"2608","DOI":"10.1109\/TIT.2006.874523","volume":"52","author":"DS Lun","year":"2006","unstructured":"Lun DS, Ratnakar N, Mudard M, Koetter R, Karger DR, Ho T, Ahmed E, Zhao F: Minimum-cost multicast over coded packet networks. IEEE Trans. Inform. Theory 2006, 52(6):2608-2623.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"771_CR14","doi-asserted-by":"crossref","unstructured":"Liu CH, Xue F: Network coding for two-way relaying: rate region, sum rate and opportunistic scheduling. In Paper presented at IEEE ICC. Beijing, China, 19\u201323 May 2008;","DOI":"10.1109\/ICC.2008.204"},{"key":"771_CR15","doi-asserted-by":"crossref","unstructured":"Seferoglu H, Markopoulou A: Distributed rate control for video streaming over wireless networks with intersession network coding. In Paper presented at seventeenth international packet video workshop. Seattle, Washington, 11\u201312 May 2009;","DOI":"10.1109\/PACKET.2009.5152165"},{"key":"771_CR16","doi-asserted-by":"crossref","unstructured":"Vieira LFM, Misra A, Gerla M: Performance of network coding in multi-rate wireless environments for multicast applications. In Paper presented at IEEE MILCOM. Orlando, FL, USA,29\u201331 October 2007;","DOI":"10.1109\/MILCOM.2007.4454823"},{"key":"771_CR17","doi-asserted-by":"crossref","unstructured":"Paschos GS, Fragiadakis C, Georgiadis L, Tassiulas L: Wireless network coding with partial overhearing information. In Paper presented at IEEE INFOCOM. Turin, Italy, 14\u201319 April 2013;","DOI":"10.1109\/INFCOM.2013.6567038"},{"key":"771_CR18","doi-asserted-by":"crossref","unstructured":"Bicket J, Aguayo D, Biswas S, Morris R: Architecture and evaluation of an unplanned 802.11b mesh network. In Paper presented at ACM MobiCom. Cologne, Germany, 28 August\u20132 September 2005;","DOI":"10.1145\/1080829.1080833"},{"key":"771_CR19","unstructured":"CSAIL MIT MIT Roofnet: (Massachusetts Insitute of Technology, 2013). . Accessed (10 September 2011) http:\/\/pdos.csail.mit.edu\/roofnet"},{"key":"771_CR20","unstructured":"Partow A: SDBM hash function. (Arash Partow, 2013) . Accessed (15 June 2009) http:\/\/www.partow.net\/programming\/hashfunctions\/"},{"key":"771_CR21","doi-asserted-by":"crossref","unstructured":"De Couto DSJ, Aguayo D, Bicket J, Morris R: A high throughput path metric for multiHop wireless routing. In Paper presented at ACM MobiCom. San Diego, California, 14\u201319 September 2003;","DOI":"10.1145\/938985.939000"},{"key":"771_CR22","doi-asserted-by":"crossref","unstructured":"Draves R, Padhye J, Zill B: Routing in multi-radio, multi-hop wireless mesh networks. In Paper presented at ACM MobiCom. Philadelphia, PA, USA, 26 September\u20131 October 2004;","DOI":"10.1145\/1023720.1023732"},{"key":"771_CR23","first-page":"1664","volume":"3","author":"D Raychaudhuri","year":"2005","unstructured":"Raychaudhuri D, Seskar I, Ott M, Ganu S, Ramachandran K, Kremo H, Siracusa R, Liu H, Singh M: Overview of the ORBIT radio grid testbed for evaluation of next-generation wireless network protocols. IEEE WCNC 2005, 3: 1664-1669.","journal-title":"IEEE WCNC"},{"issue":"12","key":"771_CR24","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L Tassiulas","year":"1992","unstructured":"Tassiulas L, Ephremides A: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE T. Automat. Contr 1992, 37(12):1936-1948. 10.1109\/9.182479","journal-title":"IEEE T. Automat. Contr"},{"issue":"8","key":"771_CR25","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/26.780463","volume":"47","author":"N Mckeown","year":"1999","unstructured":"Mckeown N, Mekkittikul A, Anantharam V, Walrand J: Achieving 100% throughput in an input-queued switch. IEEE Trans. Commun 1999, 47(8):1260-1267.","journal-title":"IEEE Trans. Commun"},{"key":"771_CR26","unstructured":"Eryilmaz A, Lun DS: Control for inter-session network coding. In Paper presented at workshop on network coding (NetCod), theory and applications. Chinese University of Hong Kong, 3\u20134 January 2007;"},{"key":"771_CR27","volume-title":"Paper presented at the 7th international workshop on resource allocation and cooperation in wireless networks\u2013in conjunction with WiOpt","author":"GS Paschos","year":"2011","unstructured":"Paschos GS, Georgiadis L, Tassiulas L: Optimal scheduling of pairwise XORs under statistical overhearing and feedback. In Paper presented at the 7th international workshop on resource allocation and cooperation in wireless networks\u2013in conjunction with WiOpt 2011. Princeton NJ, 13 May 2011;"},{"issue":"3\u20134","key":"771_CR28","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s11134-012-9301-2","volume":"72","author":"GS Paschos","year":"2012","unstructured":"Paschos GS, Georgiadis L, Tassiulas L: Scheduling with pairwise XORing of packets under statistical overhearing information and feedback. Queueing Syst 2012, 72(3\u20134):361-395.","journal-title":"Queueing Syst"},{"key":"771_CR29","unstructured":"SourceForge: Iperf bandwidth measurement tool (NLANR\/DAST, 2013). . Accessed (15 June 2009) http:\/\/iperf.sourceforge.net\/"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-187.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2013-187\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-187.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T00:56:16Z","timestamp":1630544176000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2013-187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,9]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["771"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2013-187","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,9]]},"assertion":[{"value":"29 March 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2013","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"187"}}