Jeongseok Yu

Jeongseok Yu

Auto-generated profile, based on publicly available information

Jeongseok Yu

School of Computer Science and Engineering, Chung-Ang University, 221 Heukseok, Dongjak, Seoul 156-756, Korea

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2016 in Sensors
Verified
Journal Article
Open access
PDF file
JYJeongseok Yu
Jeongseok Yu
LPLaihyuk Park
Laihyuk Park
JPJunho Park
Junho Park
Sungrae ChoSungrae Cho
Sungrae Cho
CKChangsup Keum
Changsup Keum
Reserving time slots for urgent data, such as life-critical information, seems to be very attractive to guarantee their deadline requirements in wireless body area sensor networks (WBASNs). On the other hand, this reservation imposes a negative impact on performance for the utilization of a channel. This paper proposes a new channel access scheme referred to as the contention over reservation MAC (CoR-MAC) protocol for time-critical services in wireless body area sensor networks. CoR-MAC uses the dual reservation; if the reserved time slots are known to be vacant, other nodes can access the time slots by contention-based reservation to maximize the utilization of a channel and decrease the delay of the data. To measure the effectiveness of the proposed scheme against IEEE 802.15.4 and IEEE 802.15.6, we evaluated their performances with various performance indexes. The CoR-MAC showed 50% to 850% performance improvement in terms of the delay of urgent and time-critical data according to the number of nodes.

1 February 2014
Verified
Conference Paper
Closed access
JYJeongseok Yu
Jeongseok Yu
TKTae-Jin Kim
Tae-Jin Kim
WNWoongsoo Na
Woongsoo Na
HBHyoungchel Bae
Hyoungchel Bae
YLYunseong Lee
Yunseong Lee
Junbeom HurJunbeom Hur
Junbeom Hur
IEEE 802.15 task group 8 (IEEE 802.15.8) has been recently chartered to define PHY and MAC mechanism for wireless personal area networks (WPAN) peer aware communications (PAC) optimized for peer to peer and infrastructureless communications with fully distributed coordination. The most promising services created by IEEE 802.15.8 would be multicast communication with simultaneous membership in multiple groups, typically up to 10, in dense network topology. Most existing multicast techniques in mobile ad hoc networks (MANET) have relied upon a central coordinator to manage its multicast group and thus cannot be used for fully-distributed PAC networks. In this paper, we propose a graph-based multicast routing protocol referred to as fully-distributed multicast routing protocol (FDMRP) for IEEE 802.15.8 PAC networks. The FDMRP minimizes routing table entries and thus reduces control message overhead for its multicast group management. To balance the control message, all nodes in the network have a similar number of routing entries to manage nodes in a same multicast group. To measure the effectiveness of the proposed FDMRP against the ODMRP [10], we evaluated performance by OPNET simulator. Performance evaluation shows that the FDMRP shows less control message overhead and multicast group join latency than the ODMRP.