• Title/Summary/Keyword: simulation and mobile communications

Search Result 620, Processing Time 0.034 seconds

Transmission Performance of Voice Traffic over LTE-R Network (LTE-R 네트워크에서 음성트래픽의 전송성능)

  • Kim, Young-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.568-570
    • /
    • 2018
  • Currently, with rapid progress and supply of mobile communication technology, LTE(Long Term Evolution) technology is expanded and widely used to industrial and emergency communications beyond earlier smart-phone based service. In this paper, transmission performance of voice traffic, one of railway communication service based on LTE-R as an application field of LTE technology, is analyzed. This study is performed performance analysis with level of application service and consider effects of satisfaction level for users. Computer Simulation based on ns(Network Simulation)-3 is used for analysis and VoIP(Voice over Internet Protocol) specification is used for voice traffics. Results of this paper is used to implement LTE-R networks and develope application services over LTE-R network.

  • PDF

A Method to Support Mobile Sink Node in a Hierarchical Routing Protocol of Wireless Sensor Networks (무선 센서 네트워크를 위한 계층적 라우팅 프로토콜에서의 이동 싱크 노드 지원 방안)

  • Kim, Dae-Young;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1B
    • /
    • pp.48-57
    • /
    • 2008
  • Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.

Broadband Microstrip Patch Antenna Design (광대역 마이크로스트립 패치 안테나 설계)

  • 이호준;이재영;김종규
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.11 no.1
    • /
    • pp.7-11
    • /
    • 2004
  • In this paper, the wideband microstrip patch antennas for the Personal communications Service (PCS : 1750∼1870 MHz) and International Mobile Telecommunications-2000 (IMT-2000 : 1920∼2170 MHz) dual band are studied. Experimental and simulation results on the dual band antenna are presented. Simulation results are in good agreement with measurements. The experimental and simulation results confirm the wideband characteristics of the antenna. The studied antenna satisfied the wideband characteristics that are required characteristics for above 420 MHz impedance bandwidth for the PCS and IMT-2000 dual band antenna. In this paper, through the designing of a dual band antenna, we have presented the availability for PCS & IMT-2000 base station antenna. An impedance bandwidth of 33% (VSWR<1.5, 650 GHz) and a maximum gain of 7dB can be achieved. The radiation pattern is stable across the passband.

  • PDF

An Multiple Access Interference Mitigation Technique Using Linearly Constrained Constant Modulus Algorithm in MC-CDMA Systems (Linearly Constrained Constant Modulus Algorithm을 이용한 MC-CDMA 시스템에서의 MAI 완화 기법)

  • Kim, Dong-Joo;Kim Joo-Eung;Jung Sung-Soon;Hong Dae-Sik;Kang Chang-Eon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.73-79
    • /
    • 2002
  • In this paper, two interference suppression schemes (LCCMA, HIC) applied to the MC-CDMA system were proposed. The proposed schemes have advantages that it don't requires the other's spreading code and can be used even in mobile. The proposed HIC combines the proposed interference suppressor with PIC. Simulation is performed in various environments using the Monte Carlo method. Simulation results show that there is 1.4~3 times capacity increase in corresponding simulation environments. Also this scheme can take advantage of path diversity whereas the system using EGC, MRC, and PIC cannot. Therefore, as the number of path increase, a considerable performance improvement can be attained.

Detection Scheme Based on Gauss - Seidel Method for OTFS Systems (OTFS 시스템을 위한 Gauss - Seidel 방법 기반의 검출 기법)

  • Cha, Eunyoung;Kim, Hyeongseok;Ahn, Haesung;Kwon, Seol;Kim, Jeongchang
    • Journal of Broadcast Engineering
    • /
    • v.27 no.2
    • /
    • pp.244-247
    • /
    • 2022
  • In this paper, the performance of the decoding schemes using linear MMSE filters in the frequency and time domains and the reinforcement Gauss-Seidel algorithm for the orthogonal time frequency space (OTFS) system that can improve robustness under high-speed mobile environments are compared. The reinforcement Gauss-Seidel algorithm can improve the bit error rate performance by suppressing the noise enhancement. The simulation results show that the performance of the decoding scheme using the linear MMSE filter in the frequency domain is severely degraded due to the effect of Doppler shift as the mobile speed increases. In addition, the decoding scheme using the reinforcement Gauss-Seidel algorithm under the channel environment with 120 km/h and 500 km/h speeds outperforms the decoding schemes using linear MMSE filters in the frequency and time domains.

Performance analysis of a call control scheme with buffering and dynamic bandwidth assignment for non-uniform traffic distribution (부하가 일정하지 않은 환경에서 버퍼 사용에 따른 시스템 성능 분석)

  • 임승철;성홍석;박동선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4B
    • /
    • pp.316-323
    • /
    • 2002
  • In this paper, we analyze the call control scheme that is using buffer at new call and handoff call for non-uniform traffic load distribution, the multiple cell environments and the multiple types of services such as voice and data service. Considering the facts, the call admission control method using the effective bandwidth concept is employed in this paper, The bandwidth for a new call and a handoff call is allocated by the number of mobile station and dynamically assigned by taking account of the blocking rate of new calls and the dropping rate of handoff calls. The call control procedure is experimented through a simulation study by dynamically the bandwidth to new and handoff calls based on the blocking rate and the dropping rate. The results show our call control scheme can get a good quality of service for mobile users.

Opportunistic Routing for Bandwidth-Sensitive Traffic in Wireless Networks with Lossy Links

  • Zhao, Peng;Yang, Xinyu
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.806-817
    • /
    • 2016
  • Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

A New Route Optimization Scheme for Network Mobility: Combining ORC Protocol with RRH and Using Quota Mechanism

  • Kong, Ruoshan;Feng, Jing;Gao, Ren;Zhou, Huaibei
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.91-103
    • /
    • 2012
  • Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme-involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR)-is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.

IPv6 Autoconfiguration for Hierarchical MANETs with Efficient Leader Election Algorithm

  • Bouk, Safdar Hussain;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.11 no.3
    • /
    • pp.248-260
    • /
    • 2009
  • To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

An Adaptive Power Saving Mechanism in IEEE 802.11 Wireless IP Networks

  • Pack Sangheon;Choi Yanghee
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.126-134
    • /
    • 2005
  • Reducing energy consumption in mobile hosts (MHs) is one of the most critical issues in wireles/mobile networks. IP paging protocol at network layer and power saving mechanism (PSM) at link layer are two core technologies to reduce the energy consumption of MHs. First, we investigate the energy efficiency of the current IEEE 802.11 power saving mechanism (PSM) when IP paging protocol is deployed over IEEE 802.11 networks. The result reveal that the current IEEE 802.11 PSM with a fixed wakeup interval (i.e., the static PSM) exhibits a degraded performance when it is integrated with IP paging protocol. Therefore, we propose an adaptive power saving mechanism in IEEE 802.11-based wireless IP networks. Unlike the static PSM, the adaptive PSM adjusts the wake-up interval adaptively depending on the session activity at IP layer. Specifically, the MH estimates the idle periods for incoming sessions based on the exponentially weighted moving average (EWMA) scheme and sets its wake-up interval dynamically by considering the estimated idle period and paging delay bound. For performance evaluation, we have conducted comprehensive simulations and compared the total cost and energy consumption, which are incurred in IP paging protocol in conjunction with various power saving mechanisms: The static PSM, the adaptive PSM, and the optimum PSM. Simulation results show that the adaptive PSM provides a closer performance to the optimum PSM than the static PSM.