• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.131-134
• /
• 2009

차량용 인포테인먼트 네트워크인 MOST에서 멀티미디어 서비스를 원활히 제공하기 위해 효율적인 채널할당이 요구된다. MOST 네트워크의 채널할당에 관한 연구로서 스트리밍데이터 전송을 효율적으로 하기 위한 네트워크의 부하에 따른 채널 할당에 관한 연구는 있으나 전송하고자 하는 데이터의 대역폭에 따라 채널의 할당을 결정하는 연구 사례는 없다. 따라서, 본 논문에서는 전송하고자 하는 멀티미디어 데이터를 분석한 후 최적의 요구채널을 산출하여 할당할 채널의 수를 결정하는 방안을 제안한다. 제안하는 방안을 토대로 MOST 네트워크의 데이터 영역에 채널을 할당 시 최적의 채널을 할당함으로써 채널의 낭비를 줄이고 Boundary Descriptor의 변경으로 인한 네트워크 초기화를 예방할 수 있다.

• 산업경영시스템학회지
• /
• 제40권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
• /
• 제32권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
• /
• 제21권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
• /
• 제5권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)
• /
• 제5권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.

• 한국통신학회논문지
• /
• 제21권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.

• 한국통신학회논문지
• /
• 제32권6B호
• /
• pp.358-366
• /
• 2007

최근 FCC(Federal Communications Commission)에서는 통신 채널의 부족을 극복하기 위해 기존의 허가된 사용자의 무선 주파수에 대한 비 허가 사용자의 사용을 고려하고 있다. 이에 채널을 실시간으로 감지하고 선택하는 CR의 개념이 도입되어 IEEE 802.22 WRAN(Wireless Regional Area Networks) 워킹 그룹에서 CR(Cognitive Radio)의 기술개발을 진행 중에 있다. CR의 기술을 사용함에 있어서 채널을 선택하는 기준에 따라 네트워크의 통신 효율에 상당한 영향을 미치기 때문에 최적의 채널을 선택하는 방법이 중요하다. 따라서 본 논문에서는 효율적인 통신을 위해 무선인지 기술 기반의 정책에 따른 동적 채널 선택 구조(Policy-based Dynamic Channel Selection Architecture for Cognitive Radio Network)를 제안한다. 제안하는 동적 주파수 선택 방법에는 가중치 채널 선택 방법(weighted channel selection)과 순차적 채널 선택 방법(sequential channel selection)곡 혼합 채널 선택 방법(combined channel selection)의 세 가지 방법이 있으며 제안하는 방법을 사용함으로써 최적의 채널 리스트를 구성해 줄 수 있을 뿐만 아니라 동적으로 채널을 할당해 줄 수 있다.

• International Journal of Computer Science & Network Security
• /
• 제22권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.

• 전기학회논문지
• /
• 제56권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.