default search action
Xuesong Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c15]Xuesong Jonathan Tan, Wenbo Gao, Xingyu Zhang:
A Novel Two-way Multihop Relay Scheme Based on Decode-and-Forward and Network Coding. VTC Fall 2020: 1-7
2010 – 2019
- 2019
- [j15]Xuesong Jonathan Tan, Jieran Wang, Yongjun Yuan:
Difference-Set-Based Channel Hopping for Minimum-Delay Blind Rendezvous in Multi-Radio Cognitive Radio Networks. IEEE Trans. Veh. Technol. 68(5): 4918-4932 (2019) - [c14]Xuesong Jonathan Tan, Yongjun Yuan:
Efficient Channel Hopping for Blind Rendezvous in Multi-Radio Cognitive Radio Networks. GLOBECOM 2019: 1-6 - 2018
- [j14]Xuesong Jonathan Tan, Wen Zhan:
Traffic-Adaptive Spectrum Leasing Between Primary and Secondary Networks. IEEE Trans. Veh. Technol. 67(7): 6546-6560 (2018) - [c13]Xuesong Jonathan Tan, Jieran Wang:
A Novel Asynchronous Channel Hopping Scheme for Blind Rendezvous in Cognitive Radio Networks. ICC 2018: 1-7 - 2017
- [j13]Xuesong Jonathan Tan, Wen Zhan:
Cluster-Based Control Information Exchange in Multi-Channel Ad Hoc Networks With Spectrum Heterogeneity. IEEE Access 5: 2720-2735 (2017) - [j12]Xuesong Jonathan Tan, Chao Zhou, Jie Chen:
Symmetric Channel Hopping for Blind Rendezvous in Cognitive Radio Networks Based on Union of Disjoint Difference Sets. IEEE Trans. Veh. Technol. 66(11): 10233-10248 (2017) - 2016
- [j11]Xuesong Jonathan Tan, Shuo-Yen Robert Li, Peng Chen:
Timeslot interchanging by efficient optical switches. IET Commun. 10(2): 162-169 (2016) - [j10]Fuxing Chen, Hui Li, Xuesong Tan, Shuo-Yen Robert Li:
Multicast Switching Fabric Based on Network Coding and Algebraic Switching Theory. IEEE Trans. Commun. 64(7): 2999-3010 (2016) - 2015
- [j9]Chuang Deng, Jun Liu, Xuesong Tan, Fuxiang Li:
Research and Application of Self-Organizing Communication Networks in Onsite Power Grid Rescue. J. Commun. 10(8): 615-620 (2015) - [c12]Renting Liu, Xuesong Jonathan Tan:
A Quota-Based Energy Consumption Management Method for Organizations Using Nash Bargaining Solution. DASFAA Workshops 2015: 98-108 - [c11]Xuesong Jonathan Tan, Wen Zhan:
A novel traffic-adaptive spectrum leasing scheme between primary and secondary networks. ICC 2015: 7596-7602 - 2014
- [j8]Shuo-Yen Robert Li, Xuesong Jonathan Tan, Peng Chen, Siu-Ting Ho:
Emulation of multistage interconnection networks by fibre memory. IET Commun. 8(15): 2591-2598 (2014) - [c10]Xuesong Jonathan Tan, Wen Zhan:
Control information exchange in cognitive radio ad hoc networks with heterogeneous spectrum. GLOBECOM 2014: 986-992 - 2012
- [j7]Xuesong Jonathan Tan, Liang Li, Wei Guo:
A Game-Theoretic Approach for Opportunistic Spectrum Sharing in Cognitive Radio Networks with Incomplete Information. IEICE Trans. Commun. 95-B(4): 1117-1124 (2012) - [c9]Xuesong Jonathan Tan, Liang Li, Wei Guo:
Bargaining-based spectrum sharing for cognitive radio networks with incomplete information. GLOBECOM 2012: 1198-1204 - 2011
- [j6]Shuo-Yen Robert Li, Xuesong Jonathan Tan:
Mux/Demux Queues, FIFO Queues, and Their Construction by Fiber Memories. IEEE Trans. Inf. Theory 57(3): 1328-1343 (2011) - [c8]Xuesong Jonathan Tan, Liang Li, Wei Guo:
A game-theoretic approach for opportunistic transmission scheme in cognitive radio networks with incomplete information. CrownCom 2011: 76-80
2000 – 2009
- 2009
- [j5]Shuo-Yen Robert Li, Xuesong Jonathan Tan:
On rearrangeability of tandem connection of banyan-type networks. IEEE Trans. Commun. 57(1): 164-170 (2009) - [j4]Xuesong Jonathan Tan, Shuo-Yen Robert Li:
Hybrid preservation of conditionally nonblocking switches under 2-stage interconnection. IEEE Trans. Commun. 57(4): 940-942 (2009) - 2007
- [j3]Xuesong Tan, Shuo-Yen Robert Li:
Rearrangeability of Tandem Cascade of Banyan-Type Networks. IEICE Trans. Inf. Syst. 90-D(1): 67-74 (2007) - [j2]Shuo-Yen Robert Li, Xuesong Tan:
Recursive construction of parallel distribution networks. J. Parallel Distributed Comput. 67(6): 617-634 (2007) - [j1]Shuo-Yen Robert Li, Xuesong Jonathan Tan:
Preservation of Conditionally Nonblocking Switches Under Two-Stage Interconnection. IEEE Trans. Commun. 55(5): 973-980 (2007) - [c7]Shuo-Yen Robert Li, Xuesong Jonathan Tan:
Fast Control over Fiber Memory. ISIT 2007: 2411-2415 - 2006
- [c6]Shuo-Yen Robert Li, Xuesong Tan:
Analog memory by recursive 2-stage switching. ISIT 2006: 2779-2783 - [c5]Xuesong Tan, Shuo-Yen Robert Li:
Mixed Preservation of Conditionally Nonblocking Switches under 2-stage Interconnection. PDCAT 2006: 17-22 - 2005
- [c4]Xuesong Tan, Shuo-Yen Robert Li:
On Rearrangeability of Cascaded Banyan-type Networks. PDCS 2005: 79-84 - [c3]Xuesong Tan, Shuo-Yen Robert Li, Yuxiu Shen:
Rearrangeability of the Tandem Cascade of Banyan-type Networks. PDCAT 2005: 11-15 - [c2]Shuo-Yen Robert Li, Xuesong Tan:
Theory on Switch Preservation under 2-stage Interconnection. PDCAT 2005: 26-30 - [c1]Shuo-Yen Robert Li, Xuesong Tan:
Recursive Construction of Distributors by Merging. Parallel and Distributed Computing and Networks 2005: 680-685 - 2004
- [b1]Xuesong Tan:
Switch preservation under two-stage interconnection: an algebraic theory for recursive construction of distributors and other types of switches. Chinese University of Hong Kong, Hong Kong, 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint