• Title/Summary/Keyword: simulation and mobile communications

Search Result 620, Processing Time 0.026 seconds

Design of a Low-Power LDPC Decoder by Reducing Decoding Iterations (반복 복호 횟수 감소를 통한 저전력 LDPC 복호기 설계)

  • Lee, Jun-Ho;Park, Chang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.801-809
    • /
    • 2007
  • LDPC Low Density Parity Check) code, which is an error correcting code determined to be applied to the 4th generation mobile communication systems, requires a heavy computational complexity due to iterative decodings to achieve a high BER performance. This paper proposes an algorithm to reduce the number of decoding iterations to increase performance of the decoder in decoding latency and power consumption. Measuring changes between the current decoded LLR values and previous ones, the proposed algorithm predicts directions of the value changes. Based on the prediction, the algorithm inverts the sign bits of the LLR values to speed up convergence, which means parity check equation is satisfied. Simulation results show that the number of iterations has been reduced by about 33% without BER performance degradation in the proposed decoder, and the power consumption has also been decreased in proportional to the amount of the reduced decoding iterations.

Backhaul Resource Allocation Protocol for Underwater Cellular Communication Networks (수중 셀룰러 통신 네트워크에서 백홀 자원분배 프로토콜에 관한 연구)

  • Yun, Changho;Park, Jong-Won;Choi, Suhan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.393-402
    • /
    • 2017
  • Just like terrestrial cellular networks, underwater cellular communication networks, which can manage the overall network resource by adaptively allocating backhaul resource for each base station according to its ingress traffic, are necessary. In this paper, a new resource allocation protocol is proposed for the underwater cellular communication network, allocating backhaul resource of a base station proportional to its ingress traffic to the base station. This protocol is classified into two types dependent upon allocation period: the resource allocation protocol with adaptive period and that with fixed period. In order to determine a proper resource allocation protocol, the performance of the two protocols, in terms of reception rate, message overhead, and latency is compared and investigated via simulation. As a result, the resource protocol with adaptive period outperforms that with fixed period; the resource allocation protocol with fixed period results in a maximum of $10^2$ order longer queueing delay as well as $10^2$ order greater message overhead than that with adaptive period.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

An Efficient Scanning Group and Order Decision Method Using Neighbor Network Information in Wireless LAN (WLAN에서 이웃 네트워크 정보를 이용한 효율적인 스캐닝 그룹 및 순서 결정 방법)

  • Kang, Dong-Wan;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.142-152
    • /
    • 2010
  • When a mobile station(MS) performs a handover, in the IEEE 802.11 WLAN, MS's channel scanning for discovering new available APs is the dominating factor in handover latency, accounting 90% of overall latency. In order to reduce such a scanning latency, we focus on the method for reducing the number of channels for the MS in handover process to scan. With the help of IEEE 802.21 information server(IS), a proper order of groups of channels to be scanned is offered by the current AP depending on the information of neighbor APs in terms of the distance from serving AP, traffic load and network topology. By using this scanning order, the passive scanning of a MS in normal operation enables the MS to filter out the unavailable channels, and thus to classify the candidate channels of neighbor APs into three groups. Then, a handover-imminent MS can perform the active scanning from the most reliable group of channels. Simulation results show that the proposed scanning scheme reduce the scanning latency in comparison with the conventional scheme.

A Novel Sender-Based TCP Congestion Control for Downward Vertical Handover (하향 수직 핸드오버 상황에서 송신자에 기반을 둔 TCP 혼잡 제어 기법)

  • Choi, Yeo-Min;Song, Joo-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6B
    • /
    • pp.430-439
    • /
    • 2008
  • In this paper, we propose a sender-based TCP congestion control scheme for downward vertical handover (DVHO), in which mobile node moves from a cellular network to a wireless LAN. DVHO can give rise to severe performance problems in TCP throughput because it causes a drastic change of link characteristics. Particularly, TCP executes falsely congestion control by packet reordering, which is occurred from link delay difference between a cellular link and a wireless LAN link. Therefore, the congestion window is reduced. And unnecessary retransmissions wastes bandwidth. To solve these problems, we propose a method using estimated round-trip time in cellular link to process duplicated ACKs from reordering. Furthermore, the duplicated ACKs are used to the control congestion window size. Simulation result shows that the proposed scheme can solve problems. Moreover, the proposed scheme can have better performance than TCP New Reno and nodupack.

Distributed SFBC for Relay-Assisted Single Carrier Transmission over Uplink Fast Fading Channels (상향 링크 고속 페이딩 채널에서의 중계기 기반 단일 반송파 전송을 위한 분산 주파수 공간 블록 부호화 기법)

  • Seol, Dae-Young;Kwon, Ui-Kun;Im, Gi-Hong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.25-32
    • /
    • 2007
  • This paper proposes a distributed space-frequency block code (SFBC) for relay-assisted single carrier frequency-domain equalization (SC-FDE). The proposed technique achieves spatial diversity gain over fast fading channels without the complexity of multiple antennas. The mobile equipment of the proposed system has a very simple transmitter structure with constant amplitude transmit sequences, which is desirable especially for uplink communications. In order to obtain spatial diversity, the transmit sequence of relay is efficiently generated in the time domain, which is equivalent to the SFBC. Further, efficient implementation of relay and destination structures is also presented. Extensive simulation results show that the proposed system significantly outperforms the distributed space-time block code (D-STBC) SC-FDE over fast fading channels.

Performance Analysis and Design of a Mobile Station′s Multi-path Searcher for W-CDMA Down-link with Multiple Transmit Antennas (W-CDMA 下向 링크에서 다수의 송신 안테나가 있는 경우 단말기 다중 경로 검색기의 설계 및 성능 분석)

  • Won Seung hwan;Kim Young ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1355-1362
    • /
    • 2004
  • In this paper, we present the performance analysis of a multi-path searcher operating over Rayleigh fading channels when multiple transmit antennas are employed in the down-link of W-CDMA system. The simulation results for the receiver operating characteristics (ROC) for 1, 2, and 4 transmit antennas are presented to corroborate the theoretical analyses. We also propose a procedure to find the optimum parameters of double-dwell serial searcher according to the number of the multiple transmit antennas. Our analyses and simulations indicate that post-detection integration is not necessary when the number of transmit antennas is more than two. Finally, we found that increasing transmit diversity order does not necessarily improve the detection performance when the received pilot signal strength is relatively low. Therefore, this gives us a practical criterion on increasing transmit diversity order.

Delay-Aware Packet Scheduling (DAPS) Algorithm in 3GPP LTE System (LTE 시스템에서 지연에 대한 QoS 보장을 위한 하향링크 패킷 스케줄링 알고리즘)

  • Choi, Bum-Gon;Chung, Min-Young;Lee, Hye-Kyung;Kim, Tai-Suk;Kang, Jee-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.498-508
    • /
    • 2009
  • In wireless mobile environments, large bandwidth and high QoS (Quality of Service) are recently required to support the increased demands for multimedia services. LTE (Long Term Evolution) is one of the promising solutions for the next generation broadband wireless access systems. To efficiently use downlink resource and effectively support QoS, packet scheduling algorithm is one of the important features in LTE system. In this paper, we proposed DAPS (Delay-Aware Packet Scheduling) algorithm to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness. To reflect delay experiences at scheduling instance, DAPS observes how queue waiting time of packet is closed to maximum allowable delay. The simulation results show that the DAPS algorithm yields better performance for delay experience by increasing the number of transmitted packets with satisfying the required delay time compared with existing scheduling algorithms.

MAC Scheduling Scheme for VoIP Traffic Service in 3G LTE (3G LTE VoIP 트래픽 서비스를 위한 MAC 스케줄링 기법)

  • Jun, Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.558-564
    • /
    • 2007
  • 3G Long Term Evolution, which aims for various mobile multimedia service provision by enhanced wireless interface, proposes VoIP-based voice service through a Packet Switching (PS) domain. As delay and loss-sensitive VoIP traffic flows through the PS domain, more challenging technical difficulties are expected than in Circuit Switching (CS) domain based VoIP services. Moreover, since 3G LTE, which adopts the OFDM as its physical layer, introduces Physical Resource Block (PRB) as a unit for transmission resources, new types of resource management schemes are needed. This paper proposes a PRB scheduling algorithm of MAC layer for VoIP service in 3G LTE and shows the simulation results. The proposed algorithm has two key parts; dynamic activation of VoIP priority mode to satisfy VoIP QoS requirements and adaptive adjustment of the priority mode duration in order to minimize the degradation of resource utilization.

Case Study for Ship Ad-hoc Networks under a Maritime Channel Model in Coastline Areas

  • Su, Xin;Yu, HaiFeng;Chang, KyungHi;Kim, Seung-Geun;Lim, Yong-Kon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4002-4014
    • /
    • 2015
  • ITU-R M.1842-1, as a well-known specification dedicated to maritime mobile applications, has standardized wireless transmission protocols according to the particular characteristics of a maritime communications scenario. A time division multiple access (TDMA) frame structure, along with modulation schemes to achieve a high data rate, has been described clearly in ITU-R M.1842-1. However, several specification items are still under "to be decided" status, which brings ambiguity to research works. In addition, the current version of ITU-R M.1842-1 is focused mainly on maritime transmissions in open-sea areas, where the cyclic prefix (CP) is set to zero and only 16-QAM is used in the multi-carrier (MC) system. System performance might be dramatically degraded in coastline areas due to the inter-symbol interference (ISI) caused by selective fading. This is because there is a higher probability that the signal will be reflected by obstacles in coastline areas. In this paper, we introduce the transmission resource block (TRB) dedicated to ITU-R M.1842-1 for a ship ad-hoc network (SANET), where the pilot pattern of TRB is based on the terrestrial trunked radio (TETRA). After that, we evaluated SANET performance under the maritime channel model in a coastline area. In order to avoid noise amplification and to overcome the ISI caused by selective fading, several strategies are suggested and compared in the channel estimation and equalization procedures, where the link-level simulation results finally validate our proposals.