Concurrent Multipath Routing Optimization in Named Data Networks

To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE internet of things journal Vol. 7; no. 2; pp. 1451 - 1463
Main Authors:	Zhang, Yu, An, Xuming, Yuan, Mengze, Bu, Xiangyuan, An, Jianping
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.02.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation algorithms Caching Complexity Complexity theory Computer simulation Flooding Heuristic algorithms Heuristic methods Internet of Things Maximum concurrent flow problem (MCFP) named data networking (NDN) Optimization randomized rounding Rounding Route planning Routing Shortest-path problems Simulation Throughput
ISSN:	2327-4662, 2327-4662
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal routing and forwarding solution with our improved Fleischer and random rounding (FRR) algorithm. We analyze the complexity of the Fleischer algorithm more comprehensively and give the best scaling method to achieve the least iterations. In addition, we further reduce the complexity of the Fleischer algorithm so that it iterates only once, thus getting a heuristic algorithm which is called multicommodity multipath (MCMP). Using ndnSIM-based simulation, we compare our proposed routing algorithms with the existing routing algorithms, including flooding, k-shortest path, and best single path routing, and the simulation results prove that FRR and MCMP can outperform other algorithms both in throughput and latency, and it can also be concluded that the best number of paths for k-shortest path routing should be close to and less than the average node degree of the network. For studying routing optimization with caching, we conduct simulations with different in-network cache capacity and different caching policies. The simulation results show that although the LRU can achieve the best performance under the same cache capacity, the cache capacity plays a decisive role. All routing algorithms produce better performance with caching, but the FRR still achieves the best performance, and follows by MCMP.
AbstractList	To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal routing and forwarding solution with our improved Fleischer and random rounding (FRR) algorithm. We analyze the complexity of the Fleischer algorithm more comprehensively and give the best scaling method to achieve the least iterations. In addition, we further reduce the complexity of the Fleischer algorithm so that it iterates only once, thus getting a heuristic algorithm which is called multicommodity multipath (MCMP). Using ndnSIM-based simulation, we compare our proposed routing algorithms with the existing routing algorithms, including flooding, k-shortest path, and best single path routing, and the simulation results prove that FRR and MCMP can outperform other algorithms both in throughput and latency, and it can also be concluded that the best number of paths for k-shortest path routing should be close to and less than the average node degree of the network. For studying routing optimization with caching, we conduct simulations with different in-network cache capacity and different caching policies. The simulation results show that although the LRU can achieve the best performance under the same cache capacity, the cache capacity plays a decisive role. All routing algorithms produce better performance with caching, but the FRR still achieves the best performance, and follows by MCMP. To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source–sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal routing and forwarding solution with our improved Fleischer and random rounding (FRR) algorithm. We analyze the complexity of the Fleischer algorithm more comprehensively and give the best scaling method to achieve the least iterations. In addition, we further reduce the complexity of the Fleischer algorithm so that it iterates only once, thus getting a heuristic algorithm which is called multicommodity multipath (MCMP). Using ndnSIM-based simulation, we compare our proposed routing algorithms with the existing routing algorithms, including flooding, [Formula Omitted]-shortest path, and best single path routing, and the simulation results prove that FRR and MCMP can outperform other algorithms both in throughput and latency, and it can also be concluded that the best number of paths for [Formula Omitted]-shortest path routing should be close to and less than the average node degree of the network. For studying routing optimization with caching, we conduct simulations with different in-network cache capacity and different caching policies. The simulation results show that although the LRU can achieve the best performance under the same cache capacity, the cache capacity plays a decisive role. All routing algorithms produce better performance with caching, but the FRR still achieves the best performance, and follows by MCMP.
Author	An, Jianping An, Xuming Zhang, Yu Bu, Xiangyuan Yuan, Mengze
Author_xml	– sequence: 1 givenname: Yu orcidid: 0000-0001-8709-2718 surname: Zhang fullname: Zhang, Yu email: yuzhang@bit.edu.cn organization: School of Information and Electronics, Beijing Institute of Technology, Beijing, China – sequence: 2 givenname: Xuming surname: An fullname: An, Xuming email: 2120160725@bit.edu.cn organization: School of Information and Electronics, Beijing Institute of Technology, Beijing, China – sequence: 3 givenname: Mengze surname: Yuan fullname: Yuan, Mengze email: 3220180520@bit.edu.cn organization: School of Information and Electronics, Beijing Institute of Technology, Beijing, China – sequence: 4 givenname: Xiangyuan orcidid: 0000-0001-9092-487X surname: Bu fullname: Bu, Xiangyuan email: bxy@bit.edu.cn organization: School of Information and Electronics, Beijing Institute of Technology, Beijing, China – sequence: 5 givenname: Jianping orcidid: 0000-0002-6441-9711 surname: An fullname: An, Jianping email: an@bit.edu.cn organization: School of Information and Electronics, Beijing Institute of Technology, Beijing, China
BookMark	eNp9kE1PwzAMhiMEEmPsByAulTh3xEnTLjfQ-Boam4TGuXLTFDK2pKSpEPx6OjYhxIGL7cP72NZzRPats5qQE6BDACrP7yfzxZBRkEMmhQAu90iPcZbFSZqy_V_zIRk0zZJS2mECZNojF2NnVeu9tiF6aFfB1BheokfXBmOfo3kdzNp8YjDORsZGM1zrMrrCgNFMh3fnX5tjclDhqtGDXe-Tp5vrxfguns5vJ-PLaayY5CFWIhUc0gIyRnmJCVZYoC4TpiRq0VVVYKVLqFAUGaLkSQUaKVAFlGZ8xPvkbLu39u6t1U3Il671tjuZMy4yBkymvEtl25Tyrmm8rnJlwvf7waNZ5UDzjbF8YyzfGMt3xjoS_pC1N2v0H_8yp1vGaK1_8iMJlGecfwF7-3je
CODEN	IITJAU
CitedBy_id	crossref_primary_10_1049_itr2_12042 crossref_primary_10_3390_electronics9050749 crossref_primary_10_1109_ACCESS_2024_3452281 crossref_primary_10_1109_JIOT_2025_3577896 crossref_primary_10_1109_TCOMM_2023_3251360 crossref_primary_10_1109_TWC_2022_3144189 crossref_primary_10_1109_JIOT_2024_3468642 crossref_primary_10_1002_dac_5266 crossref_primary_10_1007_s13369_022_07479_w crossref_primary_10_1080_1206212X_2023_2279811 crossref_primary_10_1109_TNSM_2020_3044037
Cites_doi	10.1109/SURV.2013.070813.00063 10.1002/itl2.1 10.1364/JOCN.1.000392 10.1145/2018584.2018595 10.1109/ICNP.2013.6733576 10.1002/net.3230030202 10.1109/TMM.2018.2796246 10.1137/S0097539704446232 10.1002/net.3230010202 10.1109/GLOCOM.2013.6831270 10.1007/BF02614505 10.1109/TNET.2016.2633370 10.1007/s101070100254 10.1145/77600.77620 10.1016/j.comcom.2013.01.005 10.1016/j.comcom.2019.05.010 10.1145/3125719.3132098 10.1145/2660129.2660141 10.1145/1806689.1806708 10.1109/TNET.2016.2636843 10.1287/opre.11.3.344 10.1287/ijoc.1.2.62 10.1109/EuCNC.2014.6882665 10.1016/j.comnet.2014.04.001 10.1109/JSAC.2018.2844981 10.1109/TNET.2018.2793581 10.1109/ACCESS.2017.2789330 10.1145/2660129.2660144 10.1145/2660129.2660148 10.1145/3138808.3138812 10.1287/moor.20.2.257 10.1109/MNET.2016.7437030 10.1109/SFCS.1998.743463 10.1109/TNET.2018.2879979 10.1109/MCOM.2012.6231276 10.1109/JSAC.2016.2577365 10.1109/SFCS.1975.21 10.1145/2660129.2660151 10.1109/RIOT.2015.7104902 10.1109/JIOT.2018.2873343 10.1145/2491224.2491231 10.1109/MNET.2014.6843233 10.1145/2660129.2660155 10.1016/j.comnet.2015.03.004 10.1109/90.811453 10.1145/3125719.3132099 10.1137/S0895480199355754 10.1109/IWQoS.2016.7590394 10.1145/1658939.1658941
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID	97E RIA RIE AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1109/JIOT.2019.2955139
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	2327-4662
EndPage	1463
ExternalDocumentID	10_1109_JIOT_2019_2955139 8910373
Genre	orig-research
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: 61971457; 61901035 funderid: 10.13039/501100001809
GroupedDBID	0R~ 4.4 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG AGQYO AGSQL AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD IFIPE IPLJI JAVBF M43 OCL PQQKQ RIA RIE AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c293t-c565316b17203da4afabaed42c9ae52c9cbafed1fa5b7aa934f1ea010c1007383
IEDL.DBID	RIE
ISICitedReferencesCount	13
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000521981800051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2327-4662
IngestDate	Sun Nov 09 07:30:58 EST 2025 Sat Nov 29 06:16:48 EST 2025 Tue Nov 18 22:38:04 EST 2025 Wed Aug 27 02:36:24 EDT 2025
IsPeerReviewed	false
IsScholarly	true
Issue	2
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c293t-c565316b17203da4afabaed42c9ae52c9cbafed1fa5b7aa934f1ea010c1007383
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-9092-487X 0000-0001-8709-2718 0000-0002-6441-9711
PQID	2357212963
PQPubID	2040421
PageCount	13
ParticipantIDs	ieee_primary_8910373 crossref_citationtrail_10_1109_JIOT_2019_2955139 proquest_journals_2357212963 crossref_primary_10_1109_JIOT_2019_2955139
PublicationCentury	2000
PublicationDate	2020-02-01
PublicationDateYYYYMMDD	2020-02-01
PublicationDate_xml	– month: 02 year: 2020 text: 2020-02-01 day: 01
PublicationDecade	2020
PublicationPlace	Piscataway
PublicationPlace_xml	– name: Piscataway
PublicationTitle	IEEE internet of things journal
PublicationTitleAbbrev	JIoT
PublicationYear	2020
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref15 ref53 ref52 ref55 ref11 ref54 ref10 nahabedian (ref51) 2010 ref17 ref18 motwani (ref57) 2010 gündogan (ref12) 2017 ref50 ref46 ref45 ref48 wang (ref19) 2012 ref47 ref41 ref44 ref43 medina (ref58) 2001 ravindran (ref14) 2013 ref49 sansò (ref37) 2012 ref8 ref7 ref4 ref3 ref6 yi (ref16) 2013 ref5 ref35 ref34 ref36 ref31 shang (ref9) 2016 ref30 tortelli (ref20) 2013 ref33 ref32 ref2 ref1 ref39 hoque (ref21) 2013 ref38 gleixner (ref59) 2018 emanuelsson (ref56) 2016 ahuja (ref40) 1993 ref24 moy (ref42) 1998 ref23 ref26 ref25 ref22 ref28 ref27 ref29 ref60 ref62 ref61
References_xml	– ident: ref2 doi: 10.1109/SURV.2013.070813.00063 – ident: ref13 doi: 10.1002/itl2.1 – ident: ref38 doi: 10.1364/JOCN.1.000392 – year: 2012 ident: ref37 publication-title: Telecommunications Network Planning – ident: ref44 doi: 10.1145/2018584.2018595 – ident: ref24 doi: 10.1109/ICNP.2013.6733576 – ident: ref52 doi: 10.1002/net.3230030202 – year: 2001 ident: ref58 article-title: BRITE: Universal topology generation from a user's perspective, (user manual) – ident: ref48 doi: 10.1109/TMM.2018.2796246 – ident: ref35 doi: 10.1137/S0097539704446232 – ident: ref18 doi: 10.1002/net.3230010202 – ident: ref60 doi: 10.1109/GLOCOM.2013.6831270 – ident: ref32 doi: 10.1007/BF02614505 – ident: ref25 doi: 10.1109/TNET.2016.2633370 – year: 2010 ident: ref51 article-title: A primal-dual approximation algorithm for the concurrent flow problem – ident: ref50 doi: 10.1007/s101070100254 – ident: ref54 doi: 10.1145/77600.77620 – ident: ref15 doi: 10.1016/j.comcom.2013.01.005 – ident: ref6 doi: 10.1016/j.comcom.2019.05.010 – ident: ref47 doi: 10.1145/3125719.3132098 – ident: ref45 doi: 10.1145/2660129.2660141 – ident: ref55 doi: 10.1145/1806689.1806708 – ident: ref27 doi: 10.1109/TNET.2016.2636843 – year: 2013 ident: ref16 article-title: On the role of routing in named data networking – year: 2016 ident: ref56 article-title: Approximating multi-commodity max-flow in practice – ident: ref17 doi: 10.1287/opre.11.3.344 – year: 1998 ident: ref42 publication-title: OSPF version 2 equal cost multipath (ECMP) – ident: ref30 doi: 10.1287/ijoc.1.2.62 – ident: ref3 doi: 10.1109/EuCNC.2014.6882665 – year: 1993 ident: ref40 publication-title: Network Flows Theory Algorithms and Applications – ident: ref36 doi: 10.1016/j.comnet.2014.04.001 – ident: ref28 doi: 10.1109/JSAC.2018.2844981 – ident: ref62 doi: 10.1109/TNET.2018.2793581 – ident: ref22 doi: 10.1109/ACCESS.2017.2789330 – ident: ref10 doi: 10.1145/2660129.2660144 – ident: ref7 doi: 10.1145/2660129.2660148 – start-page: 117 year: 2016 ident: ref9 article-title: Named data networking of things publication-title: Proc IEEE 1st Int Conf Internet Things Design Implement (IoTDI) – year: 2018 ident: ref59 article-title: The SCIP optimization suite 6.0 – ident: ref39 doi: 10.1145/3138808.3138812 – ident: ref31 doi: 10.1287/moor.20.2.257 – ident: ref8 doi: 10.1109/MNET.2016.7437030 – ident: ref33 doi: 10.1109/SFCS.1998.743463 – ident: ref29 doi: 10.1109/TNET.2018.2879979 – ident: ref1 doi: 10.1109/MCOM.2012.6231276 – ident: ref26 doi: 10.1109/JSAC.2016.2577365 – ident: ref53 doi: 10.1109/SFCS.1975.21 – ident: ref61 doi: 10.1145/2660129.2660151 – ident: ref4 doi: 10.1109/RIOT.2015.7104902 – ident: ref5 doi: 10.1109/JIOT.2018.2873343 – start-page: 15 year: 2013 ident: ref21 article-title: NLSR: Named-data link state routing protocol publication-title: Proc ACM SIGCOMM Workshop Inf -Centric Netw doi: 10.1145/2491224.2491231 – year: 2013 ident: ref20 article-title: Performance assessment of routing strategies in named data networking publication-title: Proc GTTI Session Telecommun Netw – ident: ref11 doi: 10.1109/MNET.2014.6843233 – start-page: 1102 year: 2013 ident: ref14 article-title: Information-centric networking based homenet publication-title: Proc IFIP/IEEE Int Symp Integr Netw Manage – ident: ref46 doi: 10.1145/2660129.2660155 – year: 2012 ident: ref19 article-title: OSPFN: An OSPF based routing protocol for named data networking – ident: ref49 doi: 10.1016/j.comnet.2015.03.004 – ident: ref43 doi: 10.1109/90.811453 – start-page: 214 year: 2017 ident: ref12 article-title: Information-centric networking for the industrial IoT publication-title: Proc 4th ACM Conf Inf -Centric Netw doi: 10.1145/3125719.3132099 – year: 2010 ident: ref57 publication-title: Randomized Algorithms – ident: ref34 doi: 10.1137/S0895480199355754 – ident: ref23 doi: 10.1109/IWQoS.2016.7590394 – ident: ref41 doi: 10.1145/1658939.1658941
SSID	ssj0001105196
Score	2.2575958
Snippet	To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as... To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source–sink pair, we model the routing problem in NDN as...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1451
SubjectTerms	Algorithms Approximation algorithms Caching Complexity Complexity theory Computer simulation Flooding Heuristic algorithms Heuristic methods Internet of Things Maximum concurrent flow problem (MCFP) named data networking (NDN) Optimization randomized rounding Rounding Route planning Routing Shortest-path problems Simulation Throughput
Title	Concurrent Multipath Routing Optimization in Named Data Networks
URI	https://ieeexplore.ieee.org/document/8910373 https://www.proquest.com/docview/2357212963
Volume	7
WOSCitedRecordID	wos000521981800051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 2327-4662 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001105196 issn: 2327-4662 databaseCode: RIE dateStart: 20140101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4B4sGLqGhE0fTgyTjYaNnWmwYl6gE8YMJtabs2IdFhYPj329cVjNGYeFl2aJPlvfX96Pve-wAuJXblJZoHzNhMhyWMBWmciCBKhU6oVbhkuSObSMbjdDbjzzW43vbCaK0d-Ex38dXV8vOFWuNVWS_l2NVG61BPkrjq1fq6T4kwGIl94TIKee_pcTJF7Bbv9jnSmPBvrsdxqfwwwM6rjJr_-5592PPRI7mt1H0ANV0cQnPDzED8QW3BzXBRqGryEnEttkg8TBD9Yz0VmVgz8eb7L8m8IGNhXSK5E6Ug4woVvjqCl9H9dPgQeK6EQFmHXQbKBmY0imWEZdVcMGGEFDpnfcWFHtinksLoPDJiIBMhOGUm0sImYwphEjZNPYZGsSj0CRAjuRFKusSZ2eBb2pjBUCopCynPw6gN4UaMmfKDxJHP4jVzCUXIM5R8hpLPvOTbcLXd8l5N0fhrcQtFvV3opdyGzkZXmT9nqwyH9Vjna63I6e-7zmC3jxmyw1l3oFEu1_ocdtRHOV8tL9wv9Anv2MR2
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNGLqGhEUXvwZBxsrLD1pkEJKA4PmHBb2q5LSHQYGP799nUFYzQmXpYd2mR5b30_-r73PoBLgV15gWIOTXWmQwNKnbATcMcLuQp8rXBBE0M2EURROJmw5xJcr3thlFIGfKYa-Gpq-clMLvGqrBky7GrzN2ATmbNst9bXjYqH4UjHli49lzUfBqMxordYo8WQyIR9cz6GTeWHCTZ-pVf53xftwa6NH8ltofB9KKnsACorbgZij2oVbrqzTBazl4hpskXqYYL4H-2ryEgbijfbgUmmGYm4dorkjuecRAUufHEIL737cbfvWLYER2qXnTtSh2a-1xEeFlYTTnnKBVcJbUnGVVs_peCpSryUt0XAOfNp6imu0zGJQAmdqB5BOZtl6hhIKljKpTCpM9Xht9BRQ-r7wqeuzxLXq4G7EmMs7ShxZLR4jU1K4bIYJR-j5GMr-Rpcrbe8F3M0_lpcRVGvF1op16C-0lVsT9oixnE92v1qO3Ly-64L2O6Pn4bxcBA9nsJOC_Nlg7quQzmfL9UZbMmPfLqYn5vf6RNWNce_
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Concurrent+Multipath+Routing+Optimization+in+Named+Data+Networks&rft.jtitle=IEEE+internet+of+things+journal&rft.au=Zhang%2C+Yu&rft.au=An%2C+Xuming&rft.au=Yuan%2C+Mengze&rft.au=Bu%2C+Xiangyuan&rft.date=2020-02-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.eissn=2327-4662&rft.volume=7&rft.issue=2&rft.spage=1451&rft_id=info:doi/10.1109%2FJIOT.2019.2955139&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2327-4662&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2327-4662&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2327-4662&client=summon