{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:49:18Z","timestamp":1761662958866},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T00:00:00Z","timestamp":1305936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s11276-011-0350-y","type":"journal-article","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T10:38:35Z","timestamp":1305887915000},"page":"1305-1321","source":"Crossref","is-referenced-by-count":9,"title":["DTN routing using explicit and probabilistic routing table states"],"prefix":"10.1007","volume":"17","author":[{"given":"Utku G\u00fcnay","family":"Acer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivkumar","family":"Kalyanaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alhussein A.","family":"Abouzeid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,21]]},"reference":[{"key":"350_CR1","unstructured":"Acer, U. G., Abouzeid A., & Kalyanaraman, S. (2009). An evaluation of weak state mechanism design for indirection in dynamic networks. INFOCOM\u201909: The 28th IEEE international conference on computer communications (pp. 1125\u20131133)."},{"key":"350_CR2","unstructured":"Acer, U. G., Kalyanaraman S., & Abouzeid, A. A. (2007). Weak state routing for large scale dynamic networks. In MobiCom \u201907: Proceedings of the 13th annual ACM international conference on mobile computing and networking (pp. 290\u2013301)."},{"issue":"4","key":"350_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/1282427.1282422","volume":"37","author":"A. Balasubramanian","year":"2007","unstructured":"Balasubramanian, A., Levine, B., & Venkataramani, A. (2007). Dtn routing as a resource allocation problem. SIGCOMM Computer Communication Review, 37(4), 373\u2013384.","journal-title":"SIGCOMM Computer Communication Review"},{"issue":"5","key":"350_CR4","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1023\/B:WINE.0000036458.88990.e5","volume":"10","author":"C. Bettstetter","year":"2004","unstructured":"Bettstetter, C., Hartenstein, H., & Perez-Costa, X. (2004). Stochastic properties of the random waypoint mobility model. Wireless Networks, 10(5), 555\u2013567.","journal-title":"Wireless Networks"},{"issue":"7","key":"350_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B. (1970). Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422\u2013426.","journal-title":"Communications of the ACM"},{"key":"350_CR6","doi-asserted-by":"crossref","unstructured":"Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. INFOCOM 2006 25th IEEE international conference on computer communications proceedings (pp. 1\u201311).","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"350_CR7","unstructured":"Clark, D. D. (1988). The design philosophy of the DARPA internet protocols. SIGCOMM \u201988: Symposium proceedings on communications architectures and protocols (pp. 106\u2013114)."},{"key":"350_CR8","doi-asserted-by":"crossref","unstructured":"Daly, E. M., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets. MobiHoc \u201907, pp. 32\u201340.","DOI":"10.1145\/1288107.1288113"},{"issue":"5","key":"350_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A. Ferreira","year":"2004","unstructured":"Ferreira, A. (2004). Building a reference combinatorial model for manets. IEEE Network, 18(5), 24\u201329.","journal-title":"IEEE Network"},{"issue":"4","key":"350_CR10","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TNET.2002.801403","volume":"10","author":"M. Grossglauser","year":"2002","unstructured":"Grossglauser, M., & Tse, D. N. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE\/ACM Transactions on Networking, 10(4), 477\u2013486.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"350_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1109\/TNET.2006.876186","volume":"14","author":"Z. J. Haas","year":"2006","unstructured":"Haas, Z. J., Halpern, J. Y., & Li, L. (2006). Gossip-based ad hoc routing. IEEE\/ACM Transactions on Networking, 14(3), 479\u2013491.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"350_CR12","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TMC.2006.86","volume":"5","author":"E. Hyytia","year":"2006","unstructured":"Hyytia, E., Lassila, P., & Virtamo, J. (2006). Spatial node distribution of the random waypoint mobility model with applications. IEEE Transactions on Mobile Computing, 5(6), 680\u2013693.","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"4","key":"350_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/1030194.1015484","volume":"34","author":"S. Jain","year":"2004","unstructured":"Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. Computer Communication Review, 34(4), 145\u2013157.","journal-title":"Computer Communication Review"},{"issue":"2","key":"350_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TNET.2007.892849","volume":"15","author":"P. Ji","year":"2007","unstructured":"Ji, P., Ge, Z., Kurose, J., & Towsley, D. (2007). A comparison of hard-state and soft-state signaling protocols. IEEE\/ACM Transactions on Networking, 15(2), 281\u2013294.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"350_CR15","doi-asserted-by":"crossref","unstructured":"Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in Ad Hoc wireless networks. Mobile Computing, Vol. 353. Kluwer Academic Publishers.","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"350_CR16","unstructured":"Jones, E. P. C., Li, L., & Ward, P. A. S. (2005). Practical routing in delay-tolerant networks. In WDTN \u201905: Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking (pp. 237\u2013243)."},{"key":"350_CR17","doi-asserted-by":"crossref","unstructured":"Karp, B., & Kung, H. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the annual international conference on mobile computing and networking, MOBICOM (pp. 243\u2013254).","DOI":"10.1145\/345910.345953"},{"key":"350_CR18","unstructured":"Ker\u00e4nen, A., Ott, J., & K\u00e4rkk\u00e4inen, T. (2009). The ONE simulator for DTN protocol evaluation. In SIMUTools\u201909: Proceedings of the 2nd international conference on simulation tools and techniques, ICST."},{"key":"350_CR19","first-page":"1162","volume":"2","author":"A. Kumar","year":"2005","unstructured":"Kumar, A., Xu, J., & Zegura, E. . (2005). Efficient and scalable query routing for unstructured peer-to-peer networks. Proceedings of IEEE INFOCOM, 2, 1162\u20131173.","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"350_CR20","first-page":"2289","volume":"61","author":"J. LeBrun","year":"2005","unstructured":"LeBrun, J., Chuah, C. N., Ghosal, D., & Zhang, M. (2005). Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks. IEEE Vehicular Technology Conference, 61, 2289\u20132293.","journal-title":"IEEE Vehicular Technology Conference"},{"key":"350_CR21","doi-asserted-by":"crossref","unstructured":"Leontiadis, I., & Mascolo, C. (2007). Geopps: Geographical opportunistic routing for vehicular networks. World of Wireless, Mobile and Multimedia Networks, WoWMoM, pp. 1\u20136.","DOI":"10.1109\/WOWMOM.2007.4351688"},{"key":"350_CR22","doi-asserted-by":"crossref","unstructured":"Lindgren, A., Doria, A., & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. Workshop on Service Assurance with Partial and Intermittent Resources, SAPIR 2004, pp 239\u201354.","DOI":"10.1007\/978-3-540-27767-5_24"},{"key":"350_CR23","doi-asserted-by":"crossref","unstructured":"Liu, C., & Wu, J. (2008). Routing in a cyclic mobispace. MobiHoc \u201908, pp. 351\u2013360.","DOI":"10.1145\/1374618.1374665"},{"key":"350_CR24","doi-asserted-by":"crossref","unstructured":"Perkins, C. E., & Royer, E. (1999). Ad-hoc on-demand distance vector routing. Second IEEE workshop on mobile computing systems and applications. WMCSA\u201999. (pp. 90\u2013100).","DOI":"10.1109\/MCSA.1999.749281"},{"key":"350_CR25","unstructured":"Piorkowski, M., Sarafijanovic-Djukic, N., & Grossglauser, M. (2009). CRAWDAD data set epfl\/mobility (v. 2009-02-24). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/epfl\/mobility ."},{"key":"350_CR26","doi-asserted-by":"crossref","unstructured":"Piorkowski, M., Sarafijanovic-Djukic, N., & Grossglauser, M. (2009). A parsimonious model of mobile partitioned networks with clustering. 1st international conference on communication systems and networks and workshops, COMSNETS 2009.","DOI":"10.1109\/COMSNETS.2009.4808865"},{"issue":"4","key":"350_CR27","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/316194.316202","volume":"29","author":"S. Raman","year":"1999","unstructured":"Raman, S., & McCanne, S. (1999). Model, analysis, and protocol framework for soft state-based communication. Computer Communication Review, 29(4), 15\u201325.","journal-title":"Computer Communication Review"},{"key":"350_CR28","doi-asserted-by":"crossref","unstructured":"Seth, A., Kroeker, D., Zaharia, M., Guo, S., & Keshav, S. (2006). Low-cost communication for rural internet kiosks using mechanical backhaul. Proceedings of the annual international conference on mobile computing and networking, MOBICOM (pp. 334\u2013345).","DOI":"10.1145\/1161089.1161127"},{"issue":"2-3","key":"350_CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S1570-8705(03)00003-9","volume":"1","author":"R.C. Shah","year":"2003","unstructured":"Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003). Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2\u20133), 215\u2013233.","journal-title":"Ad Hoc Networks"},{"key":"350_CR30","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM SIGCOMM 2005 workshops: Conference on computer communications (pp. 252\u2013259)."},{"issue":"1","key":"350_CR31","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TNET.2007.897964","volume":"16","author":"T. Spyropoulos","year":"2008","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE\/ACM Transactions on Networking, 16(1), 77\u201390.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"350_CR32","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected Ad Hoc networks. Tech. rep., Department of Computer Science, Duke University, Durham, NC, http:\/\/citeseer.ist.psu.edu\/vahdat00epidemic.htm ."},{"key":"350_CR33","doi-asserted-by":"crossref","unstructured":"Zhao, W., Ammar, M., & Zegura, E. (2004). A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the international symposium on mobile Ad Hoc networking and computing (MobiHoc) (pp. 187\u2013198).","DOI":"10.1145\/989459.989483"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-011-0350-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-011-0350-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-011-0350-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T20:53:08Z","timestamp":1560199988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-011-0350-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,21]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s11276-011-0350-y","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,21]]}}}