• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.1-6
• /
• 2019

Multicast is an efficient method for real-time transmission in many multimedia applications. It is important to recover lost packets and to manage multicast groups according to the network status in order to improve the reliability of multicast transmissions. In this paper, we propose a method that can efficiently recover lost packets in a large multicast group. In the proposed method, we create a recovery cluster (RC) using a multicast domain (MD) for recovery of lost packets. In the conventional methods, clusters send a request message for lost packets to the senders in order to recover the packets lost from many multicast applications. This increases packet delay time and overhead because of the feedback messages and retransmitted packets. In the proposed method, we improve these problems using the RC, which consists of many MDs (which have overlay multicast senders), and many cluster heads (CHs). We divide the message into blocks, and divide each block into many segments for packet recovery using the CHs. When packet loss occurs, all CHs share the segment information and recover the lost segments at the same time. Simulation results show that the proposed method could improve the packet recovery ratio by about 50% compared to the conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.37-44
• /
• 2009

In this paper, we propose an efficient method which improves the performance of transmission of PGA which is essential data for real-time earthquake monitoring system. Currently, above 120 earthquake stations were installed nationwide and additional installation is expected because the social interesting of earthquake hazard is rising. Real-time earthquake monitoring system checks earthquake occurrence by using PGA were calculated from acceleration data of each seismic station. An efficient method of PGA data transmission is key factor of real-time monitoring. The key idea of proposed method is to deal with each seismic station using an unique ID, to assign one bit to indicate whether a packet include a station's data or not. Proposed method can contain more station data and decrease the data loss compared to current method. To verify proposed method, we investigate the turnaround time and ratio of data loss using above 91000 packets. As results of experiment. the proposed method is proven that the method need more time about 50% but reduce the data loss about 87% as compared to previous method.

• Journal of IKEEE
• /
• v.13 no.4
• /
• pp.29-36
• /
• 2009

The packet loss and the disconnection during handoff are the most critical problems which degrade the video quality in wireless video streaming. To cope with these problems, we propose an efficient video streaming method in this paper, which does not only dynamically adjust the video transmission rate based on the raptor forward error correction (FEC) level, but also minimize the error propagation during handoff. Firstly, the channel bandwidth of the wireless broadband internet, called WiBro, is estimated by analyzing channel parameters including the carrier to interference and noise ratio (CINR) and the handoff. Secondly, the streaming server adjusts the next transmission rate according to the estimated channel bandwidth and the raptor FEC level to avoid packet error. Also, the encoder performs the intra refresh method that inserts an intra frame (I-frame) right after handoff to reduce the error propagation effectively. Experimental results indicate that the proposed method can improve the performance of the video streaming over WiBro network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.717-724
• /
• 2005

In this paper, we Propose an efficient scheduler well suited for the next-generation wireless networks that can support multimedia traffic having various requirements. The scheduler is designed to provide each of multimedia classes with differentiated services. In particular, the scheduler is intended to maximize throughput and minimize packet loss ratio. To apply the scheduler, we suppose that the wireless network is based on TDD/CDMA system The scheduler assigns a packet in a dedicated uplink-slot to the user within a frame to operate scheduling of packets transmitted by the users belonging to the specific class in an efficient manner. Such a manner also enables the scheduler to meet different QoS requirements. The paper also includes performance comparison with other schemes and analysis of the proposed scheduling algorithm by using simulation. We also analyze the proposed scheme by using simulation. The simulation compares the proposed scheduling algerian with previously proposed schemes in terms of the performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.1009-1016
• /
• 2015

In this paper, we propose EPCM(Efficient Prediction-based Context-awareness Matrix) algorithm analyzing connectivity by predicting cluster's context data such as velocity and direction. In the existing DTN, unrestricted relay node selection causes an increase of delay and packet loss. The overhead is occurred by limited storage and capability. Therefore, we propose the EPCM algorithm analyzing predicted context data using context matrix and adaptive revision weight, and selecting relay node by considering connectivity between cluster and base station. The proposed algorithm saves context data to the context matrix and analyzes context according to variation and predicts context data after revision from adaptive revision weight. From the simulation results, the EPCM algorithm provides the high packet delivery ratio by selecting relay node according to predicted context data matrix.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.108-110
• /
• 2015

In this paper, we proposed the relay node selection scheme using property of node such as velocity, direction in Delay Tolerant Networks. the existing selection scheme is caused the problem increasing the transmission delay and packet loss, if select the relay node for different mobile with destination. To overcome this problem, we proposed the relay node selection scheme using the property of mobile node. the proposed scheme represents and shares the property of mobile node. The proposed algorithm assumed the sketchy position of node from mobile node delivering property of destination. In addition, the propose algorithm recognizes and analyzes the context of mobile node to provide the relay node transferring the data efficiently. The simulation result provides the better result in terms of transmission delay and packet delivery ratio by selecting transmission by relay node according property of node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2964-2985
• /
• 2019

Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1679-1686
• /
• 2019

The main purpose of this research is to propose an approach for solving the packet loss problem by quickly adapting to topology change when nodes move in RPL-based IoT environment. In order to enhance mobility, every node is aware of the mobility of its neighbor nodes and quantifies the mobility level based on the number of control messages and all received packets. According to the mobility level, the DIO timer is changed. The proposed approach allows nodes to change their DIO timers according to their mobility levels to adapt topology changes and update paths to the sink. The performance of the proposed approach is evaluated using a Contiki-based Cooja simulator in various moving speeds. The simulation results show that the proposed approach copes with mobility scenarios better than the standard RPL by ascertaining that the packet delivery ratio is improved by 31.03%.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.5
• /
• pp.104-112
• /
• 2017

The CRE (Cell Range Expansion) that selects the small cell with more efficient uplink resources has been developed by 3GPP to relieve the problem of the traffic imbalance due to the power differences between macro and small cells in HetNet. In addition, ABS (Almost Blank Subframes) has been proposed to resolve the signal interference problem due to the operation CREs. This paper proposes an effective method to calculate the ABS ratio by considering the proportion of the number of UEs in CRE and macro cell ranges, as well as the number of small cells in a macro cell. The proposed method has been implemented on the LTESim simulator, and compared with previously proposed methods. The experimental results show that the proposed method can improve the throughput and packet loss ratio performances. In particular, it is also shown that CRE bias values affect those performances, and there exist effective CRE bias values to derive the best performances.