{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:32Z","timestamp":1750306892251,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T00:00:00Z","timestamp":1373587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2013,7,12]]},"abstract":"<jats:p>In a challenged network environment, where end-to-end connectivity may be a rare occurrence, delay-tolerant routing protocols must strike a balance between the increased robustness and reliability that comes with message replication and the resulting high bandwidth and storage overhead. Network coded routing, in which a node combines messages from different sources, has been shown to increase reliability in the presence of link failures with small additional overhead. A drawback of network coded routing is the lack of a natural stopping condition to control the dissemination of data. We describe an enhanced coding router that uses the mathematical structure of the orthogonal complement, or nullspace, as an improved stopping condition to eliminate redundant transmissions, and an additional technique to balance multiple coded data flows. These changes are incorporated into the DTN2 Reference Implementation and evaluated in two types of experiments. In a simple data-mule scenario, our EBR router comes very close to perfect efficiency. In a more complicated scenario with segmented communities and occasional nodes moving between them, our solutions show a drastic improvement in delivery rates.<\/jats:p>","DOI":"10.1145\/2502935.2502938","type":"journal-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:45Z","timestamp":1373998005000},"page":"14-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Nullspace-based stopping conditions for network-coded transmissions in DTNs"],"prefix":"10.1145","volume":"17","author":[{"given":"Angela","family":"Hennessy","sequence":"first","affiliation":[{"name":"The Laboratory for Telecommunications Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Gladd","sequence":"additional","affiliation":[{"name":"Raytheon BBN Technologies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brenton","family":"Walker","sequence":"additional","affiliation":[{"name":"The Laboratory for Telecommunications Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2009.10"},{"volume-title":"Proc. 42nd Allerton Conference on Communication, Control, and Computing","year":"2004","author":"Deb S.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","unstructured":"DTNRG. DTN bundle protocol ref. implm. http:\/\/www.dtnrg.org\/wiki\/Code.  DTNRG. DTN bundle protocol ref. implm. http:\/\/www.dtnrg.org\/wiki\/Code."},{"key":"e_1_2_1_5_1","unstructured":"http:\/\/www.emulab.net.  http:\/\/www.emulab.net."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863960"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1925019.1925024"},{"key":"e_1_2_1_10_1","unstructured":"J. Zinky and A. Caro and G. Stein. Bundle protocol erasure coding extension. Internet Draft.  J. Zinky and A. Caro and G. Stein. Bundle protocol erasure coding extension. Internet Draft."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080106"},{"key":"e_1_2_1_12_1","first-page":"4122","article-title":"A Universally Unique IDentifier (UUID) URN Namespace","author":"Leach P.","year":"2005","journal-title":"RFC"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080606"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414393.2414397"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414393.2414397"},{"key":"e_1_2_1_16_1","first-page":"1","article-title":"Ibr-dtn: A lightweight, modular and highly portable bundle protocol implementation","volume":"37","author":"Schildt S.","year":"2011","journal-title":"Electronic Communications of the EASST"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"K. Scott and S. Burleigh. Bundle Protocol Specification. RFC 5050 (Experimental) Nov. 2007.  K. Scott and S. Burleigh. Bundle Protocol Specification. RFC 5050 (Experimental) Nov. 2007.","DOI":"10.17487\/rfc5050"},{"key":"e_1_2_1_18_1","unstructured":"A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks 2000.  A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks 2000."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030652.2030659"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080140"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.52"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502935.2502938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502935.2502938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:55Z","timestamp":1750234735000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502935.2502938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,12]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7,12]]}},"alternative-id":["10.1145\/2502935.2502938"],"URL":"https:\/\/doi.org\/10.1145\/2502935.2502938","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2013,7,12]]},"assertion":[{"value":"2013-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}