• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.535-544
• /
• 2012

Multi-Input Multi-Output (MIMO) transmission is now considered as one of essential techniques enabling high rate data transmissions in wireless communication systems. In addition, severe channel impairments in wireless systems should be compensated by using highly efficient forward error correction (FEC) codes. Turbo codes or low density parity check (LDPC) codes, using iterative decoding with soft decision detection information (SDDI), are the most common examples. The excellent performance of these codes should be conditioned on accurate estimation of SDDI from the MIMO detection process. In this paper, we propose a soft MIMO detection scheme using QR decomposition of channel matrices as an efficient means to provide accurate SDDI to the iterative decoder. The proposed method employed a two sequential soft MIMO detection process in order to reduce computational complexity. Compared to the soft ZF method calculating the direct inverse of the channel matrix, the complexity of the proposed method can be further reduced as the number of antennas is increased, without any performance degradation.

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

When the IEEE 802.11 wireless LAN-based broadcasting services, we use broadcast packets to broadcast multimedia contents to a large number of users using limited wireless resources. However, broadcast transmission is difficult to recover the loss packets compared with unicast transmission. Therefore, analysis of packet loss characteristics is required to perform efficient packet recovery. The packet loss in wireless transmissions is often bursty with high loss data rate. Even if loss patterns have the same average packet loss, they are different in the recovery rate of random loss and burst loss depending on the nature. Therefore, the analysis and research of the nature of the loss are needed to recover loss packets considering bursty characteristics. In this paper, we experimented Wi-Fi broadcast transmission according to transmission rate and analyzed bursty characteristics of loss patterns using 4-state markov model.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.103-113
• /
• 2010

In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.925-928
• /
• 2010

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with highest residual energy send data to base station. Furthermore, we can save the energy of head nodes using modes selection method. The simulation results show that CPMS achieves longer lifetime and more data messages transmissions than current important clustering protocol in wireless sensor networks.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.966-975
• /
• 2017

In Internet of Things (IoT), the aim of the nodes (called 'Things') is to exchange information with each other, whereby they gather and share information with each other through self decision-making. Therefore, we cannot apply existing aggregation algorithms of Wireless sensor networks that aim to transmit information to only a sink node or a central server, directly to the IoT environment. In addition, since existing algorithms aggregate information from all sensor nodes, problems can arise including an increasing number of transmissions and increasing transmission delay and energy consumption. In this paper, we propose the clustering and property based data exchange method for energy efficient information sharing. First, the proposed method assigns the properties of each node, including the sensing data and unique resource. The property determines whether the node can respond to the query requested from the other node. Second, a cluster network is constructed considering the location and energy consumption. Finally, the nodes communicate with each other efficiently using the properties. For the performance evaluation, TOSSIM was used to measure the network lifetime and average energy consumption.

• Journal of Internet of Things and Convergence
• /
• v.6 no.4
• /
• pp.15-19
• /
• 2020

In this paper, we propose a optimal CW(Conention Window) synchronization scheme in IEEE 802.11 WLANs. IEEE 802.11 WLANs support DCF(Distributed Coordination Function) mode for the MAC(Medium Access Control) operation. In DCF, the CW increases exponentially according to the collisions and becomes minimum CW according to the success of data transmissions. However, since the base minimum CW value is hardware or standard specific, the number of active stations and network status are not considered to determine the CW value. Even though the researches on optimal CW have beend conducted, they do not consider the optimal CW synchronization among mobile stations which occur network performance degradation. Therefore, this paper calculates the optimal CW value and shares it with mobile stations in the network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1434-1442
• /
• 2019

In this paper, the channel change was continuously measured for 24 hours from July 5, 2017 on the coast near Deokjeok-do, Incheon. The underwater channel has various channel environment characteristics as the change in the time axis and the change in the frequency axis occurs in real time, and the underwater communication performance decreases due to the multipath fading and the Doppler effect. Therefore, in this study, we performed the OFDM system performance analysis in the underwater channel environment by applying the repetitive transmission diversity scheme in the time and frequency domain to improve the communication performance in the real-world underwater communication environment. Using the collected data, we compared the channel environment in the time and frequency domain and analyzed the BER performance according to the pilot spacing and the number of repetitive transmissions in the time and frequency axis.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1256-1265
• /
• 2003

Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.347-354
• /
• 2001

This paper proposes and analyzes an error control scheme which tries to recover the transmission error within the deadline of a message on FDDI networks. The error control procedure does not interfere other normal message transmissions by delivering retransmission request via asynchronous traffic as well as by delivering retarnsmitted message via overallocated bandwidth which is inevitably produced by the bandwidth allocation scheme for hard real-time guarantee. The receiver counts the number of tokens which it meets, determines the completion of message transmission, and finally sends error report. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real-time network can be built at cost lower than, but performacne comparable to the dual link network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.219-226
• /
• 2012

In wireless sensor networks (WSNs), location-based multicast routing (LMR) technique can increase the network life time and the channel capacity by reducing the number of duplicated data transmissions and control messages. However, previous LMR techniques can suffer from significant performance degradation due to concrete walls or other interfering objects deployed in the real environment, since they transmit the packets by using only the locations of the sensor nodes. To solve this problem, we propose an interference-aware location based multicast algorithm for WSNs. In the proposed algorithm, each node adjusts the energy cost for each link adaptively considering the interference effect and uses it for multicast decision in order to minimize the interference impact. Experimental results show that the proposed algorithm improves the delivery and energy performance when the network is affected by interference.