• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.029 seconds

Feasibility of Interference Alignment for Reverse Duplex in MIMO Cellular Networks with One-side Base Cooperation (다중 안테나를 사용하는 단방향 기지국 협력 역 듀플렉스 셀룰러 네트워크의 간섭 정렬 타당성)

  • Kim, Kiyeon;Jeon, Sang-Woon;Yang, Janghoon;Kim, Dong Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.2
    • /
    • pp.273-284
    • /
    • 2015
  • The feasibility conditions of interference alignment (IA) are analyzed for reverse duplex systems, in which one cell operates as downlink (DL) while the other cell operates as uplink (UL) assuming one-sid base station (BS) cooperation. Under general multiple-input and multiple-output (MIMO) antenna configurations, a necessary condition and a sufficient condition for one-shot linear IA are established, i.e., linear IA without symbol or time extension. In several example networks, optimal sum degrees of freedom (DoF) is characterized by the derived necessary condition and sufficient condition. For some special class of networks, a sufficient condition is established in a more compact expression, which also yields the necessary and sufficient condition. Simulation results demonstrate that the proposed IA does not only achieve larger DoF but also significantly improves the sum rate in the practical signal-to-noise ratio (SNR) regime.

Network Architecture and Routing Protocol for Supporting Mobile IP in Mobile Ad Hoc Networks (이동 애드 혹 네트워크의 Mobile IP 지원을 위한 네트워크 구조 및 라우팅 프로토콜)

  • Oh, Hoon;TanPhan, Anh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.24-35
    • /
    • 2008
  • We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

Performance Analysis of Opportunistic Spectrum Access Protocol for Multi-Channel Cognitive Radio Networks

  • Kim, Kyung Jae;Kwak, Kyung Sup;Choi, Bong Dae
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.77-86
    • /
    • 2013
  • Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

The File Splitting Distribution Scheme Using the P2P Networks with The Mesh topology (그물망 위상의 P2P 네트워크를 활용한 파일 분리 분산 방안)

  • Lee Myoung-Hoon;Park Jung-Su;Kim Jin-Hong;Jo In-June
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1669-1675
    • /
    • 2005
  • Recently, the small sized wireless terminals have problems of processing of large sized file because of the trends of a small sized terminals and a large sized files. Moreover, the web servers or the file servers have problems of the overload because of the concentration with many number of files to the them. Also, There is a security vulnerability of the data processing caused by the processing with a unit of the independent file. To resolve the problems, this paper proposes a new scheme of fat splining distribution using the P2P networks with the mesh topology. The proposed scheme is to distribute blocks of file into any peer of P2P networks. It can do that the small sized wireless terminals can process the large size file, the overload problems of a web or file servers can solve because of the decentralized files, and, the security vulnerability of the data processing is mitigated because of the distributed processing with a unit of the blocks to the peers.

A design on Light-Weight Key Exchange and Mutual Authentication Routing Protocol in Sensor Network Environments (센서네트워크 환경에서 경량화된 키 교환 및 상호인증 라우팅 프로토콜)

  • Lee, Kwang-Hyoung;Lee, Jae-Seung;Min, So-Yeon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.11
    • /
    • pp.7541-7548
    • /
    • 2015
  • Wireless Sensor Networks is the technology which is used in explore role for military purposes, as well as various fields such as industrial equipment management, process management, and leverage available technologies by distributing node into various areas. but there are some limitations about energy, processing power, and memory storage capacity in wireless sensor networks environment, because of tiny hardware, so various routing protocols are proposed to overcome it. however existing routing protocols are very vulnerable in the intercommunication, because they focus on energy efficiency, and they can't use existing encryption for it, Because of sensor's limitations such like processing power and memory. Therefore, this paper propose mutual authentication scheme that prevent various security threats by using mutual authentication techniques and, Key generation and updating system as taking into account energy efficiency.

Design and Verification of Flow Mobility Scheme tn the AIMS System (AIMS 시스템에서 플로우 이동성 기법의 설계와 검증)

  • Lee, Sung-Kuen;Lee, Kyoung-Hee;Min, Sung-Gi;Lee, Hyo-Beom;Lee, Hyun-Woo;Han, Youn-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.760-770
    • /
    • 2011
  • The existing mobility management schemes do not fully support the next generation network, which is composed of IP-based core network and various access networks. Currently, ETRI has been developing the AIMS (Access Independent Mobility Service) system which satisfies the ITU-T requirements of mobility management in the next generation network. The AIMS system is designed to provide a mobile host with a fast and reliable mobility service among heterogeneous access networks. Recently, many user devices have multiple communication interfaces, e.g., 3G and WLAN, and thus they can make two or more network connections at the same time. In this paper, we design a scheme of flow mobility, i.e., the movement of selected data flows from one access technology to another, to be applied in the AIMS system, and verify the proposed scheme through the NS-3 simulation study. From the simulation results, we can know that the proposed flow mobility scheme can utilize the network resource efficiently in the heterogeneous mobile networks.

Design and Implementation of Embedded Linux-based Mobile Teller which supports CDMA and WiBro networks (듀얼모드 통신 지원 임베디드 리눅스 기반의 모바일 이야기꾼 설계 및 구현)

  • Kim, Do-Hyung;Yun, Min-Hong;Lee, Kyung-Hee;Lee, Cheol-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.131-138
    • /
    • 2008
  • This paper describes the implementations of the first application service based on embedded Linux; Mobile Teller which uses WiBro network for data communications and CDMA network for voice communications. Currently, with the appearance of WiBro service, dual-mode terminals which support two heterogeneous networks are available. But, the development of applications which effectively use these networks for providing better service to user is rarely prepared. At Mobile Teller, when a sender on a dual-mode terminal types texts, the texts are transmitted to a TTS server located in the Internet through WiBro network. Subsequently, the TTS server converts the texts into voices and transmits the voice data to the dual-mode terminal. At last the dual-mode terminal sends the voice to the receiver through the CDMA network. In case of noisy environment or when a user has difficulty in speaking, Mobile Teller makes voice communication possible

A New Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 새로운 키 사전 분배 구조)

  • Kim, Tae-Yeon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.183-188
    • /
    • 2009
  • Wireless sensor networks will be broadly deployed in the real world and widely utilized for various applications. A prerequisite for secure communication among the sensor nodes is that the nodes should share a session key to bootstrap their trust relationship. The open problems are how to verify the identity of communicating nodes and how to minimize any information about the keys disclosed to the other side during key agreement. At any rate, any one of the existing schemes cannot perfectly solve these problems due to some drawbacks. Accordingly, we propose a new pre-distribution scheme with the following merits. First, it supports authentication services. Second, each node can only find some indices of key spaces that are shared with the other side, without revealing unshared key information. Lastly, it substantially improves resilience of network against node capture. Performance and security analyses have proven that our scheme is suitable for sensor networks in terms of performance and security aspects.

A Time Synchronization Protocol for Wireless Body Sensor Networks (무선 인체 센서 네트워크용 시각 동기화 프로토콜)

  • Bae, Shi-Kyu
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.6
    • /
    • pp.127-134
    • /
    • 2016
  • WBSN (Wireless Body Sensor Network), also called WBAN (Wireless Body Area Networks) generally, is a kind of WSN (Wireless Sensor Network) applications, which is composed of the various sensor nodes residing in human body embodied or in wearable way. The measured data at each sensor node in WBSN requires being synchronized at sink node for exact analysis for status of human body, which is like WSN. Although many time synchronization protocols for WSN has been already developed, they are not appropriate to WBSN. In this paper, a new time synchronization protocol for WBSN considering the characteristics of WBSN is proposed. The proposed scheme is not only simple, but also consumes less power, leading to increasing network life time. We will show that the proposed scheme is appropriate to WBSN by evaluating its performance by simulation.

A Spatio-Temporal Geocasting Protocol Using Regional Caching in Vehicular Ad-Hoc Networks (VANET 망에서 지역적 캐싱을 이용하는 시공간 지오캐스팅 프로토콜)

  • Lee, Hyunkyu;Shin, Yongje;Choi, Hyunsuk;Lee, Euisin;Park, Soochang
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.6
    • /
    • pp.137-144
    • /
    • 2018
  • Vehicular Ad-hoc Networks (VANETS) have enabled to provide a variety of applications such as accident notification, content usage, etc. These applications have spatio-temporal data which have an interesting region and a lifetime according to their properties. However, geocasting protocols to deliver data to an interesting region can provide data to all vehicles in the region through a single transmission only at the current time, but cannot provide data to vehicles passing through the region during the lifetime of the data. Thus, we propose a spatio-temporal geocasting protocol called STGP using a regional caching scheme to send data to vehicles in an interesting region during a data lifetime in VANETs. For efficient and reliable regional caching, the proposed protocol uses the beacon-based data sharing, the extra caching elimination, and the distance-based caching exchange. Simulation results verify that the proposed protocol achieves more reliable and efficient data delivery compared with the existing protocol.