• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.43-49
• /
• 2015

This paper designs and implements a smart phone safe application program for advanced preventing a danger during a car driving with doing a smart phone. The proposed smart phone safe application program has the aim to increase easily and naturally the concentration when the driver is using of the smart phone during a car driving. Especially when sudden situation occurs, If driver gives up driving conditions, and go to the restaurant, move to tourist resort. It will continue to send the text of driving even if another person is on the phone. In this paper a traffic safety simulation was performed using a fuzzy inference rules in order to solve these problem. The simulation is predicted greatly to decrease to send the auto sending message when the driver gives up suddenly the driving because catching up whether the car is driving or not.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.48-54
• /
• 2008

MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars co-existing in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the "time-interval based fairness partitioning method"(TIP). TIP will distribute the avatar to the game server equally with time-interval in order to avoid the problems form the unfairness of game servers load.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.6
• /
• pp.703-709
• /
• 2014

In the AMP(Asymmetric Multiprocessing) based dual core using core-specific operating system in a single processor system, shared memory method is used to send data between processors in dual core. To used shared memory in different operating systems, there is a problem of needing to solving the issue of message communication and synchronization between the two operations systems. In this paper, separate memory controller was used for data sharing between different processor cores in dual core environment. This controller can designate two slave ports to allow simultaneous access from two processors, and in the case of process data simultaneously by two processors, priority order of slave ports is determined through memory mediator. When sending data from A to B processor, SRAM area was logically separated into 8 pages. It allowed using memory area from multiple processes with the size of 4KByte per page, and control register with the size of 4Byte was used to discern the usability of current page.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.387-395
• /
• 2005

In this paper, we propose an end-to-end mobility management and TCP flow control scheme which considers different link characteristics for vertical handover environments. The end-to-end mobility management is performed by using SIP protocol. When a mobile node moves to a new network, it informs its movement of the correspondent node by sending SIP INFO message containing a new IP address which will be used in the new network. And then the corresponding node encapsulates all packets with the new IP address and sends them to the mobile node. in general, RTT of WLAN is shorter than RTT of cdma2000. when the MN moves from WLAN network to cdma2000 network, TCP retransmission timeout will be occurred in spite of non congestion situations. Thus, TCP congestion window size will be decreased and TCP throughput will be also decreased. To prevent this phenomenon, we propose a method using probe packets after handover to estimate a link delay of the new network. We also propose a method using bandwidth ratio of each network to update RTT. It is shown through NS-2 simulations that the proposed schemes can have better performance than the previous works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.221-231
• /
• 2006

TCP is needed as a transport protocol to provide reliable end-to-end message delivery for MANETs in order to achieve a smooth integration with the fixed Internet. Particularly, TCP has its variants, namely TCP-Reno and TCP-Vegas. However, there has been no research work on extensive performance comparison of TCP-Reno and TCP-Vegas over AODV and OLSR. This paper is the first trial to perform the research by using ns-2 simulator. Through the extensive simulations, we found that which to select among routing protocols is more important than which to select among TCP variants, because the performance difference between TCP-Reno and TCP-Vegas over uy selected routing protocol is not so much outstanding. Particularly, TCP-Vegas relies on an accurate BaseRTT estimation in order to decide the sending rate of a TCP Sender. However, it cannot be directly applied to MANET because a route change makes the Base an used over a Previous Path obsolete. Therefore, we propose a technique for improving the performance of TCP-Vegas by considering the route change, and show the performance improvement through simulation study.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.543-552
• /
• 2013

For the safety messages in IEEE 802.11p/WAVE vehicles network environment, strict periodic beacon broadcasting requires status advertisement to assist the driver for safety. In crowded networks where beacon message are broadcasted at a high number of frequencies by many vehicles, which used for beacon sending, will be congested by the wireless medium due to the contention-window based IEEE 802.11p MAC. To resolve the congestion, we consider a MAC scheme based on slotted p-persistent CSMA as a simple non-cooperative Bayesian game which involves payoffs reflecting the attempt probability. Then, we derive Bayesian Nash Equilibrium (BNE) in a closed form. Using the BNE, we propose new congestion control algorithm to improve the performance of the beacon rate under saturation condition in IEEE 802.11p/WAVE vehicular networks. This algorithm explicitly computes packet delivery probability as a function of contention window (CW) size and number of vehicles. The proposed algorithm is validated against numerical simulation results to demonstrate its stability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2119-2124
• /
• 2016

The Internet of things (IoT) needs to be an event-driven approach for efficient related time response and processing. The growth of mobile devices in Internet of Things (IoT) leads to a number of intelligent buildings related IoT applications. For instance, home automation controlling system uses client system such web apps on smartphone or web service to access the home server by sending control commands. The gateway based RESTful technology responsible for handling clients'requests attests an internet latency in case a large number of clients' requests submit toward the gateway increases. In this paper, we propose the design tasks of the IoT gateway for handling concurrency events. The gateway based event-driven architecture is designed for building IoT gateway using node.js on one side and communication protocol based message-oriented middleware known as XMPP to handle communications of intelligent building control devices connected to the gateway through a centralized hub.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.169-179
• /
• 2009

Communication log data consist of communication events such as sending and receiving e-mail or instance message and visiting web sites, etc. Many countries including USA and EU enforce the retention of these data on the communication service providers for the purpose of investigating or detecting criminals through the Internet. Because size of the retained data is very large, the efficient method for extracting valuable information from the data is needed for Law Enforcement Authorities to use the retained data. This paper defines the Interactive Communication Sequence Patterns(ICSPs) that is the important information when each communication event in communication log data consists of sender, receiver, and timestamp of this event. We also define a Mining(FDICSP) problem to discover such patterns and propose a method called Fast Discovering Interactive Communication Sequence Pattern(FDICSP) to solve this problem. FDICSP focuses on the characteristics of ICS to reduce the search space when it finds longer sequences by using shorter sequences. Thus, FDICSP can find Interactive Communication Sequence Patterns efficiently.