{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:22:47Z","timestamp":1740140567145,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T00:00:00Z","timestamp":1498262400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51475343"],"award-info":[{"award-number":["51475343"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Science & Technology Cooperation Program, Hubei Technological Innovation Special Fund","award":["2016AHB005"],"award-info":[{"award-number":["2016AHB005"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2017III5XZ"],"award-info":[{"award-number":["2017III5XZ"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672395"],"award-info":[{"award-number":["61672395"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13638-017-0892-5","type":"journal-article","created":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:38:44Z","timestamp":1498315124000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mirror-image-based disjoint multi-paths routing algorithm for maximizing communication efficiency"],"prefix":"10.1186","volume":"2017","author":[{"given":"Duzhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kehao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"key":"892_CR1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.jnca.2016.04.021","volume":"71","author":"M Noura","year":"2016","unstructured":"M Noura, R Nordin, A survey on interference management for device-to-device (d2d) communication and its challenges in 5g networks. J. Netw. Comput. Appl. 71:, 130\u2013150 (2016). [Online]. Available: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1084804516300753 .","journal-title":"J. Netw. Comput. Appl"},{"key":"892_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.phycom.2015.10.006","volume":"18","author":"N Panwar","year":"2016","unstructured":"N Panwar, S Sharma, AK Singh, A survey on 5g: The next generation of mobile communication. Phys. Commun. Part 2. 18:, 64\u201384 (2016). Special Issue on Radio Access Network Architectures and Resource Management for 5G. [Online]. Available: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1874490715000531 .","journal-title":"Phys. Commun. Part 2"},{"key":"892_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.dsp.2014.12.001","volume":"37","author":"SJ Darak","year":"2015","unstructured":"SJ Darak, S Dhabu, C Moy, H Zhang, J Palicot, A Vinod, Low complexity and efficient dynamic spectrum learning and tunable bandwidth access for heterogeneous decentralized cognitive radio networks. Digital Signal Process. 37:, 13\u201323 (2015). [Online]. Available: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1051200414003431 .","journal-title":"Digital Signal Process"},{"key":"892_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.phycom.2015.10.003","volume":"18","author":"J Riihij\u00e4rvi","year":"2016","unstructured":"J Riihij\u00e4rvi, P M\u00e4h\u00f6nen, M Petrova, What will interference be like in 5g hetnets?Phys. Commun. Part 2. 18:, 85\u201394 (2016). Special Issue on Radio Access Network Architectures and Resource Management for 5G. [Online]. Available: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1874490715000506 .","journal-title":"Phys. Commun. Part 2"},{"issue":"7","key":"892_CR5","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1016\/j.adhoc.2009.01.002","volume":"7","author":"C Cormio","year":"2009","unstructured":"C Cormio, KR Chowdhury, A survey on mac protocols for cognitive radio networks. Ad Hoc Netw. 7(7), 1315\u20131329 (2009).","journal-title":"Ad Hoc Netw"},{"issue":"4","key":"892_CR6","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1109\/SURV.2011.092311.00031","volume":"13","author":"Z Hasan","year":"2011","unstructured":"Z Hasan, H Boostanimehr, V Bhargava, Green cellular networks: A survey, some research issues and challenges. Commun. Surv. Tutorials IEEE. 13(4), 524\u2013540 (2011).","journal-title":"Commun. Surv. Tutorials IEEE"},{"issue":"4","key":"892_CR7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/JPROC.2009.2013012","volume":"97","author":"J Mitola","year":"2009","unstructured":"J Mitola, Cognitive radio architecture evolution. Proc. IEEE. 97(4), 626\u2013641 (2009).","journal-title":"Proc. IEEE"},{"issue":"4","key":"892_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/98.788210","volume":"6","author":"J Mitola","year":"1999","unstructured":"J Mitola, GQ J Maguire, Cognitive radio: making software radios more personal. Pers. Commun. IEEE. 6(4), 13\u201318 (1999).","journal-title":"Pers. Commun. IEEE"},{"key":"892_CR9","doi-asserted-by":"crossref","unstructured":"I Beltagy, M Youssef, M El-Derini, in Wireless Communications and Networking Conference (WCNC). A new routing metric and protocol for multipath routing in cognitive networks (IEEE, 2011), pp. 974\u2013979.","DOI":"10.1109\/WCNC.2011.5779268"},{"issue":"1","key":"892_CR10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"M Youssef, M Ibrahim, M Abdelatif, L Chen, AV Vasilakos, Routing metrics of cognitive radio networks: a survey. IEEE Commun. Surv. Tutorials. 16(1), 92\u2013109 (2014).","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"892_CR11","doi-asserted-by":"crossref","unstructured":"D Zhang, Q Liu, L Chen, W Xu, K Wang, Multi-layer based multi-path routing algorithm for maximizing spectrum availability. Wirel. Netw.1\u201313 (2016). [Online]. Available: http:\/\/dx.doi.org\/10.1007\/s11276-016-1377-x .","DOI":"10.1007\/s11276-016-1377-x"},{"key":"892_CR12","unstructured":"M Karmoose, K Habak, M Elnainay, M Youssef, in International Conference on Wireless and Mobile Computing, Networking and Communications. Dead zone penetration protocol for cognitive radio networks, (2013), pp. 529\u2013536."},{"key":"892_CR13","doi-asserted-by":"crossref","unstructured":"S Ju, JB Evans, in GLOBECOM - IEEE Global Telecommunications Conference. Cognitive multipath multi-channel routing protocol for mobile ad-hoc networks, (2010).","DOI":"10.1109\/GLOCOM.2010.5683663"},{"key":"892_CR14","unstructured":"A Valera, WK Seah, S Rao, in Proceedings - IEEE INFOCOM, vol. 1. Cooperative packet caching and shortest multipath routing in mobile ad hoc networks, (2003), pp. 260\u2013269."},{"key":"892_CR15","unstructured":"K Wu, J Harms, in IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems - Proceedings. Performance study of a multipath routing method for wireless mobile ad hoc networks, (2001), pp. 99\u2013107."},{"issue":"6","key":"892_CR16","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1109\/TDSC.2012.69","volume":"9","author":"H Mustafa","year":"2012","unstructured":"H Mustafa, X Zhang, Z Liu, W Xu, A Perrig, Jamming-resilient multipath routing. Dependable Secure Comput. IEEE Trans. 9(6), 852\u2013864 (2012).","journal-title":"Dependable Secure Comput. IEEE Trans"},{"key":"892_CR17","doi-asserted-by":"crossref","unstructured":"X Zhang, A Perrig, in GLOBECOM - IEEE Global Telecommunications Conference. Correlation-resilient path selection in multi-path routing, (2010).","DOI":"10.1109\/GLOCOM.2010.5683582"},{"issue":"2","key":"892_CR18","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/SURV.2012.042512.00053","volume":"15","author":"Y Cao","year":"2013","unstructured":"Y Cao, Z Sun, Routing in delay\/disruption tolerant networks: a taxonomy, survey and challenges. IEEE Commun. Surv. Tutorials. 15(2), 654\u2013677 (2013).","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"4","key":"892_CR19","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TMC.2015.2439271","volume":"15","author":"J Zhao","year":"2016","unstructured":"J Zhao, X Zhuo, Q Li, W Gao, G Cao, Contact duration aware data replication in DTNs with licensed and unlicensed spectrum. IEEE Trans. Mobile Comput. 15(4), 803\u2013816 (2016).","journal-title":"IEEE Trans. Mobile Comput"},{"key":"892_CR20","unstructured":"Q Yuan, I Cardei, J Chen, J Wu, in 2015 IEEE Global Communications Conference (GLOBECOM). Multi-copy routing with trajectory prediction in social delay-tolerant networks, (2015), pp. 1\u20136."},{"issue":"2","key":"892_CR21","first-page":"121","volume":"1","author":"E Martins","year":"2003","unstructured":"E Martins, M Pascoal, A new implementation of yen\u2019s ranking loopless paths algorithm. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 121\u2013133 (2003). [Online]. Available: http:\/\/dx.doi.org\/10.1007\/s10288-002-0010-2 .","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc"},{"issue":"2","key":"892_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"JW Suurballe, RE Tarjan, A quick method for finding shortest pairs of disjoint paths. Networks. 14(2), 325\u2013336 (1984). [Online]. Available: http:\/\/dx.doi.org\/10.1002\/net.3230140209 .","journal-title":"Networks"},{"key":"892_CR23","volume-title":"Survivables Networks-Algorithms for Diverse Routing","author":"R Bhandari","year":"1999","unstructured":"R Bhandari, Survivables Networks-Algorithms for Diverse Routing (Kluwer Academic Publishers, Boston, 1999)."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-017-0892-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-017-0892-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-017-0892-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T01:04:10Z","timestamp":1589763850000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-017-0892-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,24]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1186\/s13638-017-0892-5","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2017,6,24]]},"article-number":"114"}}