{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T01:49:07Z","timestamp":1696643347261},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T00:00:00Z","timestamp":1417478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s11277-014-2214-0","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:57:02Z","timestamp":1417543022000},"page":"401-422","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["L2OR: Low-Cost Low-Complexity Opportunistic Routing for Wireless Sensor Networks"],"prefix":"10.1007","volume":"82","author":[{"given":"Hang","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangwei","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinfeng","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenmin","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,2]]},"reference":[{"issue":"8","key":"2214_CR1","doi-asserted-by":"crossref","first-page":"3424","DOI":"10.1109\/TCOMM.2013.070213.120570","volume":"61","author":"J Habibi","year":"2013","unstructured":"Habibi, J., Ghrayeb, A., & Aghdam, A. G. (2013). Energy-efficient cooperative routing in wireless sensor networks: A mixed-integer optimization framework and explicit solution. IEEE Transactions on Communications, 61(8), 3424\u20133437.","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"2214_CR2","doi-asserted-by":"crossref","first-page":"34:1","DOI":"10.1145\/1921621.1921628","volume":"7","author":"HP Keeler","year":"2011","unstructured":"Keeler, H. P., & Taylor, P. G. (2011). A model framework for greedy routing in a sensor network with a stochastic power scheme. ACM Transactions on Sensor Networks, 7(4), 34:1\u201334:28.","journal-title":"ACM Transactions on Sensor Networks"},{"key":"2214_CR3","doi-asserted-by":"crossref","unstructured":"Lai, W., & Paschalidis, I. Ch. (2007). Sensor network minimal energy routing with latency guarantees. In Proceedings of the 8th ACM international symposium on mobile ad hoc networking and computing (MobiHoc) (pp. 199\u2013208).","DOI":"10.1145\/1288107.1288135"},{"issue":"6","key":"2214_CR4","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.adhoc.2011.12.009","volume":"10","author":"E Zeydan","year":"2012","unstructured":"Zeydan, E., Kivanc, D., Comaniciu, C., & Tureli, U. (2012). Energy-efficient routing for correlated data in wireless sensor networks. Ad Hoc Networks, 10(6), 962\u2013975.","journal-title":"Ad Hoc Networks"},{"issue":"6","key":"2214_CR5","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPDS.2009.98","volume":"21","author":"H Zhang","year":"2010","unstructured":"Zhang, H., & Shen, H. (2010). Energy-efficient beaconless geographic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 21(6), 881\u2013896.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2214_CR6","doi-asserted-by":"crossref","unstructured":"Coutinho, R. W. L., Boukerche, A., Vieira, L. F. M., & Loureiro, A. A. F. (2014). Transmission power control-based opportunistic routing for wireless sensor networks. In Proceedings of the 17th ACM international conference on modeling, analysis and simulation of wireless and mobile systems (MSWiM) (pp. 219\u2013226).","DOI":"10.1145\/2641798.2641813"},{"issue":"11","key":"2214_CR7","doi-asserted-by":"crossref","first-page":"1934","DOI":"10.1109\/TPDS.2011.70","volume":"22","author":"X Mao","year":"2011","unstructured":"Mao, X., Tang, S., Xiahua, X., Li, X.-Y., & Ma, H. (2011). Energy-efficient opportunistic routing in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(11), 1934\u20131942.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2214_CR8","doi-asserted-by":"crossref","unstructured":"Duquennoy, S., Landsiedel, O., & Voigt, T. (2013). Let the tree bloom: Scalable opportunistic routing with orpl. In Proceedings of the 11th ACM conference on embedded networked sensor systems (SenSys) (pp. 2:1\u20132:14).","DOI":"10.1145\/2517351.2517369"},{"key":"2214_CR9","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Landsiedel, O., Soldati, P., & Johansson, M. (2012). A metric for opportunistic routing in duty cycled wireless sensor networks. In Proceedings of the 9th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (SECON) (pp. 335\u2013343).","DOI":"10.1109\/SECON.2012.6275795"},{"issue":"2","key":"2214_CR10","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/1498915.1498920","volume":"5","author":"P Huang","year":"2009","unstructured":"Huang, P., Chen, H., Xing, G., & Tan, Y. (2009). Sgf: A state-free gradient-based forwarding protocol for wireless sensor networks. ACM Transactions on Sensor Networks, 5(2), 14:1\u201314:25.","journal-title":"ACM Transactions on Sensor Networks"},{"key":"2214_CR11","doi-asserted-by":"crossref","unstructured":"Pavkovi\u0107, B., Theoleyre, F., & Duda, A. (2011). Multipath opportunistic rpl routing over ieee 802.15.4. In Proceedings of the 14th ACM international conference on modeling, analysis and simulation of wireless and mobile systems (MSWiM) (pp. 179\u2013186).","DOI":"10.1145\/2068897.2068929"},{"key":"2214_CR12","doi-asserted-by":"crossref","unstructured":"Kim, J., & Ravindran, B. (2009). Opportunistic real-time routing in multi-hop wireless sensor networks. In Proceedings of the 2009 ACM symposium on applied computing (SAC) (pp. 2197\u20132201).","DOI":"10.1145\/1529282.1529766"},{"issue":"15","key":"2214_CR13","doi-asserted-by":"crossref","first-page":"3592","DOI":"10.1016\/j.comnet.2011.06.021","volume":"55","author":"C-J Hsu","year":"2011","unstructured":"Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing-a review and the challenges ahead. Computer Networks, 55(15), 3592\u20133603.","journal-title":"Computer Networks"},{"key":"2214_CR14","doi-asserted-by":"crossref","unstructured":"Darehshoorzadeh, A, & Cerd\u00e0-Alabern, L. (2010). Candidate selection algorithms in opportunistic routing. In Proceedings of the 5th ACM workshop on performance monitoring and measurement of heterogeneous wireless and wired networks (PM2HW2N) (pp. 48\u201354).","DOI":"10.1145\/1868612.1868621"},{"issue":"8","key":"2214_CR15","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1007\/s11276-012-0445-0","volume":"18","author":"K Zeng","year":"2012","unstructured":"Zeng, K., Yang, J., & Lou, W. (2012). On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks. Wireless Networks, 18(8), 967\u2013983.","journal-title":"Wireless Networks"},{"key":"2214_CR16","unstructured":"Zhao, P., Yang, X., Wang, J., Liu, B., & Wang, J. (2012). Bor\/ac: Bandwidth-aware opportunistic routing with admission control in wireless mesh networks. In Proceedings of the 31st annual IEEE international conference on computer communications (INFOCOM) (pp. 2701\u20132705)."},{"issue":"2","key":"2214_CR17","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1007\/s11277-013-1425-0","volume":"75","author":"H Shen","year":"2014","unstructured":"Shen, H., Bai, G., Tang, Z., & Zhao, L. (2014). Qmor: Qos-aware multi-sink opportunistic routing for wireless multimedia sensor networks. Wireless Personal Communications, 75(2), 1307\u20131330.","journal-title":"Wireless Personal Communications"},{"key":"2214_CR18","doi-asserted-by":"crossref","unstructured":"Biswas, S., & Morris, R. (2005). Exor: Opportunistic multi-hop routing for wireless networks. In Proceedings of the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM) (pp. 133\u2013144).","DOI":"10.1145\/1080091.1080108"},{"issue":"2","key":"2214_CR19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TNET.2010.2070844","volume":"19","author":"H Dubois-Ferri\u00e8re","year":"2011","unstructured":"Dubois-Ferri\u00e8re, H., Grossglauser, M., & Vetterli, M. (2011). Valuable detours: Least-cost anypath routing. IEEE\/ACM Transactions on Networking, 19(2), 333\u2013346.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2214_CR20","doi-asserted-by":"crossref","unstructured":"Zhong, Z., & Nelakuditi, S. (2007). On the efficacy of opportunistic routing. In Proceedings of the 4th annual IEEE communications society conference on sensor, mesh and ad hoccommunications and networks (SECON) (pp. 441\u2013450).","DOI":"10.1109\/SAHCN.2007.4292856"},{"issue":"12","key":"2214_CR21","doi-asserted-by":"crossref","first-page":"1622","DOI":"10.1109\/TMC.2009.82","volume":"8","author":"E Rozner","year":"2009","unstructured":"Rozner, E., Seshadri, J., Mehta, Y., & Qiu, L. (2009). Soar: Simple opportunistic adaptive routing protocol for wireless mesh networks. IEEE Transactions on Mobile Computing, 8(12), 1622\u20131635.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"2214_CR22","doi-asserted-by":"crossref","unstructured":"De Couto, D. S.J., Aguayo, D., Bicket, J., & Morris, R. (2003). A high-throughput path metric for multi-hop wireless routing. In Proceedings of the 9th annual international conference on mobile computing and networking (MobiCom) (pp. 134\u2013146).","DOI":"10.1145\/938998.939000"},{"issue":"3","key":"2214_CR23","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/JPROC.2010.2093851","volume":"99","author":"S-YR Li","year":"2011","unstructured":"Li, S.-Y. R., Sun, Q. T., & Shao, Z. (2011). Linear network coding: Theory and algorithms. Proceedings of the IEEE, 99(3), 372\u2013387.","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"2214_CR24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S-YR Li","year":"2003","unstructured":"Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE Transactions Information Theory, 49(2), 371\u2013381.","journal-title":"IEEE Transactions Information Theory"},{"key":"2214_CR25","doi-asserted-by":"crossref","unstructured":"Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing. In Proceedings of the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM) (pp. 169\u2013180).","DOI":"10.1145\/1282380.1282400"},{"issue":"5","key":"2214_CR26","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1109\/TNET.2011.2111382","volume":"19","author":"D Koutsonikolas","year":"2011","unstructured":"Koutsonikolas, D., & Wang, C.-C. (2011). Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments. IEEE\/ACM Transactions on Networking, 19(5), 1368\u20131381.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2214_CR27","unstructured":"Hsu, C.-J., Liu, H-I., & Seah, W. (2009). Economy: A duplicate free opportunistic routing. In Proceedings of the 6th ACM international conference on mobile technology, application & systems (mobility) (pp. 17:1\u201317:6)."},{"issue":"4","key":"2214_CR28","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/LCOMM.2012.022112.120203","volume":"16","author":"J Myung","year":"2012","unstructured":"Myung, J., & Lee, W. (2012). Eliminating duplicate forwarding in wireless opportunistic routing. IEEE Communications Letters, 16(4), 510\u2013513.","journal-title":"IEEE Communications Letters"},{"issue":"4","key":"2214_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1215976.1215978","volume":"10","author":"Z Zhong","year":"2006","unstructured":"Zhong, Z., Wang, J., Nelakuditi, S., & Guor-Huar, L. (2006). On selection of candidates for opportunistic anypath forwarding. ACM SIGMOBILE Mobile Computing and Communications Review, 10(4), 1\u20132.","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"3","key":"2214_CR30","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TNET.2011.2165852","volume":"20","author":"R Laufer","year":"2012","unstructured":"Laufer, R., Dubois-Ferri\u00e8re, H., & Kleinrock, L. (2012). Polynomial-time algorithms for multirate anypath routing in wireless multihop networks. IEEE\/ACM Transactions on Networking, 20(3), 742\u2013755.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"10","key":"2214_CR31","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1109\/LCOMM.2012.081612.121601","volume":"16","author":"SP Mazumdar","year":"2012","unstructured":"Mazumdar, S. P., Bose, S. K., & Zhong, W.-D. (2012). Multicast least cost anypath routing: Route cost calculations and forwarding. IEEE Communications Letters, 16(10), 1652\u20131655.","journal-title":"IEEE Communications Letters"},{"key":"2214_CR32","doi-asserted-by":"crossref","unstructured":"Darehshoorzadeh, A., Almulla, M., Boukerche, A., & Chaiwala, S. (2013). On the number of candidates in opportunistic routing for multi-hop wirelessnetworks. In Proceedings of the 11th ACM international symposium on mobility management and wireless access (MobiWac) (pp. 9\u201316).","DOI":"10.1145\/2508222.2508224"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-014-2214-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-014-2214-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-014-2214-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:16:19Z","timestamp":1559394979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-014-2214-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["2214"],"URL":"https:\/\/doi.org\/10.1007\/s11277-014-2214-0","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,2]]}}}