James Zijun Wang

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yongjun Li

> Home > Persons > James Zijun Wang

Publications

2011
[j15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/mis/LiCXW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mis/LiCXW11
Yongjun Li, Hu Chen, Rong Xie, James Z. Wang:
BGN: A novel scatternet formation algorithm for bluetooth-based sensor networks. Mob. Inf. Syst. 7(2): 93-106 (2011)
2009
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/wicomm/XieQLW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/wicomm/XieQLW09
Rong Xie, Deyu Qi, Yongjun Li, James Zijun Wang:
A novel distributed MCDS approximation algorithm for wireless sensor networks. Wirel. Commun. Mob. Comput. 9(3): 427-437 (2009)
2007
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/comcom/LiW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comcom/LiW07
Yongjun Li, James Zijun Wang:
Cost analysis and optimization for IP multicast group management. Comput. Commun. 30(8): 1721-1730 (2007)
2006
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/broadnets/LiZWQ06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/broadnets/LiZWQ06
Yongjun Li, Wenhui Zhou, James Zijun Wang, Deyu Qi:
Optimizing IP Multicast through Delayed Multicast Tree Pruning. BROADNETS 2006

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.