• Title/Summary/Keyword: Cooperative 통신

Search Result 742, Processing Time 0.032 seconds

Outage Probability and Throughput Management Using CoMP under the Coexistence of PS-LTE and LTE-R Networks (안전망과 철도망 공존환경에서 협력통신을 이용한 아웃티지 및 수율 관리)

  • Lim, WonHo;Jeong, HyoungChan;Ahmad, Ishtiaq;Chang, KyungHi
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.6
    • /
    • pp.595-603
    • /
    • 2016
  • In the Republic of Korea, the LTE-based public safety (PS-LTE) network is being built for the 700 MHz frequency band. However, the same bands are also assigned to the LTE-based high-speed railway (LTE-R) network. Therefore, it is essential to utilize the co-channel interference management schemes for the coexistence of two LTE networks in order to increase the system throughput and to reduce the user outage probability. In this paper, we focus on the downlink (DL) system for the coexistence of PS-LTE and LTE-R networks by considering non radio access network (RAN) sharing and LTE-R RAN sharing by PS-LTE users (UEs) to analyze the UE throughput. Moreover, we also utilize the cooperative communications schemes, such as coordinated multipoint (CoMP) for the coexistence of PS-LTE and LTE-R networks in order to reduce the UE outage probability. We categorize the coexistence of PS-LTE and LTE-R networks into four different scenarios, and evaluate the performance of each scenario by the important performance indexes, such as UE average throughput and UE outage probability.

On the Optimal Selection of Wireless Access in Interoperating Heterogeneous Wireless Networks (3G/WLAN/휴대인터넷 연동상황을 고려한 사용자의 최적 무선접속서비스 선택방법에 대한 연구)

  • Cho Geun-Ho;Choe Jin-Woo;Jun Sung-Ik;Kim Young-Sae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.456-477
    • /
    • 2006
  • Due to advances in wireless communication technology and increasing demand for various types of wireless access, cellular, WLAN, and portable internet(such as WiBro and IEEE 802.16) systems are likely to be integrated into a unified wireless access system. This expectation premises the availability of multi-mode handsets and cooperative interworking of heterogenous wireless access networks allied by roaming contracts. Under such environments, a user may lie in the situation where more than one wireless accesses are available at his/her location, and he/she will want to choose the 'best' access among them. In this paper, we define the 'best' access(es) as the access(es) that charges minimum cost while fulfilling the required QoS of wireless access, and address the problem of choosing the optimal set of accesses theoretically by introducing a graph representation of service environment. Two optimal selection algorithms are proposed, which individually consider cases where single or multiple wireless access can be supported by multi-mode handsets.

A Design of Enhanced Lower-Power Data Dissemination Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 개선된 저전력형 데이터 확산 프로토콜 설계)

  • Choi Nak-Sun;Kim Hyun-Tae;Kim Hyoung-Jin;Ra In-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.437-441
    • /
    • 2006
  • Wireless sensor network consists of sensor nodes which are disseminated closely to each other to collect informations for the various requests of a sensor application applied for sensing phenomenons in real world. Each sensor node delivers sensing informations to an end user by conducting cooperative works such as processing and communicating between sensor nodes. In general, the power supply of a sensor node is depends on a battery so that the power consumption of a sensor node decides the entire life time of a sensor network. To resolve the problem, optimal routing algorithm can be used for prolong the entire life time of a sensor network based on the information on the energy level of each sensor node. In this paper, different from the existing Directed Diffusion and SPTN method, we presents a data dissemination protocol based on lower-power consumption that effectively maximizes the whole life time of a sensor network using the informations on the energy level of a sensor node and shortest-path hops. With the proposed method, a data transfer path is established using the informations on the energy levels and hops, and the collected sensing information from neighboring nodes in the event-occurring area is merged with others and delivered to users through the shortest path.

  • PDF

Cooperative Power Control Scheme for a Spectrum Sharing System

  • Ban, Tae-Won;Jung, Bang-Chul
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.6
    • /
    • pp.641-646
    • /
    • 2011
  • In this paper, we investigate a power control problem which is very critical in underlay-based spectrum sharing systems. Although an underlay-based spectrum sharing system is more efficient compared to an overlay-based spectrum sharing system in terms of spectral utilization, some practical problems obstruct its commercialization. One of them is a real-time-based power adaptation of secondary transmitters. In the underlay-based spectrum sharing system, it is essential to adapt secondary user's transmit power to interference channel states to secure primary users' communication. Thus, we propose a practical power control scheme for secondary transmitters. The feedback overhead of our proposed scheme is insignificant because it requires one-bit signaling, while the optimal power control scheme requires the perfect information of channel states. In addition, the proposed scheme is robust to feedback delay. We compare the performance of the optimal and proposed schemes in terms of primary user's outage probability and secondary user's throughput. Our simulation results show that the proposed scheme is almost optimal in terms of both primary user's outage probability and secondary user's throughput when the secondary user's transmit power is low. As the secondary user's transmit power increases, the primary user's outage probability of the proposed scheme is degraded compared with the optimal scheme while the secondary user's throughput still approaches that of the optimal scheme. If the feedback delay is considered, however, the proposed scheme approaches the optimal scheme in terms of both the primary user's outage probability and secondary user's throughput regardless of the secondary user's transmit power.

Design and Implementation on-line Real-time Video Communication Learning System(RVCLS) for Web-based Project Learning (웹기반 프로젝트 학습을 지원하는 실시간 화상학습시스템의 설계 및 구현)

  • Choi, Gil-Su;Kim, Dong-Ho
    • Journal of The Korean Association of Information Education
    • /
    • v.7 no.1
    • /
    • pp.80-90
    • /
    • 2003
  • In this paper, we designed the on-line Real-time Video Communication Learning System(RVCLS) for Web-based project learning and develop programs for test groups. And we have also analyzed how the Web-based learning using RVCLS change the students' perception on the classroom environment, using the WIHIC which is the classroom environment examination tool As a result, the Web-based project learning activities using RVCLS had affirmative effects on the eight areas of classroom environment such as students unity, teacher support, participation in class, spontaneity, exploration activities, task-oriented mind, cooperative attitude, and equality. Also, the web -based project learning using RVCLS is expected to help students enhance the self-directed learning capacity and increase abilities to use ICT.

  • PDF

Development of a Secure Routing Protocol using Game Theory Model in Mobile Ad Hoc Networks

  • Paramasivan, Balasubramanian;Viju Prakash, Maria Johan;Kaliappan, Madasamy
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.75-83
    • /
    • 2015
  • In mobile ad-hoc networks (MANETs), nodes are mobile in nature. Collaboration between mobile nodes is more significant in MANETs, which have as their greatest challenges vulnerabilities to various security attacks and an inability to operate securely while preserving its resources and performing secure routing among nodes. Therefore, it is essential to develop an effective secure routing protocol to protect the nodes from anonymous behaviors. Currently, game theory is a tool that analyzes, formulates and solves selfishness issues. It is seldom applied to detect malicious behavior in networks. It deals, instead, with the strategic and rational behavior of each node. In our study,we used the dynamic Bayesian signaling game to analyze the strategy profile for regular and malicious nodes. This game also revealed the best actions of individual strategies for each node. Perfect Bayesian equilibrium (PBE) provides a prominent solution for signaling games to solve incomplete information by combining strategies and payoff of players that constitute equilibrium. Using PBE strategies of nodes are private information of regular and malicious nodes. Regular nodes should be cooperative during routing and update their payoff, while malicious nodes take sophisticated risks by evaluating their risk of being identified to decide when to decline. This approach minimizes the utility of malicious nodes and it motivates better cooperation between nodes by using the reputation system. Regular nodes monitor continuously to evaluate their neighbors using belief updating systems of the Bayes rule.

Network-Coding-Based Coded Cooperation

  • Wu, Suwen;Zhu, Jinkang;Qiu, Ling;Zhao, Ming
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.366-374
    • /
    • 2010
  • Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

Development of Lane-level Dynamic Location Referencing Method (차로 수준의 동적위치참조 방법 개발)

  • Yang, Inchul;Jeon, Woo Hoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.5
    • /
    • pp.188-199
    • /
    • 2018
  • In this study a novel dynamic lane-level location referencing method(LLRM) was developed. The terminologies were defined and the prerequisites were suggested for the LLRM. Then, the logical and physical data formats were proposed, followed by the development of encoding and decoding algorithms. To conduct a performance test of the proposed method, two different high precision digital maps were prepared as well as an evaluation tool. The test results demonstrated that the proposed method works perfectly in terms of accuracy. The processing speed and the data size were found to be less efficient, but it is expected that the defect would be compensated soon enough due to the fast growing technology of ICT and computer hardwares.

Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

  • Bassily, Raef;Ulukus, Sennur
    • Journal of Communications and Networks
    • /
    • v.14 no.4
    • /
    • pp.352-363
    • /
    • 2012
  • In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

A Study on Distributed Cooperation Intrusion Detection Technique based on Region (영역 기반 분산협력 침입탐지 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.14 no.7
    • /
    • pp.53-58
    • /
    • 2014
  • MANET can quickly build a network because it is configured with only the mobile node and it is very popular today due to its various application range. However, MANET should solve vulnerable security problem that dynamic topology, limited resources of each nodes, and wireless communication by the frequent movement of nodes have. In this paper, we propose a domain-based distributed cooperative intrusion detection techniques that can perform accurate intrusion detection by reducing overhead. In the proposed intrusion detection techniques, the local detection and global detection is performed after network is divided into certain size. The local detection performs on all the nodes to detect abnormal behavior of the nodes and the global detection performs signature-based attack detection on gateway node. Signature DB managed by the gateway node accomplishes periodic update by configuring neighboring gateway node and honeynet and maintains the reliability of nodes in the domain by the trust management module. The excellent performance is confirmed through comparative experiments of a multi-layer cluster technique and proposed technique in order to confirm intrusion detection performance of the proposed technique.