• Title/Summary/Keyword: multi-hop communications

Search Result 243, Processing Time 0.021 seconds

Multi-hop Relay 기반 협력 통신 기술

  • Yu, Byeong-Uk;Lee, Gyu-Ha;Park, Won-U;Kim, Hyeon-Do;Lee, Chung-Yong
    • Information and Communications Magazine
    • /
    • v.24 no.5
    • /
    • pp.84-97
    • /
    • 2007
  • MIMO 기술은 데이터 전송률을 증대시키고 수신 성능을 향상시킬 수 있는 다중 안테나 기술로써 각광받아왔다. 그러나 단말 크기의 제한으로 인하여 구현에 큰 어려움이 따르게 되었고 이를 해결하기 위해서 하나의 안테나를 갖고 있는 단말간 서로 협력(cooperation) 하여 데이터 전송률을 높이고 수신 성능을 향상시키기 위한 연구가 논의되고 있다. 특히 ad-hoc 이나 mesh 네트워크에서의 다중 홉 기술을 기반으로 단말간 서로 협력하여 채널 용량을 늘리고 수신 성능을 향상시키기 위한 다양한 연구가 진행 중이다. 본 고에서는 다중 홉 중계 기술에 대한 기본적인 개념과 협력 통신 기술, 그리고 IEEE 802.16j 표준화 동향에 대해 살펴본다. 이론적인 채널 용량 분석과 중계(relay)의 목적에 대해 알아보고 중계 기법에 따른 채널 용량을 분석한다. 더 나아가 다중 홉 중계 전송 기법의 성능을 분석하고 다중 홉 지원을 위한 표준화 동향 및 프레임 구조를 알아본다. 마지막으로 다이버시티 이득과 다중화 이득을 얻을 수 있는 협력통신 기술에 대해 살펴본다.

Efficient Cluster Radius and Transmission Ranges in Corona-based Wireless Sensor Networks

  • Lai, Wei Kuang;Fan, Chung-Shuo;Shieh, Chin-Shiuh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1237-1255
    • /
    • 2014
  • In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

A novel routing protocol for cognitive radio networks with cooperation process

  • Kim, Sunwoo;Pyeon, Dohoo;Jang, Ingook;Yoon, Hyunsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3860-3875
    • /
    • 2014
  • Cognitive radio networks (CRNs) are composed of mobile users who can use multiple spectrum bands for communication. CRNs allow unlicensed users (called cognitive users) to efficiently utilize unused licensed spectrums without interfering with communications of licensed users (called primary users). The main goals of CRNs are to mitigate spectrum saturation and to improve spectrum utilization. This paper introduces state-of-the-art routing protocols for CRNs and addresses some limitations of these protocols. To resolve the limitations, we suggest a new research direction for routing protocols in CRNs. We implement our protocol to compare with the existing routing protocols for multi-hop CRNs. Our protocol shows good performance compared to the existing routing protocols in terms of network performance and PU protection.

Common Control Channel Allocation in Cognitive Radio Networks through UWB Communication

  • Masri, Ahmed M.;Chiasserini, Carla-Fabiana;Casetti, Claudio;Perotti, Alberto
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.710-718
    • /
    • 2012
  • The implementation of a common control channel is one of the most challenging issues in cognitive radio networks, since a fully reliable control channel cannot be created without reserving bandwidth specifically for this purpose. In this paper, we investigate a promising solution that exploits the ultra wide band (UWB) technology to let cognitive radio nodes discover each other and exchange control information for establishing a communication link. The contribution of this paper is threefold: (i) We define the communication protocol needed to let cognitive radio nodes discover each other and exchange control information for link set up, (ii) we overcome the gap in coverage, which typically exists between UWB and long-medium range technologies, by using multi-hop communication, (iii) we evaluate the performance of our approach by adopting an accurate channel model and show its benefits with respect to an in-band signaling solution.

Decentralized Frequency Allocation Scheme in Vehicle-mounted Mobile Relay System (차량 탑재형 이동 중계기의 분산 주파수 분할 기법)

  • Shin, Yun-Jae;Lee, Jung-Ryun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7C
    • /
    • pp.592-600
    • /
    • 2012
  • In this paper, we proposed that decentralized frequency allocation scheme(DFAS) without network entry procedure between relays in mobile relay system. Frequency Indicator(FI) signal which is the reference signal of frequency division of each relay and Energy Detection(ED) region are defined. In addition, the mobile connected to the relay transmits the FI signal to neighbor relays in order to facilitate communication between relays. Finally, by using this scheme, the cell throughput improvement is confirmed.

DiffServ-Aware Pricing for Wireless Internet

  • Lee, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.550-564
    • /
    • 2012
  • In this work we propose a new pricing scheme for the wireless Internet services over WiMAX system. First, let us review the characteristics of wireless network which is based on multi-hop relay WiMAX system. Next, we show why usage-based and QoS-aware pricing scheme is needed in the wireless Internet. After that, we propose a theoretical model for the price of multimedia services called a DAP (DiffServ-aware pricing) scheme for the WiMAX multimedia network which takes into account the consumed radio resource of WiMAX system as well as the supported QoS in the IP backbone network. Finally, we present explicit formulae for the packet price, price of consumed radio resource, and price of consumed bytes.

A Node Status Control Algorithm in Mobile Ad-Hoc Networks (MANET 환경에서 노드 상태 제어 알고리즘)

  • Lee, Su-Jin;Choi, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.3
    • /
    • pp.188-190
    • /
    • 2014
  • In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.

Joint Power and Rate Control for QoS Guarantees in Infrastructure-based Multi-hop Wireless Network using Goal Programming

  • Torregoza, John Paul;Choi, Myeong-Gil;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1730-1738
    • /
    • 2008
  • Quality of Service (QoS) Guarantees grant ways for service providers to establish service differentiation among subscribers. On the other hand, service subscribers are also assured the level of service they paid for. In addition, the efficient level of service quality can be selected according to the subscribers' needs thus ensuring efficient use of available bandwidth. While network utility optimization techniques assure certain QoS metrics, a number of situations exist where some QoS goals are not met. The optimality of the network parameters is not mandatory to guarantee specified QoS levels. This paper proposes a joint data rate and power control scheme that guarantees service contract QoS level to a subscriber using Goal Programming. In using goal programming, this paper focuses on finding the range of feasible solutions as opposed to solving for the optimal. In addition, in case no feasible solution is found, an acceptable compromised solution is solved.

  • PDF

Packet-Level Scheduling for Implant Communications Using Forward Error Correction in an Erasure Correction Mode for Reliable U-Healthcare Service

  • Lee, Ki-Dong;Kim, Sang-G.;Yi, Byung-K.
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.160-166
    • /
    • 2011
  • In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

Lambda Routing Table based Dynamic Routing Scheme and Its Characteristics on GMPLS Network (GMPLS 네트워크에서 Lambda Routing Table 조회형 동적 라우팅 방식 및 특성)

  • Kwon Ho-jin;Kim Young-bu;Han Chi-moon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.938-945
    • /
    • 2004
  • This paper describes the problems of the existing two multi-layer routing policies(policy 1 and policy 2) and suggests new multi-layer routing policy(policy 3) which is established the packet LSP by inquiry on packet LSP lambda routing tables for GMPLS based optical If Network. All policies of multi-layer routing schemes first try to allocate a newly requested electrical path to an existing optical path that directly connects the source and destination nodes. U such a path is not available, all policies employ different procedures. Policy 1 tries to find available existing optical paths with two or more hops that connect the source and destination nodes and policy 2 tries to establish a new one-hop optical path between source and destination nodes. Policy 3 tries to establish a new one-hop optical path by inquiry on information of the packet LSP lambda routing tables between source and destination nodes. The performances of the three multi-routing policies are evaluated by computer simulation. Simulation results show that policy 3 is the excellent of routing time and traffic acceptance capabilities compare to existing two polices if p is large, where p is the number of packet-switching-capable ports p.