• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.369-379
• /
• 2006

In recent years, there have been many researches about Ad-hoc Networks which is available to communicate freely between mobile devices by using multi-hop without any support of relay base or access point. TCP that used the most widely transport protocol in the Internet repeats packet loss and retransmission because it increases congestion window size by using reactive congestion control until packet loss occurs. As a result of this, energy of mobile device is wasted unnecessarily. In this paper, we propose TCP-New Veno in order to improve the energy efficiency of mobile device. According to the state of network, the scheme adjusts appropriate size of congestion window. Therefore, the energy efficiency of mobile device and utilization of bandwidth are improved by the scheme. From the simulation by using ns-2, we could see more improved energy efficiency with TCP-New Veno than those with TCP in Ad-hoc Networks.

• Convergence Security Journal
• /
• v.8 no.3
• /
• pp.73-81
• /
• 2008

We can find easily about researches or technical development that deal with grasping the location of an object with GPS(Global Positioning System) in order to use them as a useful information. Most researches or technical development on application of tracing have been developed for the purpose of tracing objects in broad area as physical distribution or transportation, but recently, there are many researches on tracing materials in premise area as a fork lift, carts, or the equipment of work. In general, a system that utilizes location information of objects needs data communication network to transmit location data and it ensures data communication network by using common networks(SK, LG, KFT) or wireless LAN. However these two methods need monthly payment for the rental fee or require considerable amount of investment for the early stage so it is difficult to use them merely for tracing premise subjects. This study was conducted to build a tracing system for premise area by local area RF relay algorithm with low cost applying RF relay algorithm to local area wireless communication(ZIGBEE, 424MHz, Bluetooth, 900MHz) system in order to supplement these demerits and included relay algorithm, RF locating information terminal, local area RF gab-fillers, a plan for collection server of locating information, and the way of realization as they are needed in this system. I consider that this study would be applicable with flexibility in the industry area that needs tracing solution within a specific area or needs ensuring data communication network, to transmit data in ubiquitous environment, by easier and more rapid way with lower cost.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.1
• /
• pp.86-94
• /
• 2013

In this paper, we propose a network coding scheme that is one of the most promising techniques for overcoming transmission errors in underwater acoustic communications. It is assumed that the proposed scheme operates in a Code Division Multiple Access (CDMA) network where multiple sensor nodes share the underwater acoustic channel in both the frequency and the time domains by means of orthogonal codes. The network topology deploys multi-hop transmission with relaying between multiple source nodes and one destination node via multiple relay nodes. The proposed scheme is evaluated in terms of the successful packet delivery ratio of end-to-end transactions under varying packet loss rates. A computer simulation shows that the successful delivery ratio is maintained at over 95% even when the packet loss rate reaches 50%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3312-3334
• /
• 2015

In this paper, a mechanism for spectrum allocation in overlay cognitive radio networks is proposed. In overlay cognitive radio networks, the secondary users (SUs) must first sense the activity of primary users (PUs) to identify unoccupied spectrum bands. Based on their different contributions for the spectrum sensing, the SUs get payoffs that are computed by the fusion center (FC). The unoccupied bands will be auctioned and SUs are asked to bid using payoffs they earned or saved. Coalitions are allowed to form among SUs because each SU may only need a portion of the bands. We formulate the coalition forming process as a coalition forming game and analyze it by game theory. In the coalition formation game, debtor-creditor relationship may occur among the SUs because of their limited payoff storage. A debtor asks a creditor for payoff help, and in return provides the creditor with a portion of transmission time to relay data for the creditor. The negotiations between debtors and creditors can be modeled as a Bayesian game because they lack complete information of each other, and the equilibria of the game is investigated. Theoretical analysis and numerical results show that the proposed auction yields data rate improvement and certain fairness among all SUs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.403-411
• /
• 2011

This paper addresses a cooperative transmission scheme based on Alamouti coding for cognitive radio networks over frequency selective fading channels. In the proposed scheme, the Alamouti coded form at the destination node is constructed through a simple combination of symbols at the source node, instead of the time-reversal operation and the conjugate operation at the relay nodes used in the conventional scheme. Numerical results show that the proposed scheme achieves a higher order cooperative diversity than that of the conventional scheme.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.313-318
• /
• 2011

When wireless channels undergo fast fading, non-coherent frequency shift keying (FSK) (de)modulation schemes may be considered for amplify-and-forward (AF) cooperative communications. In this paper, we derive the bit-error-rate performance of partial non-coherent receiver as a lower bound of the optimal non-coherent receiver for FSK modulated AF cooperative communications. From the simulation and analytical results, it is found that the derived lower bound is very closed to simulation results. This result shows that knowing partial channel state information may not improve system performance significantly. On the other hand, conventional optimal non-coherent receiver involves complicated integration operation. To address the above complexity issue, we also propose a near optimal non-coherent receiver which does not involve integration operation. Simulation results have shown that the performance gap between the proposed near optimal receiver and the optimal receiver is small.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.1-9
• /
• 2010

This paper offers performance analysis of selection decode and forward (DF) networks with differential modulation/demodulation for an arbitrary number of relays in independent but not identically distributed Rayleigh fading channels. We have shown that the selection DF protocol with differential modulation can achieve full diversity in both independent identically distributed (i.i.d.) and independent but not identically distributed (i.n.d.) Rayleigh fading channels, and the performance loss due to using non-coherent detection is not substantial. Furthermore, we study the impact of combining techniques on the performance of the system by comparing a system that uses selection combining (SC) to one that uses maximum ratio combining (MRC). Simulations are performed and show that they match exactly with analytic ones in high SNR regime.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.926-940
• /
• 2018

In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

• Journal of Integrative Natural Science
• /
• v.11 no.4
• /
• pp.197-203
• /
• 2018

Long Term Evolution-Advanced (LTE-A) is the next drive in the broadband mobile communication, which allows operators to improve networks performance and service capabilities. LTE-A targets the peak data rates of 1Gbps in the downlink and 500Mbps in the uplink. This requirement is only fulfilled by a transmission bandwidth of up to 100MHz. However the accessibility of such large part of the contiguous spectrum is uncommon in practice. Therefore LTE-A uses some new features on top of the existing LTE standards to provide very high data rate transmission. Some of the most significant features introduced in LTE-A are carrier aggregation, heterogeneous network enhancement, coordinated multipoint transmission and reception, enhanced multiple input and multiple output, and development relay nodes with universal frequency reuse. This review paper presents an overview of the above mentioned LTE-A key features and functionalities. Based on this review, in the conclusion we discuss the current technical challenges for future broadband mobile communication systems.