• Title/Summary/Keyword: relay node

Search Result 307, Processing Time 0.022 seconds

A New Physical Layer Transmission Scheme for LPI and High Throughput in the Cooperative SC-FDMA System

  • Li, Yingshan;Wu, Chao;Sun, Dongyan;Xia, Junli;Ryu, Heung-Gyoon
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.457-463
    • /
    • 2013
  • In recent days, cooperative diversity and communication security become important research issues for wireless communications. In this paper, to achieve low probability of interception (LPI) and high throughput in the cooperative single-carrier frequency division multiple access (SC-FDMA) system, a new physical layer transmission scheme is proposed, where a new encryption algorithm is applied and adaptive modulation is further considered based on channel state information (CSI). By doing so, neither relay node nor eavesdropper can intercept the information signals transmitted from user terminal (UT). Simulation results show above new physical layer transmission scheme brings in high transmission safety and secrecy rate. Furthermore, by applying adaptive modulation and coding (AMC) technique according to CSI, transmission throughput can be increased significantly. Additionally, low peak-to-average power ratio (PAPR) characteristic can still be remained due to the uniform distribution of random coefficients used for encryption algorithm.

Wireless Energy Transfer System with Multiple Coils via Coupled Magnetic Resonances

  • Cheon, Sanghoon;Kim, Yong-Hae;Kang, Seung-Youl;Lee, Myung Lae;Zyung, Taehyoung
    • ETRI Journal
    • /
    • v.34 no.4
    • /
    • pp.527-535
    • /
    • 2012
  • A general equivalent circuit model is developed for a wireless energy transfer system composed of multiple coils via coupled magnetic resonances. To verify the developed model, four types of wireless energy transfer systems are fabricated, measured, and compared with simulation results. To model a system composed of n-coils, node equations are built in the form of an n-by-n matrix, and the equivalent circuit model is established using an electric design automation tool. Using the model, we can simulate systems with multiple coils, power sources, and loads. Moreover, coupling constants are extracted as a function of the distance between two coils, and we can predict the characteristics of a system having coils at an arbitrary location. We fabricate four types of systems with relay coils, two operating frequencies, two power sources, and the function of characteristic impedance conversion. We measure the characteristics of all systems and compare them with the simulation results. The flexibility of the developed model enables us to design and optimize a complicated system consisting of many coils.

Digital Voice Ground Wave Range Analysis of HF Radios that Applied MELPe CODEC Using GRWAVE Program (MELPe 코덱이 적용된 HF 무전기의 GRWAVE 분석 툴을 이용한 디지털 음성 지상파 통달거리 분석)

  • Heo, Jin;Lee, Sangjin;Lee, Kangchun;Seo, Sungwon;Kim, Jungsup;Han, Sungwoo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.3
    • /
    • pp.431-440
    • /
    • 2017
  • HF communications are used as a last means of long distance communications without any relay node in NLOS (Non Line-Of-Sight) environment. Conventional analog voice communication in the HF band is vulnerable to security as well as severe background noise. To overcome these shortcoming, digital voice was introduced into HF radios in the early 1980s. In this paper, we analyze avaliable digital voice communication ground wave range of HF radios that applied MELPe CODEC and MIL-STD-188-110B physical layer standard using GRWAVE program. And we evaluate usefulness of digital voice communication in HF band.

An Effective Route Selection Scheme with Considering Traffic Density in VANET

  • An, Do-Sik;Cho, Gi-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.623-629
    • /
    • 2010
  • A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

Performance Comparison of MISP-based MANET Strong DAD Protocol

  • Kim, Sang-Chul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3449-3467
    • /
    • 2015
  • A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, Pe, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

A Generous Cooperative Routing Protocol for Vehicle-to-Vehicle Networks

  • Li, Xiaohui;Wang, Junfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5322-5342
    • /
    • 2016
  • In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

Centralized Downlink Scheduling using Directional Antennas in IEEE 802.16 based Wireless Mesh Networks (IEEE 802.16 기반의 무선 메쉬 네트워크에서 지향성 안테나를 사용하는 중앙 집중형 하향링크 스케줄링)

  • Lee, Sang-Joon;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.134-141
    • /
    • 2010
  • In this paper, we propose a scheduling algorithm to improve the performance of IEEE 802.16 based wireless mesh networks using directional antenna. The performance is presented in terms of throughput of system and delay between each node by varying number of users. The result show that proposed scheduling algorithm improving the performance by reducing the delay of mesh network system. Our work may be useful as a guideline to control the fairness between SSs for multi-hop systems such as multi-hop relay and mesh networks.

An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks (도심의 차량 네트워크에서 긴급 메시지 전파를 위한 효율적인 브로드캐스트 기법)

  • Lee, Kyu-Chang;Han, Ki-Jun;Cho, Keu-Chul;Baek, Young-Mi;Kim, Jun-Hyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.7
    • /
    • pp.605-611
    • /
    • 2013
  • If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio.

Stochastic Method of Relay Node Selection for Efficient Message Forward in DTN (DTN에서 효율적인 메시지 전달을 위한 확률적 중계 노드 선택 기법)

  • Dho, Yoon-hyung;Shin, Dong-Ryoul;Kim, Myeon-sik;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.105-106
    • /
    • 2015
  • 본 논문에서는 DTN(Delay Tolerant Network) 환경에서 효율적인 메시지 전달을 위해 확률적으로 중계 노드를 선택하는 기법을 제안한다. DTN은 종단 간 연결이 불확실한 네트워크에서의 통신을 Store-Carry-Forward 방식을 사용하여 메시지를 목적 노드에 전달한다. 또한 종단 간 연결이 불확실한 상황에서도 중계 노드를 통해 메시지를 목적 노드에 전달하여 높은 전송률을 보장한다. 하지만 에피데믹(Epidemic) 라우팅이나 Spray and Wait 라우팅과 같은 기존 다중 복사 라우팅 알고리즘은 접촉한 모든 노드에게 메시지를 복사하여 메시지 복사로 인한 오버헤드가 높아진다. 반면에 PROPHET 라우팅과 같은 단일 복사 알고리즘은 적은 오버헤드를 발생시키지만 중계 노드 수 감소로 인한 메시지 전송률 감소 현상이 나타난다. 본 논문에서 제안하는 알고리즘은 기존 DTN 라우팅의 문제점을 보완하기 위해 확률적으로 노드 분포를 분석하여 현재 네트워크에 효율적인 메시지 복사 방식을 선택하여 작동한다. 본 논문에서는 제안하는 알고리즘이 기존 DTN 라우팅 알고리즘과 오버헤드와 전송률을 비교하여 더 효율적임을 증명한다.

  • PDF

Adaptive Power allocation inenergy-constrained wireless ad-hoc networks (전력 제한된 무선 애드혹 네트워크에서의 적응적 전력할당기법)

  • Gao, Xiang;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.2
    • /
    • pp.336-342
    • /
    • 2008
  • We proposed a simple power allocation scheme to maximize network lifetime for "amplify and forward(AF)" and "decode and forward(DF)". To maximize network lifetime, it is important to allocate power fairly among nodes in a network as well as to minimize total transmitted power. In the proposed scheme, the allocated power is proportional to the residual power and also satisfies the required SNR at destination node. In this paper, we calculate power allocation in model of AF and DF. We evaluated the proposed power allocation scheme using extensive simulation and simulation results show that proposed power allocation obtains much longer network lifetime than the equal power allocation.