• 제목/요약/키워드: Cooperative mechanism

검색결과 142건 처리시간 0.021초

무선인지시스템을 위한 선택적 협력 스펙트럼 검출 기법 (Selection Based Cooperative Spectrum Sensing in Cognitive Radio)

  • 웬탄난;공형윤;구인수
    • 인터넷정보학회논문지
    • /
    • 제12권2호
    • /
    • pp.1-8
    • /
    • 2011
  • 본 논문에서는 무선인지시스템에서 스펙트럼 센싱을 효율적으로 수행하기 위한 선택적 협력 스펙트럼 검출 기법을 제안한다. 제안된 알고리즘에서는 각 무선인지 사용자가 자신의 유도비(likelihood ratio)를 기반으로 자신의 센싱 신뢰도를 평가하고, 센싱 신뢰도에 따른 타이머를 활용하는 경쟁기반의 센싱 결과 보고 메커니즘을 활용한다. 이를 통해, 제안된 선택적 협력 스펙트럼 기법에서는 가장 높은 센싱 신뢰도를 갖는 무선인지 사용자만이 국부 스펙트럼 센싱값을 융합센터로 전송함으로써, 스펙트럼 센싱의 성능을 일정한 레벨로 유지하고, 협력 스펙트럼 센싱의 단점인 제어 트래픽 및 협력 센싱 시간을 줄이는 이점을 갖는다.

인지 무선 통신을 위한 협력 릴레이 센싱 성능 (Performance of Spectrum Sensing Using Cooperative Relay for Cognitive Radio System)

  • 이미선;김윤현;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제7권1호
    • /
    • pp.7-12
    • /
    • 2012
  • 본 논문에서는 인지무선통신에서 중요한 기술 중 하나인 스펙트럼 센싱의 Hidden node의 문제나 셀룰라 시스템에서 셀 경계에서 CPE(Customer-Primise equipments)의 낮은 SNR(Signal to Noise Ratio)로 인한 센싱 성능 저하를 해결하기 위해 CPE들의 협력릴레이 기법을 사용한 협력 스펙트럼 센싱을 제안하고 검출확률 성능을 분석한다. 송신단과 수신단 사이의 릴레이(Relay) 적용된 협력 스펙트럼 센싱은 가상의 공간 다이버시티이득(Spatial Diversity Gain)을 얻을 수 있어 센싱 성능이 향상된다. 협력 통신 기법 중 AF(Amplify and Forward)와 DF(Decoded and Forward)방식이 대표적이다. 따라서 이 두가지 협력통신 기법을 적용하여 협력스펙트럼 센싱의 검출확률의 성능을 비교하고 분석한다.

Supporting Trusted Soft Decision Scheme Using Volatility Decay in Cooperative Spectrum Sensing

  • Zhao, Feng;Feng, Jingyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2067-2080
    • /
    • 2016
  • Cooperative spectrum sensing (CSS) for vacant licensed bands is one of the key techniques in cognitive radio networks. Currently, sequential probability ratio test scheme (SPRT) is considered as a powerful soft decision approach to improve the sensing result for CSS. However, SPRT assumes all secondary users (SU) are honest, and thus offering opportunities for malicious SUs to launch the spectrum sensing data falsification attack (SSDF attack). To combat such misbehaved behaviors, recent efforts have been made to trust mechanism. In this paper, we argue that powering SPRT with traditional trust mechanism is not enough. Dynamic SSDF attackers can maintain high trust in an alternant process of submitting honest or false sensing data, resulting in difficultly detecting them. Noting that the trust value of dymamic SSDF attackers behave highly volatile, a novel trusted SPRT scheme (VSPRT) based on volatility decay analysis is proposed in this paper to mitigate the harmful effect of dynamic SSDF attackers in the process of the soft-decision data fusion, and thus improving the accuracy of the final sensing result. Simulation results show that the VSPRT scheme outperforms the conventional SPRT schemes.

Deep Learning based Loss Recovery Mechanism for Video Streaming over Mobile Information-Centric Network

  • Han, Longzhe;Maksymyuk, Taras;Bao, Xuecai;Zhao, Jia;Liu, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4572-4586
    • /
    • 2019
  • Mobile Edge Computing (MEC) and Information-Centric Networking (ICN) are essential network architectures for the future Internet. The advantages of MEC and ICN such as computation and storage capabilities at the edge of the network, in-network caching and named-data communication paradigm can greatly improve the quality of video streaming applications. However, the packet loss in wireless network environments still affects the video streaming performance and the existing loss recovery approaches in ICN does not exploit the capabilities of MEC. This paper proposes a Deep Learning based Loss Recovery Mechanism (DL-LRM) for video streaming over MEC based ICN. Different with existing approaches, the Forward Error Correction (FEC) packets are generated at the edge of the network, which dramatically reduces the workload of core network and backhaul. By monitoring network states, our proposed DL-LRM controls the FEC request rate by deep reinforcement learning algorithm. Considering the characteristics of video streaming and MEC, in this paper we develop content caching detection and fast retransmission algorithm to effectively utilize resources of MEC. Experimental results demonstrate that the DL-LRM is able to adaptively adjust and control the FEC request rate and achieve better video quality than the existing approaches.

An Auctioning Mechanism for Green Radio

  • Comaniciu, Cristina;Mandayam, Narayan B.;Poor, H. Vincent;Gorce, Jean-Marie
    • Journal of Communications and Networks
    • /
    • 제12권2호
    • /
    • pp.114-121
    • /
    • 2010
  • In this paper, an auctioning strategy is proposed for cellular networks that ensures net energy savings. The pricing scheme, in conjunction with a two dimensional bid structure, incentivizes cooperation at the terminal nodes for better interference management at receivers and for cooperative relaying. It is shown that, for the proposed auctioning strategy, network operators are guaranteed revenue gains, mobile nodes' dominant strategy is to bid their true valuation of their energy resources, and overall effective energy gains occur under the assumption of a reserve price for bidding. Simulation results show that significant energy savings can be achieved by employing this auctioning mechanism for a 3G cellular set-up.

Robust Cooperative Relay Beamforming Design for Security

  • Gong, Xiangwu;Dong, Feihong;Li, Hongjun;Shao, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4483-4501
    • /
    • 2015
  • In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper. While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message. The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques. The benefit of the proposed scheme is showed in simulation results.

Regulatory Mechanism of L-Alanine Dehydrogenase from Bacillus subtilis

  • 김수자;김유진;서미란;전봉숙
    • Bulletin of the Korean Chemical Society
    • /
    • 제21권12호
    • /
    • pp.1217-1221
    • /
    • 2000
  • L-alanine dehydrogenase from Bacillus subtilis exhibits allosteric kinetic properties in the presence of $ZN^{2+}$. $ZN^{2+}$ induces the binding of substrate (L-alanine) to be cooperative at pH 8.0. The effect of pH variation between pH 7.0 and pH 10.0 on the inhibition by $ZN^{2+}$ correlates with the pH effect on the $K_m$ values for L-alanine within these pH range indicating that $ZN^{2+}$ and substrate compete for the same site. No such cooperativity is induced by $ZN^{2+}$ when the reaction is carried out at pH 10. At this higher pH, $ZN^{2+}$ binds with the enzyme with lower affinity and noncompetitive with respect to L-alanine. Inhibition of L-alanine dehydrogenase by $ZN^{2+}$ depends on the ionic strength. Increase in KCI concentration reduced the inhibition, but allosteric property in $ZN^{2+}$ binding is conserved. A model for the regulatory mechanism of L-alanine dehydrogenase as a noncooperative substrate-cooperative cofactor allosteric enzyme, which is compatible in both concerted and the sequential allosteric mechanism, is proposed.

IEEE 802.11에서 다중 릴레이를 이용한 멀티홉 방식 협력 무선통신 (Multi-Hop Cooperative Communications using Multi-Relays in IEEE 802.11)

  • 이숙현;이태진
    • 한국정보과학회논문지:정보통신
    • /
    • 제36권6호
    • /
    • pp.528-535
    • /
    • 2009
  • 본 논문에서는 IEEE 802.11 환경에서 무선 협력 통신을 이용하여 성능을 향상 시키는 방법에 대해 제안한다. 기존 협력 통신 알고리즘은 소스(source)와 AP(Access Point) 사이에 1개의 릴레이(relay)를 두어 수행한 2 홉 릴레이(hop relay) 방식으로, 이는 알맞은 릴레이를 찾을 수 없는 경우가 발생하므로 보완이 필요하다. 본 논문에서는 AP에서 네트워크 정보(노드 사이 전송률, 노드와 AP 사이 전송률)를 관리하여 릴레이 선정에 이 네트워크 정보를 이용한다. 이 정보를 이용하여 AP는 1개 이상의 릴레이를 선정하여 소스와 주위 노드에게 선정된 릴레이를 알리고 소스에서 데이터를 전송할 때 이 릴레이를 통해 협력 통신을 하도록 한다. 이러한 협력 통신 방법은 데이터 전송의 효율성을 높인다. 또한 본 논문에서는 소스의 데이터를 전송한 릴레이는 소스의 데이터를 전송한 후에 자신의 데이터 또한 전송할 수 있는 기회를 가지도록 하여 소스 데이터를 대신 전송하여 소비된 노드의 자원을 만회할 수 있는 기회를 가지게 한다. 이로써 제안된 방법을 이용하면 노드의 자원 소비를 보완함은 물론 전체 네트워크의 성능(throughput)을 향상시킬 수 있다.

Conflicts in Overlay Environments: Inefficient Equilibrium and Incentive Mechanism

  • Liao, Jianxin;Gong, Jun;Jiang, Shan;Li, Tonghong;Wang, Jingyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2286-2309
    • /
    • 2016
  • Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.