Wook Choi

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 Minh Thiep Ha

> Home > Persons > Wook Choi

Publications

2011
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/jnca/NguyenCHC11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jnca/NguyenCHC11
Dang Tu Nguyen, Wook Choi, Minh Thiep Ha, Hyunseung Choo:
Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks. J. Netw. Comput. Appl. 34(6): 1805-1817 (2011)
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/jnw/NguyenCHC11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jnw/NguyenCHC11
Dang Tu Nguyen, Wook Choi, Minh Thiep Ha, Hyunseung Choo:
An Energy-efficient Multi-candidate Greedy Routing Scheme in Wireless Sensor Networks. J. Networks 6(3): 365-377 (2011)
2010
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/icuimc/NguyenCHC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icuimc/NguyenCHC10
Dang Tu Nguyen, Wook Choi, Minh Thiep Ha, Hyunseung Choo:
MGR: a multicandidate greedy routing scheme in wireless sensor networks. ICUIMC 2010: 8
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/wcnc/NguyenCHC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wcnc/NguyenCHC10
Dang Tu Nguyen, Wook Choi, Minh Thiep Ha, Hyunseung Choo:
A Novel Multi-ACK Based Data Forwarding Scheme in Wireless Sensor Networks. WCNC 2010: 1-6

a service of

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.