• Title/Summary/Keyword: Data Channel

Search Result 4,931, Processing Time 0.032 seconds

An Efficient Mobile Transaction Processing Scheme over Multiple Wireless Broadcast Channels (다중 무선 방송채널에서의 효과적인 모바일 트랜잭션 처리 기법)

  • Jeong, Ho-Ryun;Jung, Sung-Won;Park, Sung-Wook
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.257-271
    • /
    • 2008
  • Wireless broadcast environments has character that a number of mobile client can receive data streaming from central server no matter how they are so many. Because it is asymmetric bandwidth in that uplink and downlink bandwidth are different. This advantage helps wireless broadcast environments is used in many applications. These applications work almost read operation and need control concurrency using transaction unit. Previous concurrency control scheme in single channel is not adapted in multi channel environments because consistency of data are broken when a mobile client tunes in a broadcast cycle in a channel and then move into another channel and listen to different broadcast cycle with already accessed broadcast cycle. In this paper, we propose concurrency control for read-only mobile transactions in multiple wireless broadcast channel. First of all, we adapt index and data dedicated channel and propose LBCPC(Longest Broadcast Cycle Per Channel) as new unit of consistency. In index dedicated channel, it is repeatedly broadcasted data in same BCPC(Broadcast Cycle Per Channel) until LBCPC. And mobile transaction executes validation using control information every LBCPC. As a result, consistency of data is kept and average response time is shorter than one in single channel because waiting time for restart reduces. And as control information is broadcasted more frequently than in single channel, it is guaranteed currency about data accessed by transaction. Finally, according to the simulation result, we verify performance of our scheme in multi channel as comparing average response time with single channel.

Data Allocation for Multiple Broadcast Channels (다중 방송채널을 위한 데이타 할당)

  • Jung Sungwon;Nam Seunghoon;Jeong Horyun;Lee Wontaek
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.86-101
    • /
    • 2006
  • The bandwidth of channel and the power of the mobile devices are limited on a wireless environment. In this case, data broadcast has become an excellent technique for efficient data dissemination. A significant amount of researches have been done on generating an efficient broadcast program of a set of data items with different access frequencies over multiple wireless broadcast channels as well as single wireless broadcast channel. In this paper, an efficient data allocation method over multiple wireless broadcasting channels is explored. In the traditional approaches, a set of data items are partitioned into a number of channel based on their access probabilities. However, these approaches ignore a variation of access probabilities of data items allocated in each channel. In practice, it is difficult to have many broadcast channels and thus each channel need to broadcast many data items. Therefore, if a set of data items broadcast in each channel have different repetition frequencies based on their access frequencies, it will give much better performance than the traditional approaches. In this paper, we propose an adaptive data allocation technique based on data access probabilities over multiple broadcast channels. Our proposed technique allows the adaptation of repetition frequency of each data item within each channel by taking its access probabilities into at count.

TLDP: A New Broadcast Scheduling Scheme for Multiple Broadcast-Channel Environments (TLDP: 다중 방송 채널 환경을 위한 새로운 방송 스케쥴링 기법)

  • Kwon, Hyeok-Min
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.63-72
    • /
    • 2011
  • Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

A Channel Equalization Algorithm Using Neural Network Based Data Least Squares (뉴럴네트웍에 기반한 Data Least Squares를 사용한 채널 등화기 알고리즘)

  • Lim, Jun-Seok;Pyeon, Yong-Kuk
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.2E
    • /
    • pp.63-68
    • /
    • 2007
  • Using the neural network model for oriented principal component analysis (OPCA), we propose a solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. In this paper, we applied this neural network model to channel equalization. Simulations show that the neural network based DLS outperforms ordinary least squares in channel equalization problems.

Generation and Protection of Efficient Watermark Signals and Image Quality Preservation in Transmission Channel Using Turbo Coding (효과적인 워터마크 신호의 생성과 보호 및 터보코딩을 이용한 전송채널상에서의 화질 보존)

  • Cho, Dong-Uk;Bae, Young-Lae
    • The KIPS Transactions:PartB
    • /
    • v.9B no.1
    • /
    • pp.91-98
    • /
    • 2002
  • In this paper, an implementation method of the efficient image transmission stage using watermarking and channel ceding is proposed. Usually, image communication system consists of both a transmitter part and a receiver part. The transmitter part takes charge of copyright protection of the generated image data, and image coding and compression that can deal with channel noises when transmitting. In the transmitter part, we propose a channel coding method which protects both the watermark signal and the original signal for protecting the copyright of image data and solving channel noises when transmitting. Firstly, copyright protection of image data is conducted. For this, image structure analysis is performed, and both the improvement of image quality and the generation of the watermark signal are made. Then, the histogram is constructed and the watermark signals are selected from this. At this stage, by embedding of the coefficients of curve fittness into the lower 4 bits of the image data pixels, image quality degradation due to the embedding of watermark signals are prevented. Finally, turbo coding, which has the most efficient error correction capability in error correction codes, has been conducted to protect signals of watermark and preserved original image quality against noises on the transmission channel. Particularly, a new interleaving method named "semi random inter]easer" has been proposed.

Channel Reservation based DCF MAC Protocol for Improving Performance in IEEE 802.11 WLANs (IEEE 802.11 무선 랜에서 성능 향상을 위한 채널 예약 기반 DCF MAC 프로토콜)

  • Hyun, Jong-Uk;Kim, Sunmyeng
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2159-2166
    • /
    • 2016
  • In the IEEE 802.11 DCF (Distributed Coordination Function) protocol, the binary exponential backoff algorithm is used to avoid data collisions. However, as the number of stations increases of, the collision probability tends to grow and the overall network performance is reduced. To solve this problem, this paper proposes a data transmission scheme based on the channel reservation method. In the proposed scheme, channel time is divided into reservation period and contention period. During the reservation period, stations succeeded in channel reservation transmit their own data packets in sequence without contention. During the contention period, each station sends its data packets through contentions as in DCF. During both the reservation period and the contention period, each station sends a request for channel reservation for the next reservation period to an AP (Access Point). After receiving such a channel reservation request from each station, the AP decides whether the reservation is succeeded and sends the result via a beacon frame to each station. Performance of the proposed scheme is analyzed through simulations. The simulation results show that the proposed scheme tends to reduce the collision probability of DCF and to improve the overall network performance.

Effect of Omni-Channel Use and Customer-Brand Relationship (소비자 옴니채널 성향과 소비자-브랜드 관계에 관한 연구: 브랜드 경험 조절효과)

  • Park, Seung-Hwan
    • Journal of Distribution Science
    • /
    • v.14 no.11
    • /
    • pp.129-138
    • /
    • 2016
  • Purpose - The ICT(information and communications technologies) development is affecting consumer behaviors on selecting channel or distribution system. This study aims to advance our knowledge about the factors influencing omni-channel behaviors. This study considers the positive brand experience as the moderating variable into the relationship between omini-channel use intention and consumer brand relation. Also, the effect of positive brand experience on consumer-brand relation is researched. Research design, data, and methodology - This study conducted an empirical test with the subject as customers who purchase goods or service through on-off cross channel simultaneously. The research model is developed from prior literatures about influencing variables on channel selection. The structure of this study is designed to identify causal relationships between the variables. 268 survey data from the questionnaire survey which is conducted to target customers who use online and offline channels, is used for empirical analysis. This study validates generality with descriptive statistics and data reliability with Cronbach's alpha value. The exploratory factor analysis is used for value purification. Then, the confirmatory factor analysis is conducted for structural equation modeling. Finally, the execute structural equation modeling is analyzed to confirm the hypotheses Results - First, the two causal influences between perceived performance risk and the propensity of omni-channel and between price consciousness and the propensity of omni-channel are verified through the empirical test. Second, the result identifies that the propensity of omni-channel is influenced on consumer-brand relationship. Third, the AMOS analysis proves that the moderating variable, positive brand experience, has significant positive impact on consumer-brand relationship. This significant relationship is highly supported by the regression analysis between brand experience and propensity of omni-channel because it results that positive brand experience has positive impact on the propensity of omni-channel. All hypotheses are verified to be true. Conclusions - Based on the empirical result, this study confirms that perceived performance risk and price consciousness are the important factors influencing propensity of omni-channel. According to the additional analysis, the moderating variable and positive brand experience plays important role between the propensity of omni-channel and consumer-brand relationship. Furthermore, positive brand experience influences more on consumer-brand relationship than non-positive brand experience.

A new WDM/TDM protocol for very high speed optical networks (고속광통신망용 새로운 WDM/TDM 프로토콜)

  • 이상록;이성근;박진우
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.50-58
    • /
    • 1996
  • This paper proposes the channel-access protocol suitable to a very high speed photonic WDM network with star configuration, which can provide a high channel utilization and insensitivity to the propagation delay. The proposed protocol employs a control channel and a simple status table to deal with the propagation delay which has been a major limiting factor in the performance of the very high speed optical communication networks. The control channel transmits control information in order to reserve access on data channels, and each node constitutes a status table after the reception of control pckets which holds information about the availbility of destination node and data channel. The proposed protocol is insensitive to the propagation delay time by removing necessity of the retransmission and by allowing parallel transmission of control packet and data packets. It is proved in analysis and discrete event simulation that the proposed protocol is superior in throughput and mean delay, especially at the high load conditions compared to the existing high speed channel-access protocols.

  • PDF

Performance Analysis of Blind Channel Estimation for Precoded Multiuser Systems

  • Xu, Zhengyuan
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.189-198
    • /
    • 2002
  • Precoder has been shown to be able to provide source diversity and design flexibility. In this paper we employ precoding techniques for block transmission based on a multirate filterbank structure. To accommodate multiuser communication with variable data rates, different precoders with corresponding coefficients and up/down sampling rates are used. However, due to unknown multipath distortion, different interferences may exist in the received data, such as multiuser interference, intersymbol interference and interblock interference. To estimate channel parameters for a desired user, we employ all structured signature waveforms associated with different symbols of that user and apply subspace techniques. Therefore better performance of channel estimator can be achieved than the conventional subspace method based only on the signature of the current symbol. The delay for that user can also be jointly estimated. Channel identifiability conditions and asymptotic channel estimation error are investigated in detail. Numerical examples are provided to justify the proposed method. gest either multicode (MC) or multiple processing gain (MPG) mechanism [2], while requiring data rates to be integral multiples of some basic low-rate. In order to support variable rate transmission however, a comprehensive scheme needs to be investigated.

Design and implementation of dual-mode narrow-band waveguide channel filter using measured iris transmission loss data (Iris 전송손실 측정값을 이용한 이중모드 협대역 도파관 채널여파기의 설계 및 제작)

  • 정근욱;이재현
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.6
    • /
    • pp.19-28
    • /
    • 1995
  • In this paper, measured iris transmission loss data and simulated data by using 3-dimension full-wave analysis S/W are presented and compared with Marcuvitz's theory. And by using measured iris data, dual-mode narrow-band channel filters can be successfully implemented. This paper shows that there is severe difference between the transmission loss of iris calculated by using Marcuvitz's equation to calculate iris dimension, if the length of slot iris is longer than .lambda./.pi., and in the long urn the response of channel filter is distorted. Experimental result shows that the characteristic response of implemented channel filter by using the iris transmission loss graph presented here matches well the design specfications. In conclusion, iris transmission loss measurement method will be very useful to design channel filter.

  • PDF