{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:21:12Z","timestamp":1648758072956},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,7]],"date-time":"2015-02-07T00:00:00Z","timestamp":1423267200000},"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,6]]},"DOI":"10.1007\/s11277-015-2370-x","type":"journal-article","created":{"date-parts":[[2015,2,6]],"date-time":"2015-02-06T07:36:11Z","timestamp":1423208171000},"page":"2637-2654","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Delay Optimization Via Packet Scheduling for Multi-Path Routing in Wireless Networks"],"prefix":"10.1007","volume":"82","author":[{"given":"Jian","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guyu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinlin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,7]]},"reference":[{"key":"2370_CR1","doi-asserted-by":"crossref","unstructured":"Sharma, G., Mazumdar, R., & Shroff, N. B. D. (2007). Delay and capacity trade-offs in mobile ad hoc networks: A global perspective. IEEE\/ACM Transactions on Networking, 15(5), 981\u2013992.","DOI":"10.1109\/TNET.2007.905154"},{"issue":"6","key":"2370_CR2","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1109\/TIT.2005.847717","volume":"51","author":"MJ Neely","year":"2005","unstructured":"Neely, M. J., & Modiano, E. (2005). Capacity and delay tradeoffs for ad-hoc mobile networks. IEEE Transaction on Information Theory, 51(6), 1917\u20131937.","journal-title":"IEEE Transaction on Information Theory"},{"key":"2370_CR3","doi-asserted-by":"crossref","unstructured":"Belding-Royer, E.M. (2004). Routing approaches in mobile ad hoc networks. In Mobile Ad Hoc Networking, 1(1).","DOI":"10.1002\/0471656895.ch10"},{"key":"2370_CR4","doi-asserted-by":"crossref","unstructured":"Mueller, S., & Ghosal, D. Multipath routing in mobile ad hoc networks: Issues and challenges, in LNCS Volume 2965\/2004.","DOI":"10.1007\/978-3-540-24663-3_10"},{"key":"2370_CR5","doi-asserted-by":"crossref","unstructured":"Marina, M. K., & Das, S. R. (2001). On-demand multipath distance vector routing in ad hoc networks. In Proceedings of the International Conference for Network Procotols.","DOI":"10.1109\/ICNP.2001.992756"},{"key":"2370_CR6","unstructured":"Gerla, M., & Lee, S. J. (2001). Split multipath routing with maximally disjoint paths in ad hoc networks. IEEE International Conference on Communications, 10."},{"key":"2370_CR7","unstructured":"Wang, L., Shu, Y., & Dong, M., et al. (2001). Adaptive multipath source routing in ad hoc networks. In Proc. IEEE Conference on Communication, Helsinki, Finland."},{"key":"2370_CR8","doi-asserted-by":"crossref","unstructured":"Perkins, C. E., & Royer, E. M. (1999). Ad hoc on demand distance vector (AODV) routing. In Proc. of the IEEE Workshop on Mobile Computing Systems and Applications.","DOI":"10.1109\/MCSA.1999.749281"},{"key":"2370_CR9","doi-asserted-by":"crossref","unstructured":"Ye, Z., Krishnamurthy, S.V., & Tripathi, S.K. (2003). A framework for reliable routing in mobile ad hoc networks, In Proc. of IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2003.1208679"},{"key":"2370_CR10","doi-asserted-by":"crossref","unstructured":"Li, X., & Cuthbert, L. (2004). A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks, In Proceeding of MSWIM (pp. 4\u20136), Venezia .","DOI":"10.1145\/1023663.1023704"},{"key":"2370_CR11","doi-asserted-by":"crossref","unstructured":"Hou, I.H., Borkar, V., & Kumar, P.R. (2009). A theory of QoS for wireless. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM2009). IEEE Communication Society, 486\u2013694.","DOI":"10.1109\/INFCOM.2009.5061954"},{"key":"2370_CR12","doi-asserted-by":"crossref","unstructured":"Hou, I.H., & Kumar, P.R. (2010). Utility maximization for delay constrained QoS in wireless. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM2010). IEEE Communication Society, 1\u20139.","DOI":"10.1109\/INFCOM.2010.5462070"},{"key":"2370_CR13","unstructured":"Neely, M.J. (2010) Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM2010). IEEE Communication Society, 1728\u20131736."},{"key":"2370_CR14","doi-asserted-by":"crossref","unstructured":"Bui, L., Srikant, R., & Stolyar, A. (2009). Novel Architectures and Algorithms for Delay Reduction in Back-pressure Scheduling and Routing. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM2009). IEEE Communication Society, 2936\u20132940.","DOI":"10.1109\/INFCOM.2009.5062262"},{"key":"2370_CR15","doi-asserted-by":"crossref","unstructured":"Ji, B., Joo, C., & Shroff, N. (2011) Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM2011). IEEE Communication Society, 2579\u20132587.","DOI":"10.1109\/INFCOM.2011.5935084"},{"issue":"2","key":"2370_CR16","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1109\/TVT.2008.925308","volume":"58","author":"HP Shiang","year":"2009","unstructured":"Shiang, H. P., & Schaar, M. (2009). Distributed resource management in multihop cognitive radio networks for delay-sensitive transmission. IEEE Transactions On Vehicular Technology, 58(2), 941\u2013953.","journal-title":"IEEE Transactions On Vehicular Technology"},{"issue":"6","key":"2370_CR17","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1109\/TMM.2007.902845","volume":"9","author":"HP Shiang","year":"2007","unstructured":"Shiang, H. P., & Schaar, M. (2007). Informationally decentralized video streaming over multi-hop wireless networks. IEEE Transactions On Multimedia, 9(6), 1299\u20131313.","journal-title":"IEEE Transactions On Multimedia"},{"key":"2370_CR18","doi-asserted-by":"crossref","unstructured":"Shiang, H.P., & Schaar, M. (2008) Delay-Sensitive Resource Management in Multi-hop Cognitive Radio Networks. In Proceedings of the IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN2008). IEEE Communication Society, 1\u201312.","DOI":"10.1109\/DYSPAN.2008.21"},{"key":"2370_CR19","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"EJ Anderson","year":"2004","unstructured":"Anderson, E. J., & Potts, C. (2004). Online scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research, 29, 686\u2013697.","journal-title":"Mathematics of Operations Research"},{"key":"2370_CR20","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Leonardi, S., & Regev, O. (1999). Minimizing the flow time without migration. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), 198\u2013205.","DOI":"10.1145\/301250.301304"},{"key":"2370_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/nav.3800290114","volume":"29","author":"L Bianco","year":"1982","unstructured":"Bianco, L., & Ricciarddli, S. (1982). Scheduling of a single machine to minimize total weighted completion time subject to release dates. Naval Research Logistics Quarterly, 29, 151\u2013167.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2370_CR22","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/nav.3800260315","volume":"26","author":"R Chandra","year":"1979","unstructured":"Chandra, R. (1979). On $$n$$ n dynamic deterministic problems. Naval Research Logistics Quarterly, 26, 537\u2013544.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2370_CR23","unstructured":"Chandra, C., Sanjeev, K., & Zhu, A. (2001). Algorithms for minimizing weighted flow time. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), 84\u201393."},{"key":"2370_CR24","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.1060.0270","volume":"54","author":"C Chou","year":"2006","unstructured":"Chou, C., Liu, H., Queyranne, M., & Simchi-levi, D. (2006). On the asymptotic optimality of a simple online algotithm for the stochastic single mchine weighted completion time problem and its extensions. Operations Research, 54, 464\u2013474.","journal-title":"Operations Research"},{"key":"2370_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-005-0588-1","volume":"106","author":"C Chou","year":"2006","unstructured":"Chou, C., Queyranne, M., & Simchi-levi, D. (2006). The asymptotic pergormance ratio of an online algorithm for uniform prarllel machine scheduling with release dates. Mathematical Programming, 106, 137\u2013157.","journal-title":"Mathematical Programming"},{"key":"2370_CR26","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1002\/1520-6750(199210)39:6<859::AID-NAV3220390610>3.0.CO;2-W","volume":"39","author":"C Chu","year":"1992","unstructured":"Chu, C. (1992). A branch and bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics, 39, 859\u2013875.","journal-title":"Naval Research Logistics"},{"key":"2370_CR27","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1093\/comjnl\/26.4.320","volume":"26","author":"JS Deogun","year":"1983","unstructured":"Deogun, J. S. (1983). On scheduling with ready times to minimize mean flow time. Computer Journal, 26, 320\u2013328.","journal-title":"Computer Journal"},{"key":"2370_CR28","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0210014","volume":"10","author":"MI Dessouky","year":"1981","unstructured":"Dessouky, M. I., & Deogun, J. S. (1981). Sequencing jobs with unequal ready times to minimize mean flow time. SIAM Journal on Computing, 10, 192\u2013202.","journal-title":"SIAM Journal on Computing"},{"key":"2370_CR29","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"ME Dyer","year":"1990","unstructured":"Dyer, M. E., & Waksey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26, 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"2370_CR30","unstructured":"Edmonds, J. (1970). Submodular functions, matroids and certain polyhedra. In Proceedings of the International Conferenceon Cumbinatorics (Calgary Canada),69\u201387."},{"key":"2370_CR31","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/moor.10.2.328","volume":"10","author":"G Gazmuri","year":"1985","unstructured":"Gazmuri, G. (1985). Probabilistic analysis of a machine scheduling problem. Mathematics of Operations Research, 10, 328\u2013339.","journal-title":"Mathematics of Operations Research"},{"key":"2370_CR32","unstructured":"Goemans, M. X. (1996). A supermodular relaxation for scheduling with release dates, In lecture notes in computer science. Vot 1084. Iroc 5th integer programming and combinatortal optimization conference. 288\u2013300. Berlin: Springer."},{"key":"2370_CR33","unstructured":"Goemans, M. X. (1997). Improved approximation algorithms for scheduling with release dates, In Proceedings of the 8th anmual ACM-SIAM symposium on discrete algorithms. 591\u2013598. Philadelphia: SZAM."},{"key":"2370_CR34","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/S089548019936223X","volume":"15","author":"MX Goemans","year":"2002","unstructured":"Goemans, M. X., Queyranne, M., & Schulz, A. S. (2002). Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics, 15, 165\u2013192.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2370_CR35","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","volume":"5","author":"AMA Hariri","year":"1983","unstructured":"Hariri, A. M. A., & Potts, C. N. (1983). An algorithm for single machine sequencing with release times to minimize total weighted completion time. Discrete Applied Mathematics, 5, 99\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"2370_CR36","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Tautenhahn, T., & Woeginger, G.J. (1996) Approximability and nonapproximability results for minimizing total flow time on a single machine. In ACM Symposium on Theory of Computing (STOC), 418\u2013426.","DOI":"10.1145\/237814.237989"},{"key":"2370_CR37","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"2370_CR38","doi-asserted-by":"crossref","unstructured":"Leonardi, S., & Raz, D. (1997) Approximating total flow time on parallel machines. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 110\u2013119.","DOI":"10.1145\/258533.258562"},{"key":"2370_CR39","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"RH Mohring","year":"1999","unstructured":"Mohring, R. H., Schulz, A. S., & Uetz, M. (1999). Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the Association for Computing Machinery (ACM), 46, 924\u2013942.","journal-title":"Journal of the Association for Computing Machinery (ACM)"},{"key":"2370_CR40","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/opre.33.3.562","volume":"33","author":"ME Posner","year":"1985","unstructured":"Posner, M. E. (1985). Minimizing weighted completion times with deadlines. Operations Research, 33, 562\u2013574.","journal-title":"Operations Research"},{"key":"2370_CR41","unstructured":"Schulz, A.S. (1966) Scheduling to minimize total. In Proceedings of the 5th international IPCO conferernce on interger programming and conbinatorial optimization, 301\u2013315."},{"key":"2370_CR42","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W Smith","year":"1956","unstructured":"Smith, W. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2370_CR43","unstructured":"Iperf. http:\/\/dast.nlanr.net\/projects\/Iperf ."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2370-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-015-2370-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2370-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T13:58:09Z","timestamp":1566309489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-015-2370-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,7]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["2370"],"URL":"https:\/\/doi.org\/10.1007\/s11277-015-2370-x","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,7]]}}}