• Title/Summary/Keyword: Cooperative protocol

Search Result 222, Processing Time 0.022 seconds

BER Performance Analysis for Adaptive Cooperation Scheme with Decode-and-Forward Relay-Selection (복호 후 전달 릴레이 선택을 이용한 적응형 협력 기법의 BER 성능분석)

  • Vu, Ha Nguyen;Kong, Hyung-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11A
    • /
    • pp.831-843
    • /
    • 2009
  • In this paper, we propose a new adaptive cooperation scheme with multi-relay nodes which achieves higher performance and spectral efficiency than that of some conventional cooperative schemes. The relay-selection is applied to choose the most potential relay among K ones. Afterward, the instantaneous signal-to-noise ratio (SNR) differences between S-D, S-R and R-D channels are considered for adaptive selection between the direct and the cooperation transmission strategy. In the proposed adaptive protocol, if the direct link is of high quality, the source will transmit to destination directly with all power consumption. Otherwise, the source broadcasts the signal with a lower power and requires the help of the chosen relay if it decodes correctly, else the source will transmit again with remaining power. Firstly, the spectral efficiency is derived by calculating the probability of each mode. Subsequently, the BER performance for the adaptive cooperation scheme is analyzed by considering each event that one of K relays is selected and then making the summation of all. Finally, the numerical results are presented to confirm the performance enhancement offered by the proposed schemes.

Link Energy Efficiency Routing Strategy for Optimizing Energy Consumption of WBAN (WBAN의 에너지 소비 최적화를 위한 링크 에너지 효율 라우팅 전략)

  • Lee, Jung-jae
    • Journal of Internet Computing and Services
    • /
    • v.23 no.5
    • /
    • pp.1-7
    • /
    • 2022
  • IoT technology that utilizes wireless body area networks (WBAN) and biosensors is an important field in the health industry to minimize resources and monitor patients. In order to integrate IoT and WBAN, a cooperative protocol that constitutes WBAN's limited sensor nodes and rapid routing for efficient data transmission is required. In this paper we propose an we propose an energy efficient and cooperative link energy-efficient routing strategy(LEERS) to solve the problems of redundant data transmission detection and limited network sensor lifetime extention. The proposed scheme considers the hop count node congestion level towards the residual energy sink and bandwidth and parameters. In addition, by determining the path cost function and providing effective multi-hop routing, it is shown that the existing method is improved in terms of residual energy and throughput

Performance Analysis of the Amplify-and-Forward Scheme under Interference Constraint and Physical Layer Security (물리 계층 보안과 간섭 제약 환경에서 증폭 후 전송 기법의 성능 분석)

  • Pham, Ngoc Son;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.179-187
    • /
    • 2014
  • The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

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.

An Automatic Repeating Protocol in Cooperative Spectrum Sharing (협력적 스펙트럼 공유의 자동 반복 프로토콜)

  • Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.6
    • /
    • pp.101-108
    • /
    • 2013
  • In this paper, we propose a method in which the negative acknowledge (NACK) message is used as command for cooperation and spectrum sharing. This allows for an automatic request for cooperation and sharing when the direct link of the primary user is in outage, and also allows for saving the number of control messages in cooperation-spectrum sharing based paradigm. In the sharing phase, the selected relay shares a power fraction of $1-{\alpha}$ for secondary transmitted signal while the remaining of ${\alpha}$ is for primary retransmitted signal. In the case of no relay collected, primary transmitter uses NACK as a command to retransmit the signal with fully power fraction (${\alpha}=1$). Both systems are assumed to employ BPSK signals. In this scheme, we propose the joint optimal decoding in the secondary user. The frame error rate (FER) performance at both systems is then analyzed. The theoretical and simulation results validate the analysis and confirm the efficiency of the protocol.

A New Interference-Aware Dynamic Safety Interval Protocol for Vehicular Networks

  • Yoo, Hongseok;Chang, Chu Seock;Kim, Dongkyun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.2
    • /
    • pp.1-13
    • /
    • 2014
  • In IEEE 802.11p/1609-based vehicular networks, vehicles are allowed to exchange safety and control messages only within time periods, called control channel (CCH) interval, which are scheduled periodically. Currently, the length of the CCH interval is set to the fixed value (i.e. 50ms). However, the fixed-length intervals cannot be effective for dynamically changing traffic load. Hence, some protocols have been recently proposed to support variable-length CCH intervals in order to improve channel utilization. In existing protocols, the CCH interval is subdivided into safety and non-safety intervals, and the length of each interval is dynamically adjusted to accommodate the estimated traffic load. However, they do not consider the presence of hidden nodes. Consequently, messages transmitted in each interval are likely to overlap with simultaneous transmissions (i.e. interference) from hidden nodes. Particularly, life-critical safety messages which are exchanged within the safety interval can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning. In this paper, we therefore propose a new interference-aware Dynamic Safety Interval (DSI) protocol. DSI calculates the number of vehicles sharing the channel with the consideration of hidden nodes. The safety interval is derived based on the measured number of vehicles. From simulation study using the ns-2, we verified that DSI outperforms the existing protocols in terms of various metrics such as broadcast delivery ration, collision probability and safety message delay.

Mutual Authentication Protocol for Safe Data Transmission of Multi-distributed Web Cluster Model (다중 분산 웹 클러스터모델의 안전한 데이터 전송을 위한 상호 인증 프로토콜)

  • Lee, Kee-Jun;Kim, Chang-Won;Jeong, Chae-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.8C no.6
    • /
    • pp.731-740
    • /
    • 2001
  • Multi-distributed web cluster model expanding conventional cluster system is the cluster system which processes large-scaled work demanded from users with parallel computing method by building a number of system nodes on open network into a single imaginary network. Multi-distributed web cluster model on the structured characteristics exposes internal system nodes by an illegal third party and has a potential that normal job performance is impossible by the intentional prevention and attack in cooperative work among system nodes. This paper presents the mutual authentication protocol of system nodes through key division method for the authentication of system nodes concerned in the registration, requirement and cooperation of service code block of system nodes and collecting the results and then designs SNKDC which controls and divides symmetrical keys of the whole system nodes safely and effectively. SNKDC divides symmetrical keys required for performing the work of system nodes and the system nodes transmit encoded packet based on the key provided. Encryption packet given and taken between system nodes is decoded by a third party or can prevent the outflow of information through false message.

  • PDF

The RTP Payload Format for Telepointing (원격지정을 위한 RTP 페이로드 형식)

  • Jeon, Jae-U;Baek, Hui-Suk;O, Sam-Gwon;Im, Gi-Uk
    • The KIPS Transactions:PartA
    • /
    • v.9A no.1
    • /
    • pp.29-36
    • /
    • 2002
  • For the efficient collaboration awareness, the CSCW (Computer-Supported Cooperative Work) systems provide functions such as telepointing, snap-shot, and document/project tracking. Among these, telepointing allows an event occurrence on the shared window of a local computing system to be presented in remote computing systems. Although telepointing has been mentioned in the literature, few research papers deal with the functional requirements and protocols for telepointing. This parer describes the functional requirements and payload format for RTP (Real-Time Transport Protocol)-based telepointing. In order to evaluate the performance of the proposed RTP-barred telepointing, we have implemented a whiteboard and compared it with that of the Microsoft Netmeeting. The evaluation results show that the proposed telepointing performs better in terms of CPU usage and the amount of network traffic.

Design and Implementation of collaborative system for mobile devices (모바일 기기를 위한 협동작업 시스템의 구현)

  • 이은령;김지용;김두현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.512-521
    • /
    • 2003
  • In this paper, we introduce our experience of the design and implementation of mobile collaboration system(MCS) that support people using mobile devices to participate in cooperative session. There are considerable differences between desktop PC and mobile devices like PDA in processing ability, resolution of display and color degree. In the case of mobile devices, they use different processors and different operating system and they have even differences in ability of executing application. The mobile collaborative system based on T.120 protocol of ITU-T standard compromised of mobile collaboration server, mobile collaboration client, session node and application. We also define the session node in desktop PC in which session control block and communication block runs. This node provide functions of session control block and communication block to mobile collaboration clients and so lighten load of clients. The mobile collaboration server provides information of candidates for session node, session and user to mobile collaboration client. And this server support clients to configure their own session node and manage sessions. Only the mobile collaboration client module and applications including APE are executed in a mobile device when user using mobile devices would like to participate in cooperative session. We implemented mobile collaboration client and applications with JAVA to support platform independency.

Method for Hybrid Cooperative Sharing applied Automatic Request Protocol (자동 반복 프로토콜을 적용한 하이브리드 협력 공유 기법)

  • Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.105-110
    • /
    • 2015
  • In cognitive radio networks, when the signal-to-noise ratio (SNR) of the link between a primary transmitter and receiver is sufficiently high, the primary transmission does not frequently demand cooperation because direct transmission of the primary communication is usually successful. Therefore, there are few opportunities for a secondary transmitter to cooperate with the primary user system in exchange for an opportunity to share the spectrum. This article proposes a scheme in which the secondary system can deliberately degrade the SNR of the primary transmission, making it so that the primary system needs cooperation from the secondary nodes, and thereby increases opportunities for spectrum sharing.