• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.5
• /
• pp.19-27
• /
• 2010

In this paper, we propose a scheme for real-time data retransmission in LR-WPAN to support the required QoS even in the severe channel error environments. In IEEE 802.15.4a, as the user data rate is supported up to 850Kbps, the real-time streaming data can be transferred more easily. In this research, we study the beacon-enabled mode in IEEE 802.15.4 LR-WPAN standard. In the proposed scheme, special slots are dynamical1y assigned for retransmission of the packet that fails during a real-time data service, and in the severe channel error environments a time diversity is acquired. Analytical results show that the proposed scheme is more robust and achieves a much higher throughput than the previous protocol in LR-WPAN.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.5
• /
• pp.33-41
• /
• 2009

In this paper, we propose a scheme for voice data retransmission in LR-WPAN to support the required QoS even in the severe channel error environments. In IEEE 802.15.4a, as the user data rate is supported up to 850Kbps, the voice streaming data can be transferred more easily. In this research, we study the beacon-enabled mode in IEEE 802.15.4 LR-WPAN standard with 250Kbps data rate. In the proposed scheme, special slots are dynamically assigned for retransmission of the packet that fails during a voice service, and in the severe channel error environments a time diversity is acquired. Analytical results show that the proposed scheme is more robust and achieves a much higher throughput than the previous protocol in LR-WPAN.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.6
• /
• pp.10-21
• /
• 2010

In the cluster-tree network which covers wide area network and has many nodes for monitoring purpose traffic is concentrated around the sink. There are long transmit delay and high data loss due to the intensive traffic when IEEE 802.15.4 is adapted to the cluster-tree network. In this paper we propose Dynamic Channel Allocation algorithm which dynamically allocates channels to increase the channel usage and the transmission success rate. To evaluate the performance of DCA, we assumed the monitoring network that consists of a cluster-tree in which sensing data is transmitted to the sink. Analysis uses the traffic data which is generated around the sink. As a result, DCA is superior when much traffic is generated. During the experiment assuming the least amount of traffic, IEEE 802.15.4, has the minimum length of active period and 90% data transmission success rate. However DCA maintains 11.8ms of active period length and results in 98.9% data transmission success rate.

• KIISE Transactions on Computing Practices
• /
• v.22 no.8
• /
• pp.375-380
• /
• 2016

The proliferation of online social networking services (OSNSs) and smartphones has enabled people to easily make friends with a large number of users in the online communities, and interact with each other. This leads to an increase in the usage rate of OSNSs. However, individuals who have immersed into their digital lives, prioritizing the virtual world against the real one, become more and more isolated in the physical world. Thus, their socialization processes that are undertaken only through lots of face-to-face interactions and trial-and-errors are apt to be neglected via 'Add Friend' kind of functions in OSNSs. In this paper, we present a friend recommendation system based on the on/off-line contextual information for the OSNS users to have more serendipitous offline interactions. In order to accomplish this, we modeled both offline information (i.e., place visit history) collected from a user's smartphone on a 3D tensor, and online social data (i.e., friend relationships) from Facebook on a matrix. We then recommended like-minded people and encouraged their offline interactions. We evaluated the users' satisfaction based on a real-world dataset collected from 43 users (12 on-campus users and 31 users randomly selected from Facebook friends of on-campus users).