• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1279-1300
• /
• 2017

In the interweave cognitive networks, the interference from the primary user degrades the performance of the cognitive user transmissions. In this paper, we propose an adaptive cooperation scheme in the interweave cognitive networks to improve the performance of the cognitive user transmissions. In the proposed scheme for the bidirectional communication of two end-source cognitive users, the bidirectional communication is completed through the non-relay direct transmission, the one-way relaying cooperation transmission, and the two-way relaying cooperation transmission depending on the limited feedback from the end-sources. For the performance analysis of the proposed scheme, we derive the outage probability and the finite-SNR diversity multiplexing tradeoff (f-DMT) in a closed form, considering the imperfect spectrum sensing, the interference from the primary user, and the power allocation between the relay and the end-sources. The results show that compared with the direct transmissions (DT), the pure one-way relaying transmissions (POWRT), and the pure two-way relaying transmissions (PTWRT), the proposed scheme has better outage performance. In terms of the f-DMT, the proposed scheme outperforms the full cooperation transmissions of the POWRT and PTWRT.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.4
• /
• pp.272-277
• /
• 2013

In this paper the effect of instability and chaos in optical fiber networks based on the Internet is described. Nonlinear optical fiber effect especially Brillouin scattering in networks has emerged as the essential means for the construction of active optical devices used for all-optic in-line switching, channel selection, amplification, oscillation in optical communications and a host of other applications. The inherent optical feedback by the back-scattered Stokes wave in optical networks also leads to instabilities in the form of optical chaos. This paradigm of optical chaos in fiber Internet serves as a test for fundamental study of chaos and its suppression and exploitation in practical application in optical fiber communication. This paper attempts to present a survey and some of our research findings on the nature of Brillouin chaotic effect on Internet based optical communication.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.300-304
• /
• 2007

Wireless sensor networks represent a new and exciting communication paradigm which could have multiple applications in future wireless communication. Therefore, performance analysis of such a wireless sensor network paradigm is needed in complex wireless channel. Wireless networks could be an important means of providing ubiquitous communication in the future. In this paper, the BER performance of uniform distributed wireless sensor networks is evaluated in non-Gaussian noise channel. Using an analytical approach, the impact of Av. BER performance relating the coherent BPSK system at the end of a multi-hop route versus the spatial density of sensor nodes and impulsive noise parameters A and $\Gamma$ is evaluated.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.64 no.2
• /
• pp.50-56
• /
• 2015

This paper presents a smart monitoring technique for photovoltaic power systems by using wire and wireless communication networks in which the RS-232/484 and the Zigbee communication networks are inherently established respectively. In the proposed monitoring systems, environmental data sequences and the output power measured by sensors in photovoltaic systems are transferred to PC systems via two communication networks. We made electronic hardware boards for sensors and communication networks to construct its real-time monitoring system and carry out experiments for demonstrating reliability of the proposed monitoring system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5035-5048
• /
• 2016

Nano scale networks are futuristic networks deemed as enablers for the Internet of Nano Things, Body area nano networks, target tracking, anomaly/ abnormality detection at molecular level and neuronal therapy / drug delivery applications. Molecular communication is considered the most compatible communication technology for nano devices. However, connectivity in such networks is very low due to inter-symbol interference (ISI). Few research papers have addressed the issue of ISI mitigation in molecular communication. However, many of these methods are not adaptive to dynamic environmental conditions. This paper presents an enhancement over original Memory-1 ISI cancellation scheme using maximum likelihood estimation of a channel parameter (λ) to make it adaptable to variable channel conditions. Results of the Monte Carlo simulation show that, the connectivity (P_conn) improves by 28% for given simulation parameters and environmental conditions by using enhanced Memory-1 cancellation method. Moreover, this ISI mitigation method allows reduction in symbol time (Ts) up to 50 seconds i.e. an improvement of 75% is achieved.

• Annual Conference of KIPS
• /
• 2015.04a
• /
• pp.212-213
• /
• 2015

Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. On constructing a robust algorithm for minimizing data aggregation delay in wireless sensor networks, we consider limited transmission range sensors and approximate the minimum-delay data aggregation tree which can only be built in networks of unlimited transmission range sensors. The paper proposes an adaptive method that can be applied to maintain the network structure in case of a sensor node fails. The data aggregation tree built by the proposed scheme is therefore self-healing and robust. Intensive simulations are carried out and the results show that the scheme could adapt well to network topology changes compared with other approaches.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.161-169
• /
• 2002

Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

• Proceedings of the Korean Magnestics Society Conference
• /
• 2008.12a
• /
• pp.314.1-314.1
• /
• 2008

• ETRI Journal
• /
• v.29 no.4
• /
• pp.524-526
• /
• 2007

In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.856-858
• /
• 2008

Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.