2008 |
13 | | Sujeong U,
Gihwan Cho,
Moonkun Lee:
Development of a Scheduler for Hard Real-time Emergency Medical Systems over Networked Space in a Process Algebra.
FCS 2008: 63-69 |
12 | | Jaebok Park,
Yoonhwan Park,
Seunghae Kim,
Gihwan Cho:
An Efficient Mobile Object Tracking Method based on Dynamic Clustering in Sensor Network.
ICWN 2008: 36-40 |
11 | | Ji Gong,
Hyuntae Kim,
Gihwan Cho:
Coverage Efficient Clustering Method Based on Time Delay for Wireless Sensor Networks.
ICWN 2008: 82-86 |
2007 |
10 | EE | Woosuk Cha,
Eun-Mi Kim,
Bae-Ho Lee,
Gihwan Cho:
An Efficient Bi-Directional Flooding in Wireless Sensor Networks.
UIC 2007: 454-463 |
2006 |
9 | EE | Taeyeon Kim,
Gicheol Wang,
Gihwan Cho:
A Secure Key Agreement Scheme in Low-Energy Wireless Sensor Networks.
EUC 2006: 79-88 |
8 | EE | Sukdea Yu,
Moonkun Lee,
Gihwan Cho:
An Emergency Message Propagation Method in Highway Traffic.
UCS 2006: 331-343 |
7 | EE | Sukdea Yu,
Gihwan Cho:
An Effective Message Flooding Method for Vehicle Safety Communication.
UIC 2006: 219-228 |
2005 |
6 | EE | Gicheol Wang,
Gihwan Cho:
An On-Demand Cluster Formation Scheme for Efficient Flooding in Ad-Hoc Networks.
IEICE Transactions 88-B(9): 3563-3569 (2005) |
2004 |
5 | EE | Woosuk Cha,
Gicheol Wang,
Gihwan Cho:
A Pair-Wise Key Agreement Scheme in Ad Hoc Networks.
International Conference on Computational Science 2004: 648-651 |
4 | EE | Seungmin Park,
Daeyoung Kim,
Gihwan Cho:
Improving prediction level of prefetching for location-aware mobile information service.
Future Generation Comp. Syst. 20(2): 197-203 (2004) |
2003 |
3 | EE | KiCheoul Wang,
Gihwan Cho:
Two Phases Based Cluster Formation Scheme for Mobile Ad Hoc Networks.
International Conference on Computational Science 2003: 194-206 |
1998 |
2 | EE | Gihwan Cho:
A Location Update Protocol Supporting Route Optimization for Mobile Hosts.
J. Network Syst. Manage. 6(1): (1998) |
1995 |
1 | | Gihwan Cho,
Lindsay F. Marshall:
An Efficient Location and Routing Scheme for Mobile Computing Environments.
IEEE Journal on Selected Areas in Communications 13(5): 868-879 (1995) |