• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.029 seconds

Measurement Analysis of Billing Record in the Cellular Networks (과금 데이터를 이용한 이동통신 네트워크의 특성 연구)

  • Kim, Yae-Hoe;Kwon, Chong-Wook;Choi, Hyoung-Kee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06d
    • /
    • pp.255-258
    • /
    • 2008
  • 현재 이동통신 네트워크는 통신 기술의 발전에 힘입어 음성 서비스를 넘어선 다양한 패킷 데이터 기반 서비스를 제공하고 있다. 하지만 현재 IEEE 802.11과 같은 이기종 네트워크에 대한 연구가 다양하게 진행되고 있는 것과 달리 이동통신 네트워크의 패킷 데이터 기반 서비스에 대한 연구는 이루어지지 않았다. 이러한 추세의 원인은 이동통신 네트워크가 사업자에 의해서 폐쇄적으로 운영되고 있기 때문이다. 우리는 지금까지 이기종 네트워크에 대한 연구를 바탕으로 예측만 하던 문제를 해결하기 위해 이 논문은 통해서 이동통신 네트워크의 패킷 기반 데이터 서비스의 특징을 분석한다. 실제 트래픽을 모두 분석하는 것은 규모의 문제로 불가능했기 때문에 우리는 서비스에 대한 과금 데이터를 사용했다. 과금 데이터에는 네트워크의 특징이 대부분 반영되어 있기 때문에 실제 트래픽을 수집해서 분석하는 것과 같다. 분석결 과로 이동통신 환경에서 사용자 행동 패턴과 서비스 유형별 트래픽 특성 및 네트워크의 특징을 보여준다. 이러한 결과는 향후 네트워크 진화에 의해서 예상되는 트래픽 예측 및 관리에 활용 가능하고, 네트 워크 모델링에 있어서의 기반 지식을 제공한다.

  • PDF

Parallel Prefix Computation and Sorting on a Recursive Dual-Net

  • Li, Yamin;Peng, Shietung;Chu, Wanming
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.271-286
    • /
    • 2011
  • In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

A Feasibility Study on TETRA System Application for Train Control Systems

  • Tsogtbayar, Chinzorig;Kang, Hyoungseok;Lee, Jongwoo;Boldbaatar, Tsevelsuren
    • International Journal of Railway
    • /
    • v.9 no.2
    • /
    • pp.36-40
    • /
    • 2016
  • TETRA communication system is very versatile system which can transmit voice + data and packet data optimized. Direct mode operation permits to connect between mobiles when mobile stain is out of coverage of networks. It can be more secure communication channel for railway signaling systems. Railway signaling systems use many of wayside signal equipment, which require many maintenance efforts and budget. Many railway authorities want to reduce and replace the wayside equipment. Radio based signaling systems are one of candidate for replacing the conventional signaling systems. The radio based signaling systems can replace track circuit and wayside signal. The radio systems permit to connect between control centers and trains. The radio systems have to ensure high quality of the connectivity more or equal to the existed track circuits. We studied the application of TETRA systems for railway radio systems for bridging between train control centers and trains. We provide an operation scenario for radio based train control system to ensure the safety require to the existed trains control system and satisfied the existed operational availability. We showed the data transmission speed, maximum bit error rate, and data coding for the radio-based signal system using TETRA systems.

Joint Resource Allocation Scheme for OFDM Wireless-Powered Cooperative Communication Networks

  • Liang, Guangjun;Zhu, Qi;Xin, Jianfang;Pan, Ziyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1357-1372
    • /
    • 2017
  • Energy harvesting techniques, particularly radio frequency energy harvesting (RF-EH) techniques, which are known to provide feasible solutions to enhance the performance of energy constrained wireless communication systems, have gained increasing attention. In this paper, we consider a wireless-powered cooperative communication network (WPCCN) for transferring energy in the downlink and forwarding signals in the uplink. The objective is to maximize the average transmission rate of the system, subject to the total network power constraint. We formulate such a problem as a form of wireless energy transmission based on resource allocation that searches for the joint subcarrier pairing and the time and power allocation, and this can be solved by using a dual approach. Simulation results show that the proposed joint optimal scheme can efficiently improve system performance with an increase in the number of subcarriers and relays.

The Development of New dynamic WRR Algorithm for Wireless Sensor Networks (무선 센서망을 위한 새로운 동적 가중치 할당 알고리즘 개발)

  • Cho, Hae-Seong;Cho, Ju-Phil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.293-298
    • /
    • 2010
  • The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

A Study on a Clustering for Military Tactical Information Communication Network (군 전술정보통신체계에서 클러스터 구조에 대한 연구)

  • Lee, Myung-Noh;Yoo, Jae-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.709-712
    • /
    • 2010
  • A military tactical information communication network uses no base station and all mobile terminal are independent while mobile networks use an infra structure that a fixed base station supports many mobile terminals. A clustering system is more efficient than the existing one in small Ad-hoc network using a limited message size. The development of an adaptive clustering algorithm is necessary to maximize the network efficiency via a study on a clustering for military tactical information communication network.

  • PDF

Corporate-Series Fed Microstrip Array Antenna with Yagi Elements for 5G

  • Kim, Geun-Sik;Choi, Dong-You
    • Journal of information and communication convergence engineering
    • /
    • v.18 no.3
    • /
    • pp.162-166
    • /
    • 2020
  • The present paper presents an array antenna of a microstrip patch for 5G applications. Four rectangular microstrip patch elements are arranged in parallel and series to form an array antenna. Two insets are made on both sides of each patch element to achieve a wide frequency bandwidth of 23.97-31.60 GHz. To attain a high gain and wider bandwidth, the microstrip patch antenna is fed using series and corporate feeding networks. Further, three director elements on top of the top-most patch elements, and one reflector element at the open end of each patch element, are added. The addition of the Yagi elements improved the overall gain and acquired a higher radiation efficiency throughout the operating frequency bandwidth, with the array antenna achieving a maximum peak gain of 8.7 dB. The proposed antenna is built on a low-loss and low-cost substrate of FR4-eproxy. The proposed antenna design with a simple structure is suitable for Internet of Things and 5G applications.

Effects of Atmospheric Turbulence on the Optical Satcom Link between Stratospheric Sky Station and Earth Station (대기교란이 지구국과 성층권 위성간 광 위성통신시스템에 미치는 영향에 관한 연구)

  • Jung, Jin-Ho
    • Journal of IKEEE
    • /
    • v.1 no.1 s.1
    • /
    • pp.47-54
    • /
    • 1997
  • Today's communication needs the super high-speed data transmission system to send many data rapidly, correctly, and simultaneously because of the increase of internet use, the demand of multimedia service and so on. Before long, the super high data service will be offered us by a satellite called platform which will be located at stratosphere of 20[km]over earth. It is possible to build the optical wireless communication networks which have the high data-tarrying capacity because this system use a laser. But, there are many problems to overcome because it make use of the atmospheric space as transmission channel. In this paper, therefore, we study up on the relations of data rates, bit error rates, and turbulent effects of atmosphere to present the effects of atmosphere to present the effects of atmospheric turbulence on the optical satcom link.

  • PDF

P2HYMN: Hybrid Network Systems for Maintenance Support in Power Plants (P2HYMN: 발전소 정비지원 하이브리드 네트워크 시스템)

  • Jin, Young-Hoon;Choo, Young-Yeol
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.7
    • /
    • pp.782-787
    • /
    • 2014
  • Due to the complicated steel structure and safety concern, it is very difficult to deploy wireless networks in power plants. This paper presents a hybrid network, named as $P^2HYMN$ (Power Plant HYbrid Maintenance Network), encompassing PLC (Power Line Communication), TLC (Telephone Line Communication), and Wireless LAN. The design goal of $P^2HYMN$ is to integrate multimedia data such as design drawings of control equipment, process data, and video image data for maintenance operation in electric power plants. A Multiplex Line Communication (MLC) device was designed and implemented to integrate PLC, TLC, and Wireless LAN into $P^2HYMN$. Performance test of $P^2HYMN$ has been conducted on a testbed under various conditions. The throughput of TLC was shown as 39 Mbps. Because the bandwidth requirement per camera is 8.5 Mbps on average, TLC is expected to support more thant four video camera at the same time.

Novel Packet Switching for Green IP Networks

  • Jo, Seng-Kyoun;Kim, Young-Min;Lee, Hyun-Woo;Kangasharju, Jussi;Mulhauser, Max
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.275-283
    • /
    • 2017
  • A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy-efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing-related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well-known real network topologies and achieved a more energy- efficient performance than that achieved in previous studies.