{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:53:34Z","timestamp":1760147614547,"version":"build-2065373602"},"reference-count":38,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 62003359"],"award-info":[{"award-number":["No. 62003359"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In order to abstract away a network model from some real-world networks, such as navigation satellite networks and mobile call networks, we proposed an Isochronal-Evolution Random Matching Network (IERMN) model. An IERMN is a dynamic network that evolves isochronally and has a collection of edges that are pairwise disjoint at any point in time. We then investigated the traffic dynamics in IERMNs whose main research topic is packet transmission. When a vertex of an IERMN plans a path for a packet, it is permitted to delay the sending of the packet to make the path shorter. We designed a routing decision-making algorithm for vertices based on replanning. Since the IERMN has a specific topology, we developed two suitable routing strategies: the Least Delay Path with Minimum Hop (LDPMH) routing strategy and the Least Hop Path with Minimum Delay (LHPMD) routing strategy. An LDPMH is planned by a binary search tree and an LHPMD is planned by an ordered tree. The simulation results show that the LHPMD routing strategy outperformed the LDPMH routing strategy in terms of the critical packet generation rate, number of delivered packets, packet delivery ratio, and average posterior path lengths.<\/jats:p>","DOI":"10.3390\/e25020363","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T04:51:46Z","timestamp":1676523106000},"page":"363","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Routing Strategies for Isochronal-Evolution Random Matching Network"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7149-3573","authenticated-orcid":false,"given":"Weicheng","family":"Lun","sequence":"first","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qun","family":"Li","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3758-8568","authenticated-orcid":false,"given":"Zhi","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"048901","DOI":"10.7498\/aps.69.20190830","article-title":"Node influence of the dynamic networks","volume":"69","author":"Ren","year":"2020","journal-title":"Acta Phys. Sin."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"168901","DOI":"10.7498\/aps.69.20191162","article-title":"Link prediction model based on dynamic network representation","volume":"69","author":"Han","year":"2020","journal-title":"Acta Phys. Sin."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Wang, X.W., Jiang, G.P., and Wu, X. (2018). State Estimation for General Complex Dynamical Networks with Incompletely Measured Information. Entropy, 20.","DOI":"10.3390\/e20010005"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.dam.2011.07.006","article-title":"An independent set approach for the communication network of the GPS III system","volume":"161","author":"Brinkmann","year":"2013","journal-title":"Discret. Appl. Math."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1016\/j.asr.2010.10.002","article-title":"Inter-satellite ranging and inter-satellite communication links for enhancing GNSS satellite broadcast navigation data","volume":"47","author":"Francisco","year":"2011","journal-title":"Adv. Space Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.asr.2020.09.023","article-title":"A scheduling strategy to inter-satellite links assignment in GNSS","volume":"67","author":"Yan","year":"2021","journal-title":"Adv. Space Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1007\/s10291-016-0587-0","article-title":"Timeslot scheduling of inter-satellite links based on a system of a narrow beam with time division","volume":"21","author":"Yang","year":"2017","journal-title":"GPS Solut."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"208901","DOI":"10.7498\/aps.62.208901","article-title":"Analysis on degree characteristics of mobile call network","volume":"62","author":"Yu","year":"2013","journal-title":"Acta Phys. Sin."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s13278-013-0100-5","article-title":"On information propagation in mobile call networks","volume":"3","author":"Dyagilev","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Rodriguez-Carrion, A., Garcia-Rubio, C., and Campo, C. (2018). Detecting and Reducing Biases in Cellular-Based Mobility Data Sets. Entropy, 20.","DOI":"10.3390\/e20100736"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wu, X., Jiang, G.P., and Wang, X.W. (2019). A New Model for Complex Dynamical Networks Considering Random Data Loss. Entropy, 21.","DOI":"10.3390\/e21080797"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"168701","DOI":"10.1103\/PhysRevLett.110.168701","article-title":"Modeling Human Dynamics of Face-to-Face Interaction Networks","volume":"110","author":"Starnini","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Rocha, L., and Blondel, V.D. (2013). Bursts of Vertex Activation and Epidemics in Evolving Networks. PLoS Comput. Biol., 9.","DOI":"10.1371\/journal.pcbi.1002974"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1038\/srep00469","article-title":"Activity driven modeling of time varying networks","volume":"2","author":"Perra","year":"2012","journal-title":"Sci. Rep."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Ramiro, V., Lochin, E., Senac, P., and Rakotoarivelo, T. (2014, January 19). Temporal random walk as a lightweight communication infrastructure for opportunistic networks. Proceedings of the 2014 IEEE 15th International Symposium on \u201cA World of Wireless, Mobile and Multimedia Networks\u201d (WoWMoM), Sydney, NSW, Australia.","DOI":"10.1109\/WoWMoM.2014.6918919"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"042805","DOI":"10.1103\/PhysRevE.90.042805","article-title":"How memory generates heterogeneous dynamics in temporal networks","volume":"90","author":"Vestergaard","year":"2014","journal-title":"Phys. Rev. E"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1140\/epjb\/e2015-60525-3","article-title":"Applying temporal network analysis to the venture capital market","volume":"88","author":"Zhang","year":"2015","journal-title":"Eur. Phys. J. B"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Cioab\u0103, S., and Murty, R. (2009). A First Course in Graph Theory and Combinatorics, Hindustan Book Agency.","DOI":"10.1007\/978-93-86279-39-2"},{"key":"ref_19","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.dcan.2018.10.011","article-title":"Traffic dynamics on multilayer networks","volume":"6","author":"Wu","year":"2020","journal-title":"Digit. Commun. Netw."},{"key":"ref_21","first-page":"1697","article-title":"Traffic Dynamics on Multilayer Networks with Different Speeds","volume":"69","author":"Ma","year":"2022","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2250048","DOI":"10.1142\/S0129183122500486","article-title":"Traffic dynamics on homogeneous networks with community structure","volume":"33","author":"Ma","year":"2022","journal-title":"Int. J. Mod. Phys. C"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"078902","DOI":"10.7498\/aps.70.20201300","article-title":"Quantifying complex network traffic capacity based on communicability sequence entropy","volume":"70","author":"Ma","year":"2021","journal-title":"Acta Phys. Sin."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"188901","DOI":"10.7498\/aps.69.20200181","article-title":"Data traffic capability of double-layer network based on coupling strength","volume":"69","author":"Ma","year":"2020","journal-title":"Acta Phys. Sin."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"123402","DOI":"10.1088\/1742-5468\/ac3b44","article-title":"The self-adaptive routing strategy to alleviate packet loss in finite buffer networks","volume":"2021","author":"Wu","year":"2021","journal-title":"J. Stat. Mech. -Theory Exp."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2250133","DOI":"10.1142\/S0129183122501339","article-title":"Traffic dynamics based on dynamic local routing protocol in a finite buffer network","volume":"33","author":"Wu","year":"2022","journal-title":"Int. J. Mod. Phys. C"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"127887","DOI":"10.1016\/j.physa.2022.127887","article-title":"An efficient link closing strategy for improving traffic capacity on scale-free networks","volume":"604","author":"Zhang","year":"2022","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_28","unstructured":"Brualdi, R.A. (2009). Introductiory Combinatiorics, Pearson Education, Inc."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3841","DOI":"10.7498\/aps.59.3841","article-title":"A gobal routing method for weighted scale-free networks","volume":"59","author":"Pu","year":"2010","journal-title":"Acta Phys. Sin."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"134","DOI":"10.3938\/jkps.50.134","article-title":"Traffic flow and efficient routing on scale-free networks: A survey","volume":"50","author":"Wang","year":"2007","journal-title":"J. Korean Phys. Soc."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"3001","DOI":"10.1016\/j.physa.2008.01.085","article-title":"Traffic Dynamics Based on aTraffic Awareness Routing Strategy on Scale-free Networks","volume":"387","author":"Wang","year":"2008","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"3196","DOI":"10.1103\/PhysRevLett.86.3196","article-title":"Communication in networks with hierarchical branching","volume":"86","author":"Arenas","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"028901","DOI":"10.7498\/aps.63.028901","article-title":"A pervasive optimized algorithm for complex network routing strategy","volume":"63","author":"Li","year":"2014","journal-title":"Acta Phys. Sin."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1186\/s13638-015-0427-x","article-title":"Routing in delay tolerant networks with periodic connections","volume":"2015","author":"Mergenci","year":"2015","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_35","unstructured":"Li, Q., Huang, J.X., Zhu, Y.F., Li, R.J., and Lei, Y.L. (2018). System of Systems Computing Experiment and Application Based on ABMS, Publishing House of Electronics Industry."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"248901","DOI":"10.7498\/aps.65.248901","article-title":"Energy-based hybrid routing strategy for scale-free networks","volume":"65","author":"Yang","year":"2016","journal-title":"Acta Phys. Sin."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"L36","DOI":"10.3847\/2041-8213\/ab8016","article-title":"The Low Earth Orbit Satellite Population and Impacts of the SpaceX Starlink Constellation","volume":"892","author":"McDowell","year":"2020","journal-title":"Astrophys. J."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Ge, L.G., and Jiang, S.M. (2022). An Efficient Routing Scheme Based on Node Attributes for Opportunistic Networks in Oceans. Entropy, 24.","DOI":"10.3390\/e24050607"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/2\/363\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:38:01Z","timestamp":1760121481000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/2\/363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,16]]},"references-count":38,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["e25020363"],"URL":"https:\/\/doi.org\/10.3390\/e25020363","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,2,16]]}}}