Please use this identifier to cite or link to this item: https://doi.org/10.1209/0295-5075/102/28002
DC FieldValue
dc.titleEfficient routing on multilayered communication networks
dc.contributor.authorZhou, J.
dc.contributor.authorYan, G.
dc.contributor.authorLai, C.-H.
dc.date.accessioned2014-10-16T09:22:50Z
dc.date.available2014-10-16T09:22:50Z
dc.date.issued2013-04
dc.identifier.citationZhou, J., Yan, G., Lai, C.-H. (2013-04). Efficient routing on multilayered communication networks. EPL 102 (2) : -. ScholarBank@NUS Repository. https://doi.org/10.1209/0295-5075/102/28002
dc.identifier.issn02955075
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/96386
dc.description.abstractWe study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal routing on this kind of multilayered networks, where the single-channel transmission mode and the multichannel transmission mode used on the wireless subnetwork are considered, respectively. Compared with the performance of the shortest path algorithm, our algorithm can significantly enhance the transport capacity. We show that our methods proposed in this letter could take advantage of the coupling of the two layers to the most extent, so that the wireless subnetwork could sufficiently utilize the wired subnetwork for transportation. © Copyright EPLA, 2013.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentPHYSICS
dc.description.doi10.1209/0295-5075/102/28002
dc.description.sourcetitleEPL
dc.description.volume102
dc.description.issue2
dc.description.page-
dc.identifier.isiut000319617700022
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

29
checked on Apr 17, 2021

WEB OF SCIENCETM
Citations

27
checked on Apr 9, 2021

Page view(s)

74
checked on Apr 11, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.