乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T04:23:14Z","timestamp":1742703794071,"version":"3.40.2"},"reference-count":28,"publisher":"Institution of Engineering and Technology (IET)","issue":"6","license":[{"start":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T00:00:00Z","timestamp":1604361600000},"content-version":"vor","delay-in-days":2,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802257","61602305","U1936120","U1636216"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["18ZR1426000","19ZR1477600"],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Networks"],"published-print":{"date-parts":[[2020,11]]},"abstract":"The opportunistic network has become an appealing paradigm since it can reduce the energy consumption and cost on cellular network connections and relieve the communication burden of cellular networks. The probabilistic transmission scheme has been proposed as one of the typical opportunistic transmission schemes. However, most existing probabilistic transmission schemes neglect that, opportunistic transmission tasks in some applications have transmission time and cost budgets, and to set proper delay and hop count thresholds on encountering probabilities between relay nodes and their destination nodes can help to filter redundant long\u2010delay and high\u2010cost opportunistic paths for packets. In this study, the authors proposed a delay\u2010aware and cost\u2010efficient probabilistic transmission method for opportunistic networks. In this method, direct and indirect encountering probabilities related to delay and hop count are defined, and accordingly, a relay node selection algorithm is provided with preset encountering delay and hop count thresholds to compare probabilities of nodes to encounter the destination node within the preset thresholds as their transmission quality metrics. The simulation results verify that the proposed method can reduce transmission delay and cost efficiently.<\/jats:p>","DOI":"10.1049\/iet-net.2020.0082","type":"journal-article","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T02:17:06Z","timestamp":1604456226000},"page":"372-377","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Delay\u2010aware and cost\u2010efficient probabilistic transmission for opportunistic networks"],"prefix":"10.1049","volume":"9","author":[{"given":"Jun","family":"Li","sequence":"first","affiliation":[{"name":"China Industrial Control Systems Cyber Emergency Response Team Beijing 100040 People's Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1125-0411","authenticated-orcid":false,"given":"Xing\u2010Yu","family":"He","sequence":"additional","affiliation":[{"name":"College of Communication and Art Design University of Shanghai for Science and Technology Shanghai 200093 People's Republic of China"}]},{"given":"Dan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Optic\u2010Electrical and Computer Engineering Shanghai Key Lab of Modern Optical System University of Shanghai for Science and Technology Shanghai 200093 People's Republic of China"}]},{"given":"Gui\u2010Song","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Optic\u2010Electrical and Computer Engineering Shanghai Key Lab of Modern Optical System University of Shanghai for Science and Technology Shanghai 200093 People's Republic of China"}]},{"given":"Dao\u2010Jing","family":"He","sequence":"additional","affiliation":[{"name":"School of Software Engineering East China Normal University Shanghai 200062 People's Republic of China"}]},{"given":"Sammy","family":"Chan","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering City University of Hong Kong Hong Kong SAR People's Republic of China"}]}],"member":"265","published-online":{"date-parts":[[2020,11,3]]},"reference":[{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2357791"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2418283"},{"key":"e_1_2_8_4_2","doi-asserted-by":"crossref","unstructured":"SuiZ.: \u2018The research of the route protocols in opportunistic network\u2019.Proc. Int. Conf. Computational Intelligence and Communication Networks (CICN) Jabalpur India 2015 pp.192\u2013196","DOI":"10.1109\/CICN.2015.45"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-net.2015.0086"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-net.2017.0079"},{"key":"e_1_2_8_7_2","doi-asserted-by":"crossref","unstructured":"VangY.SaavedraA.YangS.: \u2018Ferry enhanced improved prophet routing protocol\u2019.Proc. IEEE Int. Conf. Mobile Ad Hoc and Sensor Systems Dallas TX USA 2016 pp.567\u2013572","DOI":"10.1109\/MASS.2015.60"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_2_8_9_2","doi-asserted-by":"crossref","unstructured":"XueJ.LiJ.CaoY.et al.: \u2018Advanced prophet routing in delay tolerant network\u2019.Proc. Int. Conf. Communication Software and Networks Macau China 2009 pp.411\u2013413","DOI":"10.1109\/ICCSN.2009.44"},{"key":"e_1_2_8_10_2","doi-asserted-by":"crossref","unstructured":"PathakS.GondaliyaN.RajaN.: \u2018A survey on PROPHET based routing protocol in delay tolerant network\u2019.Proc. Int. Conf. on Emerging Trends and Innovation in ICT (ICEI) Pune India February 2017 pp.110\u2013115","DOI":"10.1109\/ETIICT.2017.7977020"},{"key":"e_1_2_8_11_2","doi-asserted-by":"crossref","unstructured":"LiuQ.LiuJ.WangY.: \u2018Delivery probability aware data forwarding mechanism in opportunistic networks\u2019.Proc. 2014 Fourth Int. Conf. Communication Systems and Network Technologies Bhopal India 2014 pp.151\u2013155","DOI":"10.1109\/CSNT.2014.39"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","unstructured":"DuongD. V. A.YoonS.: \u2018An efficient probabilistic routing algorithm based on limiting the number of replications\u2019.Proc. 2019 Int. Conf. Information and Communication Technology Convergence Jeju Island Korea (South) 2019 pp.562\u2013564","DOI":"10.1109\/ICTC46691.2019.8939947"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2329001"},{"key":"e_1_2_8_14_2","doi-asserted-by":"crossref","unstructured":"YangB.WuZ.ShenY.et al.: \u2018Multicast delivery delay in general two\u2010hop relay MANETs\u2019.Proc. Int. Conf. Networking and Network Applications (NaNA) Kathmandu Nepal 2017 pp.100\u2013103","DOI":"10.1109\/NaNA.2017.44"},{"key":"e_1_2_8_15_2","doi-asserted-by":"crossref","unstructured":"MirM.HuC.HuangS.: \u2018Data forwarding with finite buffer capacity in opportunistic networks\u2019.2018 27th Wireless and Optical Communication Conf. (WOCC) Hualien Taiwan 2018 pp.1\u20135","DOI":"10.1109\/WOCC.2018.8372708"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2852220"},{"key":"e_1_2_8_17_2","doi-asserted-by":"crossref","unstructured":"TaoJ.WuH.ShiS.et al.: \u2018Contacts\u2010aware opportunistic forwarding in mobile social networks: a community perspective\u2019.Proc. 2018 IEEE Wireless Communications and Networking Conf. (WCNC) Barcelona Spain 2018","DOI":"10.1109\/WCNC.2018.8377216"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.3390\/s19020243"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym10110600"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.3390\/fi10080074"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.161"},{"key":"e_1_2_8_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.55"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2386865"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01480-2"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym10080338"},{"key":"e_1_2_8_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-019-00833-0"},{"key":"e_1_2_8_28_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2020\/3576542","article-title":"Advanced data delivery strategy base on multi\u2010perceived community with IoT in social complex networks","volume":"2020","author":"Luo J.","year":"2020","journal-title":"Complexity"},{"key":"e_1_2_8_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.05.003"}],"container-title":["IET Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-net.2020.0082","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/iet-net.2020.0082","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-net.2020.0082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T21:43:58Z","timestamp":1742679838000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/iet-net.2020.0082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["10.1049\/iet-net.2020.0082"],"URL":"https:\/\/doi.org\/10.1049\/iet-net.2020.0082","archive":["Portico"],"relation":{},"ISSN":["2047-4954","2047-4962"],"issn-type":[{"type":"print","value":"2047-4954"},{"type":"electronic","value":"2047-4962"}],"subject":[],"published":{"date-parts":[[2020,11]]},"assertion":[{"value":"2020-05-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}