{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:06:08Z","timestamp":1768345568906,"version":"3.49.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T00:00:00Z","timestamp":1506384000000},"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":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2017,11,30]]},"abstract":"<jats:p>Delay- and Disruption-Tolerant Networks (DTNs) refer to a range of networks with link intermittency that is mainly driven by mobility, predictable or unpredictable network environmental conditions. Examples of DTNs include interplanetary networks, battlefield networks, smart highways, remote sensing, and animal-movement outposts. There exist a number of mobility models describing the operation of various DTNs. One common characteristic that all mobility models share is the distribution of contact time and inter-contact time between nodes. Predicting an end-to-end delay in networks with disruptive links is more complicated than predicting the delay in connected networks. Disruptive patterns and underlying routing algorithms play a major role in an end-to-end delay modeling. In this article, we introduce a new model that can be used to estimate the end-to-end delay in networks with intermittent links. The model incorporates the two non-deterministic delay distributions, namely link intermittency and tandem queuing delay distributions. The model is based on an open queuing system with exponentially distributed link intermittency. The model gives a close approximation of the average end-to-end delay and the delay variance in closed forms. Simulation results on various networks and under different traffic conditions confirm the accuracy of the model within the conventional bounds of statistical significance.<\/jats:p>","DOI":"10.1145\/3133322","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Link Modeling and Delay Analysis in Networks with Disruptive Links"],"prefix":"10.1145","volume":"13","author":[{"given":"Hassan","family":"Peyravi","sequence":"first","affiliation":[{"name":"Kent State University, Kent, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Sehgal","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2419819"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:WINE.0000036458.88990.e5"},{"key":"e_1_2_1_3_1","unstructured":"Lorenzo Bracciale Marco Bonola Pierpaolo Loreti Giuseppe Bianchi Raul Amici and Antonello Rabuffi. 2014. CRAWDAD dataset roma\/taxi (v. 2014-07-17). Retrieved from http:\/\/crawdad.org\/roma\/taxi\/20140717.  Lorenzo Bracciale Marco Bonola Pierpaolo Loreti Giuseppe Bianchi Raul Amici and Antonello Rabuffi. 2014. CRAWDAD dataset roma\/taxi (v. 2014-07-17). Retrieved from http:\/\/crawdad.org\/roma\/taxi\/20140717."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353987"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.72"},{"key":"e_1_2_1_6_1","unstructured":"CellMapper. 2017. cellmapper.net. Retrieved from https:\/\/www.cellmapper.net\/map.  CellMapper. 2017. cellmapper.net. Retrieved from https:\/\/www.cellmapper.net\/map."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"V. Cerf S. Burleigh A. Hooke L. Torgerson R. Durst K. Scott K. Fall and H. Weiss. 2007. Delay-Tolerant Networking Architecture. Network Working Group RFC:4838.  V. Cerf S. Burleigh A. Hooke L. Torgerson R. Durst K. Scott K. Fall and H. Weiss. 2007. Delay-Tolerant Networking Architecture. Network Working Group RFC:4838.","DOI":"10.17487\/rfc4838"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 26th Annual AIAA\/USU Conference on Small Satellites.","author":"Cockrell Jim","year":"2012"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374653"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2623317"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.07.018"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68982-9_14"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.4.518"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287853.1287875"},{"key":"e_1_2_1_15_1","unstructured":"Leonard Kleinrock. 1964. Communication Nets; Stochastic Message Flow and Delay. McGraw--Hill Book Company New York NY.  Leonard Kleinrock. 1964. Communication Nets; Stochastic Message Flow and Delay. McGraw--Hill Book Company New York NY."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061995"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2172984"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530763"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498468"},{"key":"e_1_2_1_20_1","unstructured":"M. Neuts. 1981. Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press Baltimore MD.  M. Neuts. 1981. Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press Baltimore MD."},{"key":"e_1_2_1_21_1","unstructured":"Marcel F. Neuts. 1994. Matrix-geometric Solutions in Stochastic Models\u2014An Algorithmic Approach. Vols. I--XIII. Dover Publications.  Marcel F. Neuts. 1994. Matrix-geometric Solutions in Stochastic Models\u2014An Algorithmic Approach. Vols. I--XIII. Dover Publications."},{"key":"e_1_2_1_22_1","unstructured":"Ramviyas Parasuraman Sergio Caccamo Fredrik Baberg and Petter Ogren. 2016. CRAWDAD dataset kth\/rss (v. 2016-01-05). Retrieved from http:\/\/crawdad.org\/kth\/rss\/20160105\/indoor.  Ramviyas Parasuraman Sergio Caccamo Fredrik Baberg and Petter Ogren. 2016. CRAWDAD dataset kth\/rss (v. 2016-01-05). Retrieved from http:\/\/crawdad.org\/kth\/rss\/20160105\/indoor."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2301376"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM.2012.6263682"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.2379"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2564990"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"K. Scott and S. Burleigh. 2007. Bundle Protocol Specification. Network Working Group RFC:5050.  K. Scott and S. Burleigh. 2007. Bundle Protocol Specification. Network Working Group RFC:5050.","DOI":"10.17487\/rfc5050"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 30th International Conference on Computers and Their Applications (CATA\u201915)","author":"Sehgal Rahul","year":"2015"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-010-0276-9"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Joanne Treurniet. 2014. A taxonomy and survey of microscopic mobility models from the mobile networking domain. ACM Comput. Surv 47 1 (2014) 14:1--14:32.  Joanne Treurniet. 2014. A taxonomy and survey of microscopic mobility models from the mobile networking domain. ACM Comput. Surv 47 1 (2014) 14:1--14:32.","DOI":"10.1145\/2616973"},{"key":"e_1_2_1_32_1","unstructured":"Kishor S. Trivedi. 2002. Probability and Statistics with Reliability Queuing and Computer Science Applications (2nd ed.). John Wiley and Sons Ltd. Chichester UK.  Kishor S. Trivedi. 2002. Probability and Statistics with Reliability Queuing and Computer Science Applications (2nd ed.). John Wiley and Sons Ltd. Chichester UK."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2013.6554862"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133322","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:34Z","timestamp":1750217434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,26]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11,30]]}},"alternative-id":["10.1145\/3133322"],"URL":"https:\/\/doi.org\/10.1145\/3133322","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,26]]},"assertion":[{"value":"2016-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}