• Title/Summary/Keyword: Internet Channel

Search Result 1,474, Processing Time 0.021 seconds

A New Compressive Feedback Scheme Based on Distributed Compressed Sensing for Time-Correlated MIMO Channel

  • Li, Yongjie;Song, Rongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.580-592
    • /
    • 2012
  • In this paper, a new compressive feedback (CF) scheme based on distributed compressed sensing (DCS) for time-corrected MIMO channel is proposed. First, the channel state information (CSI) is approximated by using a subspace matrix, then, the approximated CSI is compressed using a compressive matrix. At the base station, the approximated CSI can be robust recovered with simultaneous orthogonal matching pursuit (SOMP) algorithm by using forgone CSIs. Simulation results show our proposed DCS-CF method can improve the reliability of system without creating a large performance loss.

HMM-based Adaptive Frequency-Hopping Cognitive Radio System to Reduce Interference Time and to Improve Throughput

  • Sohn, Sung-Hwan;Jang, Sung-Jeen;Kim, Jae-Moung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.475-490
    • /
    • 2010
  • Cognitive Radio is an advanced enabling technology for the efficient utilization of vacant spectrum due to its ability to sense the spectrum environment. It is important to determine accurate spectrum utilization of the primary system in a cognitive radio environment. In order to define the spectrum utilization state, many CR systems use what is known as the quiet period (QP) method. However, even when using a QP, interference can occur. This causes reduced system throughput and contrary to the basic condition of cognitive radio. In order to reduce the interference time, a frequency-hopping algorithm is proposed here. Additionally, to complement the loss of throughput in the FH, a HMM-based channel prediction algorithm and a channel allocation algorithm is proposed. Simulations were conducted while varying several parameters. The findings show that the proposed algorithm outperforms conventional channel allocation algorithms.

Throughput of Coded DS CDMA/Unslotted ALOHA Networks with Variable Length Data Traffic and Two User Classes in Rayleigh Fading FSMC Model

  • Tseng, Shu-Ming;Chiang, Li-Hsin;Wang, Yung-Chung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4324-4342
    • /
    • 2014
  • Previous papers analyzed the throughput performance of the CDMA ALOHA system in Rayleigh fading channel, but they assume that the channel coefficient of Rayleigh fading was the same in the whole packet, which is not realistic. We recently proposed the finite-state Markov channel (FSMC) model to the throughput analysis of DS uncoded CDMA/unslotted ALOHA networks for fixed length data traffic in the mobile environment. We now propose the FSMC model to the throughput analysis of coded DS CDMA/unslotted ALOHA networks with variable length data traffic and one or two user classes in the mobile environment. The proposed DS CDMA/unslotted ALOHA wireless networks for two user classes with access control can maintain maximum throughput for the high priority user class under high message arrival per packet duration.

Estimation of Sparse Channels in Millimeter-Wave MU-MIMO Systems

  • Hu, Anzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2102-2123
    • /
    • 2016
  • This paper considers a channel estimation scheme for millimeter-wave multiuser multiple-input multiple-output systems. According to the proposed method, parts of the beams are selected and the channel parameters are estimated according to the sparsity of channels and the orthogonality of the beams. Since the beams for each channel become distinct and the signal power increases with the increased number of antennas, the proposed approach is able to achieve good estimation performance. As a result, the sum rate can be increased in comparison with traditional approaches, and channels can be estimated with fewer pilot symbols. Numerical results verify that the proposed approach outperforms traditional approaches in cases with large numbers of antennas.

Online Channel Strategies of Hybrid Firms and Social Cost

  • Cho, Su-Mi;Lee, Sang-Ho
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.55-72
    • /
    • 2007
  • We consider the product differentiation model of online channel competition and examine the strategies of hybrid firms in terms of efficiency. After measuring the social cost of online business strategies, we show that (i) online channel of hybrid firm under blockaded entry may increase the social cost if the firms' delivery cost is sufficiently smaller than the consumer's transportation cost, and (ii) online competition under free entry may increase the social cost if the firms' delivery cost is sufficiently larger than the consumer's transportation cost. Finally, we discuss the strategic incentive of hybrid firms to reduce delivery cost and investigate the effect of the Internet maturity on the social cost.

Analysis on WiBro Interfering to WLAN under Co-channel in TV White Spaces

  • Cho, Juphil;Cho, Sang In;Kang, Kyu Min;Hong, Heon Jin
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.5 no.1
    • /
    • pp.1-5
    • /
    • 2013
  • Co channel interference and adjacent channel interference of (WiBro) into Wireless LAN (WLAN) in TV White Spaces (TVWS) is evaluated through Spectrum Engineering Advanced Monte Carlo Analysis Tool (SEAMCAT) based on the Monte-Carlo simulation method. As a result, in the case of co channel interference, the minimum distance between WiBro Mobile Station (MS) and WLAN User Equipment (UE) should be 210 m to allow the maximum transmitter power of WiBro UE of 25 dBm. The transmit power of WiBro BS have to be reduced to -4.96 dBm.

Low-Overhead Feedback Topology Design for the K-User MIMO Interference Alignment

  • Jin, Jin;Gao, Xiang-Chuan;Li, Xingwang;Cavalcante, Charles Casimiro;Li, Lihua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5304-5322
    • /
    • 2018
  • Since designing a feedback topology is a practical way to implement interference alignment at reduced cost of channel state information (CSI) feedback, six feedback topologies have been presented in prior works for a K-user multiple-input multiple-output interference channel. To fully reveal the potential benefits of the feedback topology in terms of the saving of CSI overhead, we propose a new feedback topology in this paper. By efficiently performing dimensionality-decreasing at the transmitter side and aligning interference signals at a subset of receivers, we show that the proposed feedback topology obtains substantial reduction of feedback cost over the existing six feedback designs under the same antenna configuration.

Equal Gain Block Decomposition Methods for Multiuser MIMO Networks

  • Hwang, Insoo;Kang, Inseok;Hwang, Intae;You, Cheolwoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.1156-1173
    • /
    • 2021
  • In this paper, we propose a new joint precoder and postcoder design strategy to support multiple streams per user in multiuser multiple-input multiple-output (MIMO) systems. We propose two step precoding strategies using equal channel gain decomposition and block diagonalization at the transmitter. With the proposed precoder, the multiuser MIMO channel can be decomposed into multiple parallel channels with equal channel gain per user. After applying receive postcoder which is generated and sent by the transmitter, we can use ML based decoder per stream to achieve full receive diversity. Achievable sum rate bound and diversity performance of the proposed algorithm are presented with feedback signaling design and quantitative complexity analysis. Simulation results show that the proposed algorithm asymptotically approaches to the sum rate capacity of the MIMO broadcast channel while maintaining full diversity order.

A Simulation Study on Queueing Delay Performance of Slotted ALOHA under Time-Correlated Channels

  • Yoora Kim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.43-51
    • /
    • 2023
  • Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

Gated Multi-channel Network Embedding for Large-scale Mobile App Clustering

  • Yeo-Chan Yoon;Soo Kyun Kim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.6
    • /
    • pp.1620-1634
    • /
    • 2023
  • This paper studies the task of embedding nodes with multiple graphs representing multiple information channels, which is useful in a large volume of network clustering tasks. By learning a node using multiple graphs, various characteristics of the node can be represented and embedded stably. Existing studies using multi-channel networks have been conducted by integrating heterogeneous graphs or limiting common nodes appearing in multiple graphs to have similar embeddings. Although these methods effectively represent nodes, it also has limitations by assuming that all networks provide the same amount of information. This paper proposes a method to overcome these limitations; The proposed method gives different weights according to the source graph when embedding nodes; the characteristics of the graph with more important information can be reflected more in the node. To this end, a novel method incorporating a multi-channel gate layer is proposed to weigh more important channels and ignore unnecessary data to embed a node with multiple graphs. Empirical experiments demonstrate the effectiveness of the proposed multi-channel-based embedding methods.