• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.4
• /
• pp.295-301
• /
• 2020

When a spacecraft in deep space falls into an abnormal state, an emergency communication channel between ground and the spacecraft is essential in order to perform analysis to the cause of the anomaly, and to remedy the spacecraft from the distressed state. Because the recovery actions generally comprises of long and complicated sequences of commands, the transmission of the recovery commands may require a reliable and a delay tolerant networking technology based on bundle routing. While the delay tolerant networking protocol becomes a prominent method interfacing ground and space into a internet-like Solar system network because it can address the issues of the severe communication problems in deep space, the communication system on the spacecraft which based on space packet protocol cannot use the delay tolerant networking technology directly. So a community of the consultative committee for space data systems starts a discussion of the first-hop last-hop mechanism to establish a feasible concept and standardization. This paper presents an enhanced concept of the first-hop last-hop by applying it a virtual cislunar communication environment, and we believe this contributes to make a way applicable to an interoperable relay concept of the first hop last hop between the delay tolerant networking and space packet protocol standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1043-1049
• /
• 2009

Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1881-1886
• /
• 2016

In this paper, by using D2D communications that perform direct communications among devices within small transmission range of each device without base station, we assume that a device generates and transmits data packets to other proximate devices and the devices which receive the data packets relay those to other adjacent devices. To maximize the total number of devices which successfully receive data packets, Epidemic routing protocol is considered in this paper. In Epidemic routing protocol, all devices which received data packets try to relay the packets to other adjacent devices. We assume various network environment where devices are densely distributed in specific area(crowded area). In this environment, D2D SD can be a source node and D2D devices can be relay nodes. By setting transmission range of D2D SD and D2D devices as parameters, we analyze performance results of coverage probability of Epidemic routing protocol through intensive simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.657-667
• /
• 2012

In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.501-511
• /
• 1996

Typical integrated service digital network(ISDN) switching systems have several shortcomings including cumulated long call set-up delay and difficulty in higher speed packet communication. The problems come from the nature of X.25 packet swiching technique used in the systems. In this thesis, to solve the above problems, the use of frame relay service within the TDX-10 ISDN switching system is proposed and a frame handling susbsystem(FHS) is designed in order to support the high speed frame relay service in the TDX-10 switching systems. In the proposed TDX-10 architecture, the 64 Kbps packet communication can be executed more ef- ficiently and high speed packet communication is allowed. To measure theperformance characteristics of the proposed systemand to compare the performance with that of the proposed system is superior to that of the existion system and to compare the performance with that of the proposed system is superior to that of the existing system. The proposed switching system offers a seamless evolutionalry path from Narrowband-ISDNto Broadband-ISDNsince itallows anefficient channelutilization and speed packet communication.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.93-97
• /
• 2015

In this Paper, we proposed optimization of system performance, optimal splitting factor applied to power splitting protocol with relay in the cooperative communication undergo co-channel interference. We can possible to optimize and maximize the channel capacity of the receiver through optimal factor of splitting protocol. So, we can solve inability in system, and to increase the efficiency of the network. Finally, performance of the proposed protocol is analyzed in terms of outage probability, capacity of system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.12
• /
• pp.1803-1810
• /
• 2013

In a warehouse, because there exist frequent changes of stock status and the quality of some contents are influenced by the environment such as temperature, fast and accurate management of the warehouse's environment is very important for Warehouse Management Systems. However, due to the absence of a unified standard for the communication protocol between RFID nodes and centralized MAC schemes for RFID communications in previous studies have severe problems. Therefore, in this paper, we propose a WiMedia MAC based RFID cooperative relay transmission scheme for warehouse management system applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.748-766
• /
• 2013

In this paper, we consider an infrastructure-vehicle-vehicle (I2V2V) based Vehicle Ad-hoc Networks (VANETs), where one base station multicasts data to d vehicular users with the assistance of r vehicular users. A Distributed Luby Transform (DLT) codes based transmission scheme is proposed over lossy VANETs to reduce transmission latency. Furthermore, focusing on the degree distribution of DLT codes, a Modified Deconvolved Soliton Distribution (MDSD) is designed to further reduce the transmission latency and improve the transmission reliability. We investigate the network behavior of the transmission scheme with MDSD, called MDLT based scheme. Closed-form expressions of the transmission latency of the proposed schemes are derived. Performance simulation results show that DLT based scheme can reduce transmission latency significantly compared with traditional Automatic Repeat Request (ARQ) and Luby Transform (LT) codes based schemes. In contrast to DLT based scheme, the MDLT based scheme can further reduce transmission latency and improve FER performance substantially, when both the source-to-relay and relay-to-sink channels are erasure channels.

• Nuclear Engineering and Technology
• /
• v.52 no.7
• /
• pp.1587-1596
• /
• 2020

The location selection for nuclear power plants (NPP) is a strategic decision, which has significant impact operation of the plant and sustainable development of the region. Further, the ranking of the alternative locations and selection of the most suitable and efficient locations for NPPs is an important multi-criteria decision-making problem. In this paper, the non-sequential Monte Carlo probabilistic method and the Latin hypercube sampling probabilistic method are used to evaluate and select the optimal locations for NPP. These locations are identified by the power plant's onsite loads and the average of the lowest number of relay protection after the NPP's trip, based on electricity considerations. The results obtained from the proposed method indicate that in selecting the optimal location for an NPP after a power plant trip with the purpose of internal onsite loads of the power plant and the average of the lowest number of relay protection power system, on the IEEE RTS 24-bus system network given. This paper provides an effective and systematic study of the decision-making process for evaluating and selecting optimal locations for an NPP.