• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.3
• /
• pp.239-246
• /
• 2014

In the context of wireless sensor networks, one of major issues is energy conservation. For low power communication, by utilizing our experimental results for the relation between clock drift and synchronization interval, we designed a new protocol which can support a wide range of duty cycles for applications with very low traffic rate and insensitive delay. The transmission (TX) node in the protocol synchronizes with the reception (RX) node very before transmitting a packet, and it can adaptively estimate the synchronization error size according to the synchronization interval from minutes to hours. We conducted simulations and a testbed implementation to show the efficacy of the proposed protocol. We found that our protocol substantially outperforms other state-of-the-art protocols, resulting in order-of-magnitude increase in network lifetime over a variety of duty cycles.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.229-237
• /
• 2005

One of the important issues of in this research is effective usage of energy to increase life time of nodes which form a network. Existing LEEM protocol causes unnecessary active time due to small packets with shorter transfer time than active interval period of node and packets with transfer time of more than twice of active interval period of node. In this paper, we propose Energy-Efficient MAC by Reservation (EEMR) protocol which can increase energy effectiveness in wireless sensor network environment by reducing unnecessary active time using a method that reserves next-hop depend upon the size of packet. We evaluated effectiveness of our proposed method through experiments. The result showed that using EEMR protocol had better energy effectiveness than existing LEEM protocol by 15%.

• 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.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.858-861
• /
• 2011

In this paper, we present a RFID system by using a wireless sensor network. The proposed system is installed in glove for activity monitoring. The RFID reader, to send data by using sensor network platform and RFID tag are small size, the shape of quadrangle, and operate in the frequency of 13.56 MHz. The sensor node can read RFID tags on the various objects used in daily living such as furniture, medicines, and kitchenwares. The sensor node reads the data of RFID tags, it transmits wireless packets to the sink node. The sink node sends the received packet immediately to a server system. The data from each RFID system is collected into a database, and then the data are processed to visualize the measurement of daily living activities of users. We provide a web-based monitoring system, and can see the number of RFID tag readings per day as bar charts. The result of experiments demonstrates that the way we propose can help to check the situation of life for people who live alone.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.296-304
• /
• 2010

MoIP is technology to transmit a variety of multimedia over IP, but compared to traditional voice services require greater bandwidth and radio resources in a wireless environment has already reached the limits. Therefore, as a way to resolve this issue for header compression is a lot of research. SCTP protocol header compression using ROHC-SCTP has been research, ROHC-SCTP packet structure of the ROHC algorithm with different types and, SCTP header compression to apply the characteristics of the poor performance of many of these have drawbacks. Therefore, in this paper to solve these problems better header compression algorithm was designed. In this paper, the proposed algorithm to evaluate the NS-2 simulation environment was modeled on the header compression operation. Evaluation results, the algorithm designed in this paper compared to ROHC-SCTP algorithms determine the overhead rate was low, the data types vary a lot better when the total header size was small.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.745-759
• /
• 2011

In this paper, we propose the global handover mechanism that is able to provide the unlimited range of next-generation multimedia mobile services in an integrated environment. This mechanism consists of a multicast source based forwarding scheme and a global session management scheme. Global session management scheme provides LMA session information management, global mobility and route optimization. Multicast source based forwarding scheme delivers data between previously attached LMA and newly attached LMA without packet loss. In addition, this scheme removes the redundancy of buffered data. We present a performance evaluation and features analysis by the simulations using the ns-2. Global session management scheme has a less handover latency, propagation delay and signaling cost than the conventional methods. Multicast source based forwarding scheme can deliver buffer data without loss and it has less buffer size than conventional method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.522-525
• /
• 2006

Recently, mobile devices support multi-functions such as 3D game, wireless internet, moving pictures, DMB, GPS, and PMP. Bigger size of display device is indispensable to support these functions and higher speed of the interface is needed. However, conventional parallel interfaces between processor and display nodule are not competent enough for that high speed transfers. High-speed serial interface is beginning to appear as an alternative for parallel interface. The advantages of the serial interface are high bandwidth, small number of interconnections, low-power consumption, and good quality of electro-magnetic interference. In this paper, we implement serial interface and use it for a display module. LVDS is used for PHY layer and a defined packet is used for link layer. The feature of the implemented serial interface is the reduced number of interconnections with enough bandwidth.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.520-534
• /
• 2003

In this paper, a performance evaluation model of the Fat-tree Network with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the switch network. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Two important parameters of the network performance, throughput and delay, are then evaluated. The proposed model takes simple and primitive switch networks, i.e., no flow control and drop packet, to demonstrate analysis procedures clearly. It, however, can not only be applied to any other complicate modern switch networks that have intelligent flow control but also estimate the performance of any size networks with multiple-buffered switches. To validate the proposed analysis model, the simulation is carried out on the various sizes of Fat-tree networks that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.6
• /
• pp.179-188
• /
• 2014

Due to the tremendous amount and its rapid increase of network traffic, the performance of network equipments are becoming an important issue. Network filtering is one of primary functions affecting the performance of the network equipment such as a firewall or a load balancer to process the packet. In this paper, we propose a cache based tri method to improve the performance of the existing tri method of searching for network filtering. When several packets are exchanged at a time between a server and a client, the tri method repeats the same search procedure for network filtering. However, the proposed method can avoid unnecessary repetition of search procedure by exploiting cache so that the performance of network filtering can be improved. We performed network filtering experiments for the existing method and the proposed method. Experimental results showed that the proposed method could process more packets up to 790,000 per second than the existing method. When the size of cache list is 11, the proposed method showed the most outstanding performance improvement (18.08%) with respect to memory usage increase (7.75%).