• Title/Summary/Keyword: channel sharing

Search Result 265, Processing Time 0.023 seconds

Push-N-Scheme with Timeout for Content Delivery of Social Networking Services

  • Jun, Kyungkoo
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.81-91
    • /
    • 2014
  • Widely spreading smart devices have become an important information sharing channel in everyday life. In particular, social networking services (SNS) are the hub for content creation and sharing. Users post their contents on SNS servers and receive contents of interest. Contents are delivered in either pull or push. Regarding delivery, cost and wait time are two important factors to be minimized, but they are in a trade-off relationship. The Push-N-scheme (PNS) and timeout-based push scheme (TPS) have been proposed for content delivery. PNS has an advantage in cost over TPS, whereas TPS has an edge in terms of the wait time over PNS. We propose a hybrid push scheme of PNS and TPS, called push-N-scheme with timeout (PNT), to balance the cost and the wait time. We evaluate PNT through simulations, with the results showing that PNT is effective in balancing PNS and TPS.

Role Based Smart Contract For Data sharing

  • Joachim, Kweka Bruno;Rhee, Kyung-Hyune
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.235-237
    • /
    • 2018
  • The Internet has allowed many things to move fast, including sharing of data, files and others within a second. Many domains use applications range from IoT, smart cities, healthcare, and organizations to share the data when necessary. However, there are some challenges faced by existing systems that works on centralized nature. Such challenges are data breach, trustiness issue, unauthorized access and data fraud. Therefore in this work, we focus on using a smart contract which is used by blockchain platform and works on decentralized form. Furthermore, in this work our contract provides an access to the file uploaded onto the decentralized storage such as IPFS. By leveraging smart contract-role based which consist of a contract owner who can manage the users when access the certain resources such as a file and as well as use of decentralized storage to avoid single point of failure and censorship over secure communication channel. We checked the gas cost of the smart contract since most of contracts tends to be a high cost.

Novel Single-inductor Multistring-independent Dimming LED Driver with Switched-capacitor Control Technique

  • Liang, Guozhuang;Tian, Hanlei
    • Journal of Power Electronics
    • /
    • v.19 no.1
    • /
    • pp.1-10
    • /
    • 2019
  • Current imbalance is the main factor affecting the lifespan of light-emitting diode (LED) lighting systems and is generally solved by active or passive approaches. Given many new lighting applications, independent control is particularly important in achieving different levels of luminance. Existing passive and active approaches have their own limitations in current sharing and independent control, which bring new challenges to the design of LED drivers. In this work, a multichannel resonant converter based on switched-capacitor control (SCC) is proposed for solving this challenge. In the resonant network of the upper and lower half-bridges, SCC is used instead of fixed capacitance. Then, the individual current of the LED array is obtained through regulation of the effective capacitance of the SCC under a fixed switching frequency. In this manner, the complexity of the control unit of the circuit and the precision of the multichannel outputs are further improved. Finally, the superior performance of the proposed LED driver is verified by simulations and a 4-channel experimental prototype with a rated output power of 20 W.

Joint Uplink/Downlink Co-Opportunistic Scheduling Technique in WLANs (무선랜 환경에서 협동 상향/하향 링크 기회적 스케줄링 기법)

  • Yoo, Joon;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.514-524
    • /
    • 2007
  • Recent advances in the speed of multi-rate wireless local area networks (WLANs) and the proliferation of WLAN devices have made rate adaptive, opportunistic scheduling critical for throughput optimization. As WLAN traffic evolves to be more symmetric due to the emerging new applications such as VoWLAN, collaborative download, and peer-to-peer file sharing, opportunistic scheduling at the downlink becomes insufficient for optimized utilization of the single shared wireless channel. However, opportunistic scheduling on the uplink of a WLAN is challenging because wireless channel condition is dynamic and asymmetric. Each transmitting client has to probe the access point to maintain the updated channel conditions at the access point. Moreover, the scheduling decisions must be coordinated at all clients for consistency. This paper presents JUDS, a joint uplink/downlink opportunistic scheduling for WLANs. Through synergistic integration of both the uplink and the downlink scheduling, JUDS maximizes channel diversity at significantly reduced scheduling overhead. It also enforces fair channel sharing between the downlink and uplink traffic. Through extensive QualNet simulations, we show that JUDS improves the overall throughput by up to 127% and achieves close-to-perfect fairness between uplink and downlink traffic.

Adaptive Radio Resource Allocation for a Mobile Packet Service in Multibeam Satellite Systems

  • Lim, Kwang-Jae;Kim, Soo-Young;Lee, Ho-Jin
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.43-52
    • /
    • 2005
  • In this paper, we introduce an adaptive radio resource allocation for IP-based mobile satellite services. We also present a synchronous multibeam CDMA satellite system using an orthogonal resource sharing mechanism among downlink beams for the adaptive packet transmission. The simulation results, using a Ka-band mobile satellite channel and various packet scheduling schemes, show that the proposed system and resource allocation scheme improves the beam throughput by more than two times over conventional systems. The simulation results also show that, in multibeam satellite systems, a system-level adaptation to a user's channel and interference conditions according to user locations and current packet traffic is more efficient in terms of throughput improvement than a user-level adaptation.

  • PDF

Low-Complexity Triple-Error-Correcting Parallel BCH Decoder

  • Yeon, Jaewoong;Yang, Seung-Jun;Kim, Cheolho;Lee, Hanho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.13 no.5
    • /
    • pp.465-472
    • /
    • 2013
  • This paper presents a low-complexity triple-error-correcting parallel Bose-Chaudhuri-Hocquenghem (BCH) decoder architecture and its efficient design techniques. A novel modified step-by-step (m-SBS) decoding algorithm, which significantly reduces computational complexity, is proposed for the parallel BCH decoder. In addition, a determinant calculator and a error locator are proposed to reduce hardware complexity. Specifically, a sharing syndrome factor calculator and a self-error detection scheme are proposed. The multi-channel multi-parallel BCH decoder using the proposed m-SBS algorithm and design techniques have considerably less hardware complexity and latency than those using a conventional algorithms. For a 16-channel 4-parallel (1020, 990) BCH decoder over GF($2^{12}$), the proposed design can lead to a reduction in complexity of at least 23 % compared to conventional architecttures.

Performance of RA-T spread-spectrum transmission scheme for centralized DS/SSMA packet radio networks (집중형 DS/SSMA 무선 패킷통신망을 위한 RA-T 대역확산 전송방식의 성능)

  • 노준철;김동인
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.6
    • /
    • pp.11-22
    • /
    • 1996
  • We address an issue of channel sharing among users by using a random assignment-transmitter-based (RA-T) spread-spectrum transmission scheme which permits the contention mode only in the transmission of a header while avoiding collision during the data packet transmission. Once the header being successfully received, the data packet is ready for reception by switching to one of programmable matched-filters. But the receoption may be blocked due to limited number of matched-filters so that this effect is taken into account in our analysis. For realistic analysis, we integrate detection performance at the physical level with channel activity at the link level through a markov chain model. We also consider an acknowledgement scheme to notify whether the header is correctly detcted and the data packet can be processed continuously, which aims at reducing the interference caused unwanted data transmission. It is shown that receiver complexity can be greatly reduced by choosing a proper number of RA codes at the cost of only a little throughput degradation.

  • PDF

Novel Beamforming and User Scheduling Algorithm for Inter-cell Interference Cancellation

  • Kim, Kyunghoon;Piao, Jinhua;Choi, Seungwon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.5
    • /
    • pp.346-348
    • /
    • 2016
  • Coordinated multi-point transmission is a candidate technique for next-generation cellular communications systems. We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information, which mitigates inter-cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method that considers both ICI and intra-cell orthogonality. Due to the influence of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method, by an average of 0.55bps/Hz for different numbers of total users per cell.

Analysis of the Electrical Characteristics with Channel Length in n-ch and p-ch poly-Si TFT's (채널 길이에 따른 n-채널과 p-채널 Poly-Si TFT's의 전기적 특성 분석)

  • Back, Hee-Won;Lee, Jea-Huck;Lim, Dong-Gyu;Kim, Young-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1999.11d
    • /
    • pp.971-973
    • /
    • 1999
  • 채널길이에 따른 n-채널과 p-채널 poly-Si TFT's를 제작하고 그 전기적 특성을 분석하였다. n-채널과 p-채널소자는 공통적으로 기생바이폴라트 랜지스터현상(parasitic bipolar transistor action)에 의한 kink 효과, 전하공유(charge sharing)에 의한 문턱전압의 감소, 소오스와 드레인 근처의 결함에 의한 RSCE(reverse short channel effect) 효과, 수직전계에 의한 이동도의 감소, 그리고 avalanche 증식에 의한 S-swing의 감소가 나타났다. n-채널은 p-채널 보다 더 큰 kink, 이동도, S-swing의 변화가 나타났으며, 높은 드레인 전압에서의 문턱전압의 이동은 avalanche 증식(multiplication)에 의한 것이 더 우세한 것으로 나타났다. 누설전류의 경우, 채널 길이가 짧아짐에 따라 n-채널은 큰 증가를 나타냈으나 p-채널의 경우는 변화가 나타나지 않았다.

  • PDF

Novel Beamforming and Scheduling Method for Interference Mitigation at Cell Edge (셀 경계 지역 간섭 완화를 위한 효율적 빔포밍 및 스케쥴링 방법)

  • Kim, Kyung Hoon;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.129-133
    • /
    • 2012
  • Coordinated multi-point transmission (CoMP) is a candidate technique for next generation cellular communications systems. One of the primary elements discussed in LTE-Advanced technology is CoMP, which can improve cell edge user data rate as well as spectral efficiency due to multiple input multiple output - orthogonal frequency division multiplex (MIMO-OFDM). We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information (CSI), which mitigates inter cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method by an average of 0.55bps/Hz in different number of total users per cell. It also outperforms the conventional method by approximately 0.38bps/Hz using different SNRs.