• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.539-548
• /
• 2011

We propose an efficient cooperative ARQ (Automatic Repeat reQuest) scheme for single-hop and multi-hop underwater acoustic communications, in which cooperative nodes are used to provide more reliable alternative paths for a specific source-to-destination connection. This alternative path has higher channel quality than that of the direct source-destination path. In addition, during a packet-relay through multiple hops, the typical acknowledgement (ACK) signal is replaced with overhearing data packet returned back from the next hop. The usage of overhearing as an ACK improves the system performance. In this paper, we evaluate the proposed scheme by comparing it with a conventional S&W ARQ in terms of throughput efficiency. Computer simulation results show that the proposed cooperative retransmission scheme can significantly improve the throughput by increasing the probability of successful retransmission.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.594-600
• /
• 2010

Many studies are DDoS in Internet network, but the study is the fact that is not enough in a voice network. Therefore, we designed the extended TRW algorithm that was a DDoS attack traffic detection algorithm for the voice network which used an IP data network to solve upper problems in this article and evaluated it. The algorithm that is proposed in this paper analyzes TRW algorithm to detect existing DDoS attack in Internet network and, design connection and end connection to apply to a voice network, define probability function to count this. For inspect the algorithm, Set a threshold and using NS-2 Simulator. We measured detection rate by an attack traffic type and detection time by attack speed. At the result of evaluation 4.3 seconds for detection when transmitted INVITE attack packets per 0.1 seconds and 89.6% performance because detected 13,453 packet with attack at 15,000 time when transmitted attack packet.

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

Lately, the MANET research has focused on providing routing services with security and previous schemes have been proposed for detecting malicious nodes in a MANET. However, they still include some problems which malicious nodes cannot be found when they falsely report other nodes as malicious. Accordingly, we propose a novel and efficient scheme for detecting malicious nodes using report messages and a report table which is consisted of node ID both for suspecting and reporting when the malicious nodes behave normally during the route discovery, but the other hand they drop and modify packets, or falsely report other nodes as malicious during the data transmission. Our proposed scheme is applicable to not only DSR but aiso AODV. And we provide some simulation results of our proposed scheme by comparing general AODV with our proposed scheme. Simulation results show that our Proposed scheme outperforms general AODV in terms of average packet loss ratio and packet delivery ratio.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.958-966
• /
• 2014

Wireless sensor networks offer a distributed processing environment. Many sensor nodes are deployed in fields that have limited resources such as computing power, network bandwidth, and electric power. The sensor nodes construct their own networks automatically, and the collected data are sent to the sink node. In these traditional wireless sensor networks, network congestion due to packet flooding through the networks shortens the network life time. Clustering or in-network technologies help reduce packet flooding in the networks. Many studies have been focused on saving energy in the sensor nodes because the limited available power leads to an important problem of extending the operation of sensor networks as long as possible. However, we focus on the execution time because clustering and local distributed processing already contribute to saving energy by local decision-making. In this paper, we present a cooperative processing model based on the processing timeline. Our processing model includes validation of the processing, prediction of the total execution time, and determination of the optimal number of processing nodes for distributed processing in wireless sensor networks. The experiments demonstrate the accuracy of the proposed model, and a case study shows that our model can be used for the distributed application.

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

SDN (Software Defined Network) technology, hardware and network control functions should be separated independently of existing switches or routers and data transfer functions and are also refers to a separate network architecture that can develop and run. When planning a network and designed to reflect the network control function by applying the SDN may reflect the resources efficiently. In this study, one people suggest Applications SDN, which offer an absolutely necessary part of a coded program that combines the benefits of the existing IOS (Combined Benefits) applying the model to complete the Controller part through the MPLS IOS. The OpenFlow Controller is a command to the router LER(Label Edge Router), and transmits the packet in accordance with the command to the destination according to the EXP bit. To configure TCP / IP to the IOS through the optimized coding. Using the OpenFlow protocol controller transmits an encapsulation header as defined in the MPLS packet.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1333-1340
• /
• 2015

IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.299-306
• /
• 2010

IPTV and VoIP services are considered as killer applications over Mobile WiMAX network, which provideshigh mobility and data rate. Among those which affect the quality of voice in those services, the jitter buffer or playout buffer can compensate the poor voice quality caused by the packet drop due to frequent route change or differences among routes between service endpoints. In this paper, we analyze the correlation between the sleep interval length and jitter buffer size in order to guarantee a predefined level of voice quality. For this purpose, we present an end-to-end delay model considering additional delay incurred by the WiMAX PSC-II sleep mode and a VoIP service quality requirement based on the delay constraints. Through extensive simulation experiments, we also show that the increase of jitter buffer size may degrade the voice quality since it can introduce additional packet drop in the jitter buffer under WiMAX power saving mode.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.1-16
• /
• 2012

Cost-effective mobility management for the roaming mobile users is very important in the seamless services on next-generation wireless network (NGWN). MIPv6 (Mobile IPv6) is one of the mobility management schemes proposed by the IETF (The Internet Engineering Task Force) and various IPv6-based mobility management schemes have been developed. They are directly involved with data transfer from MN (Mobile Node). In this paper, two kinds of schemes in analyzing of mobility management schemes are proposed. The signaling transfer and packet delivery procedures for each mobility management schemes are analyzed, respectively. The signaling cost for mobility management schemes are calculated, and the cost of each protocol are analyzed numerically. In other word, applying the sum of signaling cost and packet delivery cost to each mobility management scheme, their costs are analyzed. Finally, our performance evaluation results that the network-based mobility management scheme shows better performance in terms of overall cost.

• Journal of Advanced Navigation Technology
• /
• v.15 no.3
• /
• pp.386-391
• /
• 2011

CRU (contiguous resource unit) composed of adjacent OFDMA subcarriers is popularly adopted for recently developed cellular communication standards, e.g. IEEE 802.16e/m. If multiple CRUs having different SNR are assigned to a mobile station, and multiple packet streams are independently transmitted by using H-ARQ transmission, an achievable data rate can be varied according to the channel allocation method of re-transmission packets and new transmission packets. In this paper, the optimum channel allocation method for the above stated problem, and several sub-optimum channel allocation methods to reduce the computational complexity of the optimum allocation method are proposed. According to the simulation results, a sub-optimum allocation method assigning a CRU having good SNR to new transmission packet shows marginal performance loss compared with optimum method, however, the computational complexity can be significantly reduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1939-1946
• /
• 2012

USNs (Ubiquitous Sensor Networks) such as IEEE 802.15.4 ZigBee network share ISM (Industrial, Scientific, and Medical) frequency band with WiFi networks. Once both networks operate in a region, packet collision may happen because of frequency overlapping. To assure this possibility, we conducted experiments where WiFi and ZigBee communication networks had been installed in an area. As a result of the test, successful data transmission rate were reduced due to the frequency overlapping between a WiFi communication channel and a ZigBee communication band. To cope with this problem, we propose a collision avoidance algorithm. In the proposed algorithm, if frequency collision is sensed, new communication channel with different frequency band is allocated to each node. Performance of the proposed frequency collision avoidance algorithm was tested and the results were described.