• Title/Summary/Keyword: 네트워크 코딩

Search Result 393, Processing Time 0.024 seconds

WINCE Using MOST Network Control Program (Windows CE 기반 MOST Network 관리 기능의 설계 및 구현)

  • Seo, Sang-Uk;Jang, Si-Woong;Yu, Yun-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.201-204
    • /
    • 2011
  • 최근 차량 내부의 전장장치 사이에 운전자의 편의성의 요구 수준이 높아지고 있으며 이에 대응해 상호통신을 위한 차량용 네트워크 기술이 빠르게 발전하고 있다. 이에 따라 이들 인포테인먼트 시스템 중 최적화된 내부 통신기술이 필요하게 되었다. 차량용 네트워크인 MOST(Media Oriented Systems Transport)는 오디오, 비디오 신호를 동기적으로 전송할 수 있는 자동차용 멀티미디어 시스템에 가장 광범위 하게 사용되고 있는 네트워크이며 넓은 대역폭과 오디오, 비디오 데이터의 실시간 전송 및 코딩을 지원한다. Windows CE는 다양한 라이브러리를 지원함으로써 다양한 GUI 및 네트워크 프로젝터 개발이 가능하다. 이러한 기술적 변화에 맞춰서 본 논문에서는 Windows CE 6.0 기반의 보드와 차량용 인포테이먼트 네트워크인 MOST 네트워크를 이용하여 MOST 네트워크 상태를 관리할 수 있고 MOST 네트워크 동작 및 정보, 상태 등 다양한 정보를 한눈에 확인할 수 있는 시스템을 구성하였다.

  • PDF

An Energy-Efficient In-Network Join Query Processing using Synopsis and Encoding in Sensor Network (센서 네트워크에서 시놉시스와 인코딩을 이용한 에너지 효율적인 인-네트워크 조인 질의 처리)

  • Yeo, Myung-Ho;Jang, Yong-Jin;Kim, Hyun-Ju;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.2
    • /
    • pp.126-134
    • /
    • 2011
  • Recently, many researchers are interested in using join queries to correlate sensor readings stored in different regions. In the conventional algorithm, the preliminary join coordinator collects the synopsis from sensor nodes and determines a set of sensor readings that are required for processing the join query. Then, the base station collects only a part of sensor readings instead of whole readings and performs the final join process. However, it has a problem that incurs communication overhead for processing the preliminary join. In this paper, we propose a novel energy-efficient in-network join scheme that solves such a problem. The proposed scheme determines a preliminary join coordinator located to minimize the communication cost for the preliminary join. The coordinator prunes data that do not contribute to the join result and performs the compression of sensor readings in the early stage of the join processing. Therefore, the base station just collects a part of compressed sensor readings with the decompression table and determines the join result from them. In the result, the proposed scheme reduces communication costs for the preliminary join processing and prolongs the network lifetime.

A High Speed Code Dissemination Protocol for Software Update in Wireless Sensor Network (무선 센서 네트워크상의 소프트웨어 업데이트를 위한 고속 코드 전파 프로토콜)

  • Cha, Jeong-Woo;Kim, Il-Hyu;Kim, Chang-Hoon;Kwon, Young-Jik
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.5
    • /
    • pp.168-177
    • /
    • 2008
  • The code propagation is one of the most important technic for software update in wireless sensor networks. This paper presents a new scheme for code propagation using network coding. The proposed code propagation method roughly shows 20$\sim$25% performance improvement according to network environments in terms of the number of data exchange compared with the previously proposed pipelining scheme. As a result, we can efficiently perform the software update from the viewpoint of speed, energy, and network congestion when the proposed code propagation system is applied. In addition, the proposed system solves the overhearing problems of network coding such as the loss of original messages and decoding error using the predefined message. Therefore, our system allows a software update system to exchange reliable data in wireless sensor networks.

  • PDF

An Inter-Session Opportunistic Network Coding-aware Multipath Routing Protocol (세션간 네트워크 코딩 기회를 인식하는 다중 경로 라우팅 프로토콜)

  • Choi, Tae-Jong;Kang, Kyung-Ran;Cho, Young-Jong;Bang, June-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.536-549
    • /
    • 2012
  • An ad hoc network consists of nodes with limited energy. Therefore, the data transmission can fail abruptly due to lack of energy of transmitting node. A previous work PAMP proposed to build multiple low-energy paths to support stable packet delivery exploiting the nodes with low energy. It has energy-reservation scheme and multi-path selection scheme for stationary wireless ad hoc networks. In this paper, we propose an extended version of PAMP by incorporating network coding opportunity in path selection process. The simulation results show that our proposed scheme shows better packet delivery ratio and lower energy consumption compared with PAMP and a legacy energy-aware multipath routing protocol REAR.

Masked cross self-attentive encoding based speaker embedding for speaker verification (화자 검증을 위한 마스킹된 교차 자기주의 인코딩 기반 화자 임베딩)

  • Seo, Soonshin;Kim, Ji-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.5
    • /
    • pp.497-504
    • /
    • 2020
  • Constructing speaker embeddings in speaker verification is an important issue. In general, a self-attention mechanism has been applied for speaker embedding encoding. Previous studies focused on training the self-attention in a high-level layer, such as the last pooling layer. In this case, the effect of low-level layers is not well represented in the speaker embedding encoding. In this study, we propose Masked Cross Self-Attentive Encoding (MCSAE) using ResNet. It focuses on training the features of both high-level and low-level layers. Based on multi-layer aggregation, the output features of each residual layer are used for the MCSAE. In the MCSAE, the interdependence of each input features is trained by cross self-attention module. A random masking regularization module is also applied to prevent overfitting problem. The MCSAE enhances the weight of frames representing the speaker information. Then, the output features are concatenated and encoded in the speaker embedding. Therefore, a more informative speaker embedding is encoded by using the MCSAE. The experimental results showed an equal error rate of 2.63 % using the VoxCeleb1 evaluation dataset. It improved performance compared with the previous self-attentive encoding and state-of-the-art methods.

A Streaming System based on Transcoding using the Prediction Period (예측주기를 이용한 트랜스코딩 기반의 스트리밍 시스템)

  • Kim, Sung-Min;Kim, Hyun-Hee;Park, Si-Yong;Chung, Ki-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.10
    • /
    • pp.823-835
    • /
    • 2006
  • Multimedia is a very popular service in the Internet. But, we cannot provide multimedia service at a uniform content, because networks and devices are various. Thus, an adaptive service is needed for multimedia transmission. Video Transcoding is the good solution that can service multimedia adaptively. This paper proposes the streaming system that is composed of encoder, transcoder, decoder The encoder enhanced time complexity and PSNR in case of transcoding using PP(Prediction Period). The decoder is almost same as the traditional media player. Transcoder reduced time complexity through combination of prediction period in encoder and skipping period to control frame rate in transcoder. In simulation results, the performances of proposed scheme outperform the system with traditional transcoder in time complexity and PSNR.

Performance of Network Coding with Best Relay Selection in Fading Channels (페이딩 채널에서 최선 릴레이 선택을 갖는 네트워크 코딩의 성능)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.193-200
    • /
    • 2013
  • Recently, network coding has been actively studied to increase the spectral efficiency of two-way relay wireless channels such as cellular systems as well as broadcasting systems. In this paper, we derive the average transmission capacity and the outage probability of a network coding system, which utilizes two-way data transmission via the best relay rather than multiple relays. Since the data unbalance between the forward and the reverse link in two-way communication systems exists, we include the asymmetric link as well as the symmetric link in the analysis. It is noticed that the space diversity gain increases as the increase of the number of relays. Also we obtain 11.4 dB signal-to-noise ratio (SNR) gain with 9 relays compared to that with single relay in symmetrical link at the given conditions. In asymmetrical links, we denotes that the outage probability is more sensitive to the number of relays rather than data unbalance between the links.

H.263-Based Scalable Video Codec (H.263을 기반으로 한 확장 가능한 비디오 코덱)

  • 노경택
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.3
    • /
    • pp.29-32
    • /
    • 2000
  • Layered video coding schemes allow the video information to be transmitted in multiple video bitstreams to achieve scalability. they are attractive in theory for two reasons. First, they naturally allow for heterogeneity in networks and receivers in terms of client processing capability and network bandwidth. Second, they correspond to optimal utilization of available bandwidth when several video qualify levels are desired. In this paper we propose a scalable video codec architectures with motion estimation, which is suitable for real-time audio and video communication over packet networks. The coding algorithm is compatible with ITU-T recommendation H.263+ and includes various techniques to reduce complexity. Fast motion estimation is Performed at the H.263-compatible base layer and used at higher layers, and perceptual macroblock skipping is performed at all layers before motion estimation. Error propagation from packet loss is avoided by Periodically rebuilding a valid Predictor in Intra mode at each layer.

  • PDF

A Scheme for Improving Handover Feasibility of Mobile Terminal in Broadband Convergence Network (광대역 통합 망에서 이동단말의 핸드오버 가용성 향상을 위한 방안)

  • Yu, Myoung-Ju;Lee, Jong-Min;Choi, Seong-Gon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.4
    • /
    • pp.71-78
    • /
    • 2008
  • We propose the scheme that supports continuously service when a user tries to contact new target network in broadband convergence network even though the network resource for the service is not enough. The proposed scheme transforms original service capacity into suitable QoS for the target network using the scalable service techniques in the oncoding/decoding and supports handover for the user. We analyzed the handover blocking probability of two schemes using queueing system to show the improvement of performance by the proposed scheme. Subsequently, we showed that the handover blocking probability in the proposed scheme is lower than that in the existing scheme.