• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.131-134
• /
• 2009

The MOST network, which is a network for vehicle infotainment network, requires efficient channel allocation to provide multimedia service effectively. Though there is a study on channel allocation according to network traffic as studies on channel allocation for MOST network, there have scarcely been studies on channel allocation according to bandwidth of multimedia for transferring. Therefore, in this paper, we propose the channel allocation method which calculates the number of channels by analyzing multimedia data for transferring and assigns the optimal number of channels for the given data. The proposed method reduces wasting of channels by optimally allocating channels and prevents initializing network due to change of Boundary Descriptor.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.1
• /
• pp.105-113
• /
• 2017

Network externality can be defined as the effect that one user of a good or service has on the value of that product to other people. When a network externality is present, the value of a product or service is dependent on the number of others using it. There exist asymmetries in network externalities between the online and traditional offline marketing channels. Technological capabilities such as interactivity and real-time communications enable the creation of virtual communities. These user communities generate significant direct as well as indirect network externalities by creating added value through user ratings, reviews and feedback, which contributes to eliminate consumers' concern for buying products without the experience of 'touch and feel'. The offline channel offers much less scope for such community building, and consequently, almost no possibility for the creation of network externality. In this study, we analyze the effect of network externality on the competition between online and conventional offline marketing channels using game theory. To do this, we first set up a two-period game model to represent the competition between online and offline marketing channels under network externalities. Numerical analysis of the Nash equilibrium solutions of the game showed that the pricing strategies of online and offline channels heavily depend not only on the strength of network externality but on the relative efficiency of online channel. When the relative efficiency of online channel is high, the online channel can greatly benefit by the network externality. On the other hand, if the relative efficiency of online channel is low, the online channel may not benefit at all by the network externality.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.863-870
• /
• 2010

In recent years, the development of multimedia devices has meant that a wider multimedia streaming service can be supported, and there are now many ways in which TV channels can communicate with different terminals. Generally, scalable video streaming is known to provide more efficient channel capacity than simulcast video streaming. Simulcast video streaming requires a large network bandwidth for all resolutions, but scalable video streaming needs only one flow for all resolutions. In previous research, scalable video streaming has been compared with simulcast video streaming for network channel capacity, in two user simulation environments. The simulation results show that the channel capacity of SVC is 16% to 20% smaller than AVC, but scalable video streaming is not efficient because of the limit of the present network framework. In this paper, we propose a new network framework with an SVC extractor. The proposed network framework shows a channel capacity 50% (maximum) lower than that found in previous research studies.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.48-54
• /
• 2021

Security is an important issue for wireless communications and poses many challenges. Most security schemes have been applied to the upper layers of communications networks. Since in a typical wireless communication, transmission of data is over the air, third party receiver(s) may have easy access to the transmitted data. This work examines a new security technique at the physical layer for the sake of enhancing the protection of wireless communications against eavesdroppers. We examine the issue of secret communication through Rayleigh fading channel in the presence of an eavesdropper in which the transmitter knows the channel state information of both the main and eavesdropper channel. Then, we analyze the capacity of the main channel and eavesdropper channel we also analyze for the symbol error rate of the main channel, and the outage probability is obtained for the main transmission. This work elucidate that the proposed security technique can safely complement other Security approaches implemented in the upper layers of the communication network. Lastly, we implement the results in Mat lab

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.1
• /
• pp.13-20
• /
• 2005

This paper addresses a new blind channel equalization method using fourth-order cumulants of channel inputs and a three-layer neural network equalizer. The proposed algorithm is robust with respect to the existence of heavy Gaussian noise in a channel and does not require the minimum-phase characteristic of the channel. The transmitted signals at the receiver are over-sampled to ensure the channel described by a full-column rank matrix. It changes a single-input/single-output (SISO) finite-impulse response (FIR) channel to a single-input/multi-output (SIMO) channel. Based on the properties of the fourth-order cumulants of the over-sampled channel inputs, the iterative algorithm is derived to estimate the deconvolution matrix which makes the overall transfer matrix transparent, i.e., it can be reduced to the identity matrix by simple recordering and scaling. By using this estimated deconvolution matrix, which is the inverse of the over-sampled unknown channel, a three-layer neural network equalizer is implemented at the receiver. In simulation studies, the stochastic version of the proposed algorithm is tested with three-ray multi-path channels for on-line operation, and its performance is compared with a method based on conventional second-order statistics. Relatively good results, withe fast convergence speed, are achieved, even when the transmitted symbols are significantly corrupted with Gaussian noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.1008-1018
• /
• 1996

For assigning channel in a cellular sireless network, we purpose satisfying constraints with a related probability between cells and channels on the channel interference matrix formed by m terminals and n channels. And we purpose to get efficient channel assigning to limited channels in a wireless cell using parallelism of neural networks. In this paper, we solve the problem according to the number of requeirements when channel change with 11-533 procession elements. We demonstrate efficiency of proposed algorithm through same simulations in a specific time period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6B
• /
• pp.358-366
• /
• 2007

Recently, FCC(Federal Communications Commission) has considered for that unlicensed device leases licensed devices' channel to overcome shortage of communication channels. Therefore, IEEE 802.22 WRAN(Wireless Regional Area Networks) working group progresses CR (Cognitive Radio) technique that is able to sense and adopt void channels that are not being occupied by the licensed devices. Channel selection is of the utmost importance because it can affect the whole system performance in CR network. Thus, we propose a policy-based dynamic channel selection architecture for cognitive radio network to achieve an efficient communication. We propose three kinds of method for channel selection; the first one is weighted channel selection, the second one is sequential channel selection, and the last one is combined channel selection. We can obtain the optimum channel list and allocates channels dynamically using the proposed protocol.

• International Journal of Computer Science & Network Security
• /
• v.22 no.11
• /
• pp.241-247
• /
• 2022

Ad hoc network is self-organized network powered by battery. The reliability of virtual user identification and channel security are reduced when SNR is low due to limited user energy. In order to solve this problem, a joint virtual user identification and channel security en/decoding method is proposed in this paper. Transmitter-receiver-based virtual user identification code is generated by executing XOR operation between orthogonal address code of transmitter and pseudo random address code of receiver and encrypted by channel security code to acquire orthogonal random security sequence so as to improve channel security. In order to spread spectrum as well as improve transmission efficiency, data packet is divided into 6-bit symbols, each symbol is mapped with an orthogonal random security sequence. Subspace-based method is adopted by receiver to process received signal firstly, and then a judgment model is established to identify virtual users according to the previous processing results. Simulation results indicate that the proposed method obtains 1.6dB E_b/N₀ gains compared with reference methods when miss alarm rate reaches 10^-3.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.784-789
• /
• 2007

This paper presents an implementation of a new type of architecture to improve an overflow problem on the network buffer. Each receiver channel of network system stores the message in its own buffer. If some receiver channel receives many messages, buffer overflow problem may occur for the channel. This paper proposes a network controller that implements a receiver channel with shared-memory to save all of the received messages from the every incomming channels. The proposed architecture is applied to ARINC-429, a real-time control network for commercial avionics system. For verifying performance of the architecture, ARINC-429 controller is designed using a SOPC platform, designed by Verilog and targeted to Xilinx Virtex-4 with a built-in PPC405 core.