Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Myong-Soon Park

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 Se-Jung Lim

> Home > Persons > Myong-Soon Park

Publications

2012
[j17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ijdsn/LimP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijdsn/LimP12
Se-Jung Lim, Myong-Soon Park:
Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 8 (2012)
2011
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/sensors/BashirLCP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sensors/BashirLCP11
Ali Kashif Bashir, Se-Jung Lim, Sajjad Hussain Chauhdary, Myong-Soon Park:
Energy Efficient In-network RFID Data Filtering Scheme in Wireless Sensor Networks. Sensors 11(7): 7004-7021 (2011)
[c71]
- view
  authority control:
- export record
  dblp key:
  - conf/ucma/LimBRP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ucma/LimBRP11
Se-Jung Lim, Ali Kashif Bashir, Soyeon Rhee, Myong-Soon Park:
Energy-Based Re-transmission Algorithm of the Leader Node's Neighbor Node for Reliable Transmission in the PEGASIS. UCMA (1) 2011: 120-128

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.