• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.113-119
• /
• 2008

Conventional 1-1-1 cooperative protocol offers path-loss gain as advantage of multi-hop and spatial diversity which is equivalent to MIMO system. This protocol is enable to get higher reliability and reduction of power consumption than those of the single-hop or multi-hop. But the 1-1-1 cooperative protocol get only the diversity order 2 and limited path-loss reduction gain because this protocol has a single cooperative relay. We propose 1-2-1 cooperative protocol using two cooperative relays R1, R2. The 1-2-1 cooperative protocol can improve path-loss reduction and increase diversity order 3. Moreover, the cooperative relay R2 attains diversity order 2. The signaling method in transmission uses DF (Decode and Forward) or DR (Decode and Reencode) and 1-2-1 DF/DR cooperative protocol are applied to clustering based wireless sensor networks (WSNs). Simulations are performed to evaluate the performance of the protocols under Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1304-1314
• /
• 1993

During the last several years, the demand of mobile communication is increasing rapidly due to the convenience of usage. Therefore, the evoluation scenario toward the new cellular network is needed. In this paper, the future prospect of cellular network is considered, and movable-boundary TDMA/BTMA protocol is proposed as a new voice/data integrated multiple access protocol for the future cellular packet radio networks. Then, the performance of movable-bounary TDMA/BTMA protocol is analyzed and compared with that of PRMA protocol by computer simulation. In the proposed movable-boundary TDMA/BTMA protocol, the voice traffic sensitive to delay time is served by TDMA protocol and the data traffic sensitive to loss is served by BTMA protocol. Also, the boundary of voice and data can be moved adaptively by usign SYN character, control byte, voice call counter, ect. Therefore. it could be seen that the performance of movable-boundary TDMA/BTMA protocol is better than that of PRMA protocol with respect to delay and throughput.

• Journal of electromagnetic engineering and science
• /
• v.9 no.2
• /
• pp.66-70
• /
• 2009

The decode-and-forward cooperative communication protocol allows single-antenna users in wireless environments to obtain the powerful benefits of multi-antenna systems without the need for physical arrays. Evaluating the performance of this protocol through simulations is time-consuming and therefore, a need exists for an analytical BER expression to serve as a reference. This paper proposed such an expression for coherently BPSK-modulated data.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.485-488
• /
• 2003

This paper has been studied on an IPv6 Protocol for Embedded Systems such as Informational Appliances and Mobile Terminals. IPv6 Protocol has 128-bit IP address space. Therefore, all devices come to have a chance of acquiring IPv6 address. This IPv6 Protocol Stack is very compact and reliable because the larger of the stack is Embedded Systems, which have typically characteristics of low cost and low performance. Hence, we designed and implemented this Stack for This Embedded Systems.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.3
• /
• pp.271-276
• /
• 2016

Cooperative networks enhance the overall communication performance by combining signals from relay nodes and direct signal. In this paper, we analyze the performance of cooperative communication systems which use mixed relaying protocols. By assuming several relay nodes exist between the source node and destination node, we consider the systems use not a single relaying protocol but both decode-and-forward and amplify-and-forward protocols randomly. We analyze the effect of each relying protocol for the overall system performance, and also consider the performance depending on the relay location. Differential modulation scheme which demodulates signal without channel state information is adopted where it can be applicable fast varying channel such as railway environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.124-131
• /
• 2009

Cognitive radio has been proposed to mitigate the spectrum scarcity problem by allowing the secondary users to access the under-utilized frequency bands and opportunistically transmit. Spectrum sensing, as a key technology in cognitive radio, is required to reliably detect the presence of primary users to avoid the harmful interference. However, it would be very hard to reliably detect the presence of primary users due to the channel fading, shadowing. In this paper, we proposed a distributed cooperative spectrum sensing scheme based on conventional DF (decode-and-forward) cooperative diversity protocol. We fist consider the cooperation between two secondary users to illustrate that cooperation among secondary users can obviously increase the detection performance. We then compare the performance of DF based scheme with another conventional AF (amplify-and-forward) protocol based scheme. And it is found that the proposed scheme based on DF has a better detection performance than the one based on AF. After that, we extend the number of cooperative secondary users, and demonstrate that increasing the cooperation number can significantly improve the detection performance.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.39-44
• /
• 2002

In this paper, in order to improve the performance of TCP short traffic application services in wireless Internet environments, the Split-ACKs (SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless lints results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end Performance degradation of TCP. In this paper, to alleviate the TCP Performance, the SPACK method, split acknowledgement Packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analysed and shows better performance than traditional TCP Protocol.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2218-2224
• /
• 2016

Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.149-165
• /
• 2013

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.687-689
• /
• 2004

As using of network increases rapidly, performance of system has been deteriorating because of the overhead and bottleneck. Nowadays, High speed I/O network standard, that is a sort of PCI Express, HyperTransport, InfiniBand, and so on, has come out to improve the limites of traditional I/O bus. The InfiniBand Architecture(IBA) provides some protocols to service the applications such as SDP, SRP and IPoIB. In our paper, We explain the architecture of IPoIB (IP over InfiniBand) and its features in channel based I/O network. And so we provide a performance evaluation result of IPoIB which is compared with current network protocol. Our experimental results also show that IPoIB is batter than TCP/IP protocol. For this test, We use the dual processor server systems and Linux Redhat 9.0 operating system.