• Title/Summary/Keyword: probability of information transmission

Search Result 489, Processing Time 0.026 seconds

Adaptive Cooperative Spectrum Sensing Based on SNR Estimation in Cognitive Radio Networks

  • Ni, Shuiping;Chang, Huigang;Xu, Yuping
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.604-615
    • /
    • 2019
  • Single-user spectrum sensing is susceptible to multipath effects, shadow effects, hidden terminals and other unfavorable factors, leading to misjudgment of perceived results. In order to increase the detection accuracy and reduce spectrum sensing cost, we propose an adaptive cooperative sensing strategy based on an estimated signal-to-noise ratio (SNR). Which can adaptive select different sensing strategy during the local sensing phase. When the estimated SNR is higher than the selection threshold, adaptive double threshold energy detector (ED) is implemented, otherwise cyclostationary feature detector is performed. Due to the fact that only a better sensing strategy is implemented in a period, the detection accuracy is improved under the condition of low SNR with low complexity. The local sensing node transmits the perceived results through the control channel to the fusion center (FC), and uses voting rule to make the hard decision. Thus the transmission bandwidth is effectively saved. Simulation results show that the proposed scheme can effectively improve the system detection probability, shorten the average sensing time, and has better robustness without largely increasing the costs of sensing system.

Performance Analysis of Common Spreading Code CDMA Packet Radio Systems with Multiple Capture Capability (다중캡쳐 특성의 단일확산코드 CDMA 패킷 라디오 시스팀들의 성능 분석)

  • 김동인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.12
    • /
    • pp.1286-1299
    • /
    • 1991
  • In this paper we present a multiple capture model for common spreading code CDMA packet radio systems with star topology. Basic equations for the collision free, header detection. and multiple capture probabilities are derived at the central receiver. Link performances. including the average number of packet captures, allowable number of simultaneous transmission, and system throughput are theoretically evaluated for a hybrid system. combining envelope header detection and differential data detection, Using the Block Oriented Systems Simulator(BOSS), simulations were carried out for the central receivers with envelope or differential geader detection, It is shown that for a threshold approx-imation to the probability of data packet success, the mulyiple capture model significantly improves system throughput.

  • PDF

Modified BLUE Packet Buffer for Base-Stations in Mobile IP-based Networks

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.530-538
    • /
    • 2011
  • Performance of TCP can be severely degraded in Mobile IP-based wireless networks where packet losses not related to network congestion occur frequently during inter-subnetwork handoffs by user mobility. To solve such a problem in the networks using Mobile IP, the packet buffering method at a base station(BS) recovers those packets dropped during handoff by forwarding the buffered packets at the old BS to the mobile users. But, when the mobile user moves to a congested BS in a new foreign subnetwork, those buffered packets forwarded by the old BS are dropped and TCP transmission performance of a mobile user degrades severely. In this paper, we propose a Modified BLUE(MBLUE) buffer required at a BS to increase TCP throughput in Mobile IP-based networks. When a queue length exceed a threshold and congestion grows, MBLUE increases its packet drop probability. But, when a TCP connection is added at new BS by a handoff, the old BS marks the buffered packets. And new BS receives the marked packets without dropping. Simulation results show that MBLUE buffer reduces congestion during handoffs and increases TCP throughputs.

Random Access Channel Allocation Scheme in Multihop Cellular Networks (멀티 홉 셀룰라 망에서의 랜덤 액세스 채널 할당 방안)

  • Cho, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4A
    • /
    • pp.330-335
    • /
    • 2007
  • This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

A Simulation Model of Multipath Fading Channels (다중 경로 페이딩 채널의 시뮬레이션 모델)

  • Im, Seung-Gak;Kim, Yun-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.3
    • /
    • pp.374-381
    • /
    • 1995
  • For designing radio communication systems, radio-channel effects must be considered in order to obtain the desired communication quality, transmitting power, transmission speed and bit error rate. In radio channel, one of major factors that degrade communication quality is multipath fading between transmitting and receiving points. Therefore, a channel model which can describe fading effects correctly is requested. This paper deals with the composition of the channel simulator model that describes multipath fading effects and delay times which occur in the channel. For the performance analysis of the proposed model, trandmitting signal is used in the simulation. From simulation results, it can be shown that probability density function. level crossing rates and average fading-duration time distribution of the faded receive signal are very similar with theoretic values.

  • PDF

Modeling and Performance Analysis of Finite Load 802.11 WLAN with Packet Loss (패킷 손실을 갖는 유한 로드 802.11 무선 랜의 모델링과 성능분석)

  • Choi, Chang-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.249-257
    • /
    • 2005
  • A Markov model for the IEEE 802.11 standard which is the most widely deployed wireless LAN protocol, is designed and the channel throughput is evaluated. The DCF of 802.11, which is based on CSMA/CA protocol, coordinates transmissions onto the shared communication channel. In this paper, under a finite load traffic condition and the assumption of packet loss after the final backoff stage. We present an algorithm to find the transmission probability and derive the formula for the channel throughput. The proposed model is validated through simulation and is compared with the case without packet losses.

  • PDF

Intercell Multiple Antenna Cooperation for OFDM-Based Broadcast Services (OFDM 기반 브로드캐스트 서비스를 위한 셀간 다중 안테나 협력 전송)

  • Kang, Sung-Kyo;Sim, Sung-Bo;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.624-631
    • /
    • 2007
  • This paper presents inter-cell cooperation methods with two transmit antennas for broadcast services in a coded OFDM cellular system. In the method, cells are divided into multiple cell groups and a coded packet is partitioned into the subparts. Then, a different cell group and antenna combination is assigned to each subpart for transmission of two orthogonal branches of the diversity code. For the method, we derive the bound on the pairwise error probability to predict the coded performance and verify the performance gain of the proposed method through the simulation using turbo code and analytically derived bound.

MAC Protocol for Packet Data Service in Slotted CDMA Environment (슬롯 CDMA 환경에서 패킷 데이터 서비스를 위한 MAC 프로토콜)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1399-1405
    • /
    • 2003
  • This paper proposes an MAC protocol for fair packet data services in stoned CDMA system. In slotted CDMA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are entirely caused by multiple access interference. Therefore, in order to get the optimal system throughput, the number of simultaneously transmitted Packets should be kept at a proper level. In the proposed protocol, the base station calculates the new and retransmitted packet transmission probability of mobile stations according to the offered load and then broadcasts these probabilities. Mobile stations, which have a packet, attempt to transmit packet with the received probabilities. Simulation results show that the proposed scheme can offer better system throughput than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

A study on a cooperative MAC protocol at Ad Hoc networks (Ad Hoc 네트워크에서 Cooperative MAC 프로토콜에 관한 연구)

  • Jang, Jae-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1561-1570
    • /
    • 2009
  • Being different from traditional mobile communication networks or wireless LAN with access points, ad hoc network can provide direct communications between homogeneous stations. Thus, it can be considered as a much advanced network. Somehow, many researches have been done to enhance system performance of ad hoc networks up to now, one of which is cooperative communications. In this paper, a cooperative MAC protocol, called CO-MAC protocol, is proposed and its performance is evaluated with a mathematical approach. Numerical results show that this scheme provides more enhanced system throughput especially when frame transmission error probability is high than DCF scheme, which is the key protocol in IEEE 802.11 standard, and rDCF scheme.

The Design of Secret Multi-Paths on MRNS(Mixed Radix Numbers System) Network for Secure Transmission (안전한 전송을 위한 MRNS(Mixed Radix Number System)네트워크에서의 비밀 다중 경로의 설계)

  • Kim, Seong-Yeol;Jeong, Il-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1534-1541
    • /
    • 1996
  • Routing security is the confidentiality of route taken by the data transmitted over communication networks. If the route is detected by an adversary, the probability is high that the data lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to a destination node using the shortest direct path. Furthermore, if we use a number of secret routes from a node to a destination node, data security is much stronger since we can transmit partial data rather than entire data along a secret route. Finally, the idea above is implemented on MRNS Network.

  • PDF