• Title/Summary/Keyword: cellular communications

Search Result 535, Processing Time 0.03 seconds

Analysis of the soft handoff rate in DS-CDMA cellular systems (DS-CDMA 셀룰라 시스쳄에서의 소프트 핸드오프율에 대한 분석)

  • 조무호;김광식;조경록
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.8
    • /
    • pp.1659-1667
    • /
    • 1997
  • In DS-CDMA cellular systems, using the same frequency channel at the adjacent cells simultaneously makes soft handoff possible. In soft handoff, mobiles use multiple radio resources for the space diversity of signal in the overlapped region. The previous traffic models of hard handoff are not applicable to the system with soft handoff due to switching radio channels in that region. The handoff rate can be calculated by the mobility of mobiles, which is a function of the size and shape of a cell, and the speed and density of the mobiles. In this paper, we propose an analytical traffic model to study the soft handoff rate. We assume that the system uses a two-way handoff scheme for practical purposes, which connects only two cells to a mobile during soft handoff. We performed a computer simulation to confirm the accuracy of the proposed soft handoff model. The simulation results show good agreement with the analytical model.

  • PDF

1D FN-MLCA and 3D Chaotic Cat Map Based Color Image Encryption (1차원 FN-MLCA와 3차원 카오틱 캣 맵 기반의 컬러 이미지 암호화)

  • Choi, Un Sook
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.3
    • /
    • pp.406-415
    • /
    • 2021
  • The worldwide spread of the Internet and the digital information revolution have resulted in a rapid increase in the use and transmission of multimedia information due to the rapid development of communication technologies. It is important to protect images in order to prevent problems such as piracy and illegal distribution. To solve this problem, I propose a new digital color image encryption algorithm in this paper. I design a new pseudo-random number generator based on 1D five-neighborhood maximum length cellular automata (FN-MLCA) to change the pixel values of the plain image into unpredictable values. And then I use a 3D chaotic cat map to effectively shuffle the positions of the image pixel. In this paper, I propose a method to construct a new MLCA by modeling 1D FN-MLCA. This result is an extension of 1D 3-neighborhood CA and shows that more 1D MLCAs can be synthesized. The safety of the proposed algorithm is verified through various statistical analyses.

Design and Performance Comparison of Synchronization Preambles for Device-to-Device Communications (단말 간 직접 통신을 위한 효율적인 동기 프리앰블 설계 및 성능비교)

  • Kim, Jong-Hoon;Sung, Ki-Young;Jung, Young-Ho
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.1
    • /
    • pp.125-131
    • /
    • 2017
  • In this paper, an efficient structure of device-to-device (D2D) synchronization preamble is proposed to meet the enhanced time and frequency synchronization requirements for D2D communication. D2D communication can be applied not only for the cellular communications, but also unmaned aerial vehicle communications and vehicle-to vehicle communication. The proposed preamble structure is transmitting signals at every odd subcarriers, and empty the other subcarriers to minimize the effect of inter-carrier interference. According to the simulation results, the proposed preamble structure provides improved time offset estimation performance, without degrading frequency offset estimation performance compared to the current LTE D2D preamble.

Efficient Interference Control Technology for Vehicular Moving Networks

  • Oh, Sung-Min;Lee, Changhee;Lee, Jeong-Hwan;Park, Ae-Soon;Shin, Jae Sheung
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.867-876
    • /
    • 2015
  • This paper proposes an efficient interference control scheme for vehicular moving networks. The features of the proposed scheme are as follows: radio resources are separated into two resource groups to avoid interference between the cellular and vehicle-to-vehicle (V2V) links; V2V links are able to share the same radio resources for an improvement in the resource efficiency; and vehicles can adaptively adjust their transmission power according to the interference among the V2V links (based on the distributed power control (DPC) scheme derived using the network utility maximization method). The DPC scheme, which is the main feature of the proposed scheme, can improve both the reliability and data rate of a V2V link. Simulation results show that the DPC scheme improves the average signal-to-interference-plus-noise ratio of V2V links by more than 4 dB, and the sum data rate of the V2V links by 15% and 137% compared with conventional schemes.

A Study on the Call Admission Control with Overflow and Preemption at Adaptive Moving Boundary in Cellular Mobile Communications (셀룰러 이동통신망의 적응성 가변경계에서 Overflow와 Preemption을 갖는 호 접속제어 방안 연구)

  • 노희정
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.4
    • /
    • pp.171-180
    • /
    • 2004
  • CDP(handoff Call Dropping Probability) and CBP(new Call Blocking Probability) have been used as two important call level QoS parameters in cellular mobile communications. But, many methods to reduce CDP without considering CBP have been studied, and hand-off call priority scheme has been introduced. But the use of hand-off call priority scheme increases CBP and decreases channel utilization rate depending on the number of reserved channel for priority. In this paper, we propose a CAC(Call Admission Control) algorithm with overflow and preemption to solve the problem caused by considering CDP and CBP in calculation of the number of channel reserved. The problem is the increase of CDP as the traffic load increases. In our CAC algorithm, hand-off call is permitted to use(overflow) unreserved and unused channel if there is no reserved and unused channel, and new call is permitted to use(preemption) the channel overflowed by hand-off call if there is no unreserved and unused channel. This mechanism of calculation of the number of reserved channel and CAC algorithm is expected to increase channel utilization rate, and can be applied to media-based QoS provision in cellular mobile communications.

Dissection of Cellular Communication between Human Primary Osteoblasts and Bone Marrow Mesenchymal Stem Cells in Osteoarthritis at Single-Cell Resolution

  • Ying Liu;Yan Chen;Xiao-Hua Li;Chong Cao;Hui-Xi Zhang;Cui Zhou;Yu Chen;Yun Gong;Jun-Xiao Yang;Liang Cheng;Xiang-Ding Chen;Hui Shen;Hong-Mei Xiao;Li-Jun Tan;Hong-Wen Deng
    • International Journal of Stem Cells
    • /
    • v.16 no.3
    • /
    • pp.342-355
    • /
    • 2023
  • Background and Objectives: Osteoblasts are derived from bone marrow mesenchymal stem cells (BMMSCs) and play important role in bone remodeling. While our previous studies have investigated the cell subtypes and heterogeneity in osteoblasts and BMMSCs separately, cell-to-cell communications between osteoblasts and BMMSCs in vivo in humans have not been characterized. The aim of this study was to investigate the cellular communication between human primary osteoblasts and bone marrow mesenchymal stem cells. Methods and Results: To investigate the cell-to-cell communications between osteoblasts and BMMSCs and identify new cell subtypes, we performed a systematic integration analysis with our single-cell RNA sequencing (scRNA-seq) transcriptomes data from BMMSCs and osteoblasts. We successfully identified a novel preosteoblasts subtype which highly expressed ATF3, CCL2, CXCL2 and IRF1. Biological functional annotations of the transcriptomes suggested that the novel preosteoblasts subtype may inhibit osteoblasts differentiation, maintain cells to a less differentiated status and recruit osteoclasts. Ligand-receptor interaction analysis showed strong interaction between mature osteoblasts and BMMSCs. Meanwhile, we found FZD1 was highly expressed in BMMSCs of osteogenic differentiation direction. WIF1 and SFRP4, which were highly expressed in mature osteoblasts were reported to inhibit osteogenic differentiation. We speculated that WIF1 and sFRP4 expressed in mature osteoblasts inhibited the binding of FZD1 to Wnt ligand in BMMSCs, thereby further inhibiting osteogenic differentiation of BMMSCs. Conclusions: Our study provided a more systematic and comprehensive understanding of the heterogeneity of osteogenic cells. At the single cell level, this study provided insights into the cell-to-cell communications between BMMSCs and osteoblasts and mature osteoblasts may mediate negative feedback regulation of osteogenesis process.

Improvement of Computational Complexity of Device-to-Device (D2D) Resource Allocation Algorithm in LTE-Advanced Networks (LTE-Advanced 환경에서 D2D 자원 할당 알고리즘의 계산 복잡도 개선)

  • Lee, Han Na;Kim, Hyang-Mi;Kim, SangKyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.762-768
    • /
    • 2015
  • D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.

A Taxonomy of Location Management in Mobile Ad Hoc Networks

  • Galluccio, Laura;Palazzo, Sergio
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.397-402
    • /
    • 2004
  • Location management is difficult in ad hoc networks due to many features such as the lack of a wired infrastructure, the scarce energy, memory and processing capabilities of nodes, and nodes’ movement which leads to a dynamic topology. These characteristics make the location management schemes designed for mobile cellular networks inefficient for ad hoc networks. New solutions for location management have therefore been proposed in the literature in the recent past. In this paper, a taxonomy of location management strategies is presented; some of the more interesting approaches proposed in the literature are critically discussed, highlighting their advantages and disadvantages.

Chernoff Bound and the Refined Large Deviation Approximation for Connection Admission Control in CDMA Systems

  • Yeong Min Jang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4B
    • /
    • pp.338-344
    • /
    • 2002
  • This paper proposes a transient (predictive) connection admission control (CAC) scheme using the transient quality of service (QoS) measure for CDMA cellular systems with bursts On-Off sources. We need an approximate and bounded approach for real-time CAC applications. We derive the transient outage probability as the QoS measure using the Chernoff bound and the refuted large deviation approximation. Numerical results show that the predictive CAC is a promising approach for the multicell CDMA systems.

An Efficient Paging Strategy Based on Paging Agents of Base Stations in Cellular Mobile Networks

  • Suh, Bong-Sue;Choi, Jin-Seek;Choi, Song-In
    • ETRI Journal
    • /
    • v.25 no.1
    • /
    • pp.55-58
    • /
    • 2003
  • We propose a new paging strategy to reduce paging cost by adding paging agents at base stations. When a mobile-terminated call occurs, the base stations look up the paging agents to determine if terminal paging is actually to be made. An analytical model based on a Markov chain is used to evaluate the performance of the proposed strategy. The numerical results show that the proposed strategy significantly reduces the paging cost compared with the simultaneous paging strategy.

  • PDF