• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.396-400
• /
• 2009

During periods of large data transmission, routing selection methods are used to efficiently manage data traffic and improve the speed of transmission. One approach in routing selection is AntNet that applies the Ant algorithm in transmissions with uniform probability. However, this approach uses random selection, which can cause excessive data transmission rates and fail to optimize data This paper presents the use of the Genetic Algorithm (GA) to efficiently route and disperse data transmissions, during periods with "unnecessary weight increases for random selection". This new algorithm for improved performance provides highly accurate estimates of the transmission time and the transmission error rate.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.9
• /
• pp.460-466
• /
• 2002

A reliable fault phase selection algorithm plays a very important role in transmission line protection, Particularly in Extra High Voltage (EHV) networks. The conventional fault phase selection algorithm used the phase difference between positive and negative sequence current excluding load current. But, it is difficult to pick out only fault current since we can not know when a fault occurs and select the fault phase in weak-infeed conditions that dominate zero-sequence current in phase current. The proposed algorithm can select the accurately fault phase using the sum of unit vectors which are calculated by positive-sequence voltage and negative-sequence voltage.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.22-24
• /
• 2001

This paper presents a fault phase selection algorithm for transmission line protection by means of the symmetrical components. Accurate fault phase selection is necessary for collect functioning of transmission line relaying, particularly in Extra High Voltage (EHV) networks. The conventional phase selection algorithm used the phase difference between positive and negative sequence current excluding load current. But, it is difficult to abstract only fault current since we can not know the time which a fault occurs. The proposed algorithm can select the accurately fault phase using fault current contained pre-fault current.

• Proceedings of the KIEE Conference
• /
• 2002.11b
• /
• pp.283-285
• /
• 2002

The paper describes a study of selection of existing a.c. Transmission facilities converted fur use with d.c. system. In order to increasing the power transfer capability of existing a.c. transmission facilities, d.c. is one of good alternatives. Some advantages and disadvantages of this method are discussed, and the selection method of existing transmission facilities for use with d.c. considering economics and stability is presented in this paper.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.240-249
• /
• 2011

Cooperative diversity protocols have attracted a great deal of attention since they are thought to be capable of providing diversity multiplexing tradeoff among single antenna wireless devices. In the high signal-to-noise ratio (SNR) region, cooperation is rarely required; hence, the spectral efficiency of the cooperative protocol can be improved by applying a proper cooperation selection technique. In this paper, we present a simple "cooperation selection" technique based on instantaneous channel measurement to improve the spectral efficiency of cooperative protocols. We show that the same instantaneous channel measurement can also be used for relay selection. In this paper two protocols are proposed-proactive and reactive; the selection of one of these protocols depends on whether the decision of cooperation selection is made before or after the transmission of the source. These protocols can successfully select cooperation along with the best relay from a set of available M relays. If the instantaneous source-to-destination channel is strong enough to support the system requirements, then the source simply transmits to the destination as a noncooperative direct transmission; otherwise, a cooperative transmission with the help of the selected best relay is chosen by the system. Analysis and simulation results show that these protocols can achieve higher order diversity with improved spectral efficiency, i.e., a higher diversity-multiplexing tradeoff in a slow-fading environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.760-768
• /
• 2009

In this paper, we propose the energy efficient transmission parameter selection method for Wireless Personal Area Network (WPAN) system which is applied to e-Navigation system considering various ship models environment. An appropriate selection of transmission parameters of HR-WPAN system is very essential to be considered for saving WPAN devices' energy consumption, when HR-WPAN system is applied to ship area network (SAN). Therefore, we propose an energy consumption model for a ship area network employing IEEE 802.15.3 based CSMA/CA HR-WPAN model and analyze the effect of transmission parameter selection on the performance of energy consumption. In particular, the path loss is the major performance decision parameter for the SAN employing HR-WPAN system, since it varies according to the material of shipbuilding such as steel(for large ship), FRP(for medium size ship) and compound wood(for small ship). Thus, we analyze and demonstrate that the proper transmission parameter selection of transmit power, PHY data rate and fragment size for each ship model could guarantee energy efficiency.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.473-481
• /
• 2007

Energy efficiency is one of the most critical concerns for wireless sensor networks. By allowing sensor nodes in close proximity to cooperate in transmission to form a virtual multiple-input multiple-output(MIMO) system, recent progress in wireless MIMO communications can be exploited to boost the system throughput, or equivalently reduce the energy consumption for the same throughput and BER target. However, these cooperative transmission strategies may incur additional energy cost and system overhead. In this paper, assuming that data collectors are equipped with antenna arrays and superior processing capability, energy efficiency of relevant traditional and cooperative transmission strategies: Single-input-multiple-output(SIMO), space-time block coding(STBC), and spatial multiplexing(SM) are studied. Analysis in the wideband regime reveals that, while receive diversity introduces significant improvement in both energy efficiency and spectral efficiency, further improvement due to the transmit diversity of STBC is limited, as opposed to the superiority of the SM scheme especially for non-trivial spectral efficiency. These observations are further confirmed in our analysis of more realistic systems with limited bandwidth, finite constellation sizes, and a target error rate. Based on this analysis, general guidelines are presented for optimal transmission strategy selection in system level and link level, aiming at minimum energy consumption while meeting different requirements. The proposed selection rules, especially those based on system-level metrics, are easy to implement for sensor applications. The framework provided here may also be readily extended to other scenarios or applications.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.433-441
• /
• 2010

Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3945-3964
• /
• 2015

Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.