• Title/Summary/Keyword: Cooperative Networks

Search Result 531, Processing Time 0.022 seconds

Interference Cancellation Scheme for Three-hop Cooperative Relay Networks

  • Zhang, Yinghua;Wang, Lei;Liu, Jian;Peng, Yunfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4446-4462
    • /
    • 2019
  • In this paper, we focus on interference cancellation for three-hop cognitive radio networks (CRNs) over Rayleigh fading channels. In CRNs, secondary users (SUs) are allowed to opportunistically utilize the licensed spectrum during the idle time of primary users (PUs) to achieve spectrum sharing. However, the SUs maybe power constrained to avoid interference and cover a very short transmission range. We here propose an interference cancellation scheme (ICS) for three-hop CRNs to prolong the transmission range of SUs and improve their transmission efficiency. In the proposed scheme, a flexible transmission protocol is adopted to cancel the interference at both secondary relays and destinations at the same time. And a closed-form expression for the secondary outage probability over Rayleigh fading channels is derived to measure the system performance. Simulation results show that the proposed scheme can significantly reduce the secondary outage probability and increase the secondary diversity in comparison with the traditional cases.

Physical Layer Security for Two-Way Relay NOMA Systems with Energy Harvesting

  • Li, Hui;Chen, Yaping;Zou, Borong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.2094-2114
    • /
    • 2022
  • Due to the wide application of fifth generation communication, wireless sensor networks have become an indispensable part in our daily life. In this paper, we analyze physical layer security for two-way relay with energy harvesting (EH), where power splitter is considered at relay. And two kinds of combined methods, i.e., selection combining (SC) and maximum ratio combining (MRC) schemes, are employed at eavesdropper. What's more, the closed-form expressions for security performance are derived. For comparison purposes, this security behaviors for orthogonal multiple access (OMA) networks are also investigated. To gain deeper insights, the end-to-end throughput and approximate derivations of secrecy outage probability (SOP) under the high signal-to-noise ratio (SNR) regime are studied. Practical Monte-Carlo simulative results verify the numerical analysis and indicate that: i) The secure performance of SC scheme is superior to MRC scheme because of being applied on eavesdropper; ii) The secure behaviors can be affected by various parameters like power allocation coefficients, transmission rate, etc; iii) In the low and medium SNR region, the security and channel capacity are higher for cooperative non-orthogonal multiple access (NOMA) systems in contrast with OMA systems; iv) The systematic throughput can be improved by changing the energy conversion efficiency and power splitting factor. The purpose of this study is to provide theoretical direction and design of secure communication.

An Optimized Deployment Mechanism for Virtual Middleboxes in NFV- and SDN-Enabling Network

  • Xiong, Gang;Sun, Penghao;Hu, Yuxiang;Lan, Julong;Li, Kan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3474-3497
    • /
    • 2016
  • Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.

Sparsity Adaptive Expectation Maximization Algorithm for Estimating Channels in MIMO Cooperation systems

  • Zhang, Aihua;Yang, Shouyi;Li, Jianjun;Li, Chunlei;Liu, Zhoufeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3498-3511
    • /
    • 2016
  • We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.

Novel Interference Cancellation Scheme in Cooperation Communication Environment (협력통신 환경에서의 새로운 간섭제거 기법)

  • Kim, Yoon Hyun;Park, Young Sik;Shin, Dong Soo;Hwang, Yu Min;Kim, Jin Young;Rho, Jung Kyu
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.3
    • /
    • pp.98-103
    • /
    • 2014
  • In this paper, we propose and analyze a novel interference cancellation scheme in cooperation communication environment in which a large number of users exist. In cooperative communication system consisting a source, destination, and relay, ad-hoc groups undergo a rapid degradation because of interference data form adjacent ad-hoc groups. To solve these problems, we propose Zero Forcing (FC) and Minimum Mean Square Error (MMSE) and make a dent in the magnitude of interference. Finally, we can obtain orignal data using Successive Interference Cancellation (SIC). The performance of proposed scheme is analyzed in terms of a bit error probability. The results of the paper can be applied to design of various ad-hoc networks for cooperation communication systems.

Performance evaluation of cooperative MAC protocol at ad hoc networks under real traffic environments (실제적인 트래픽 환경에서 애드 혹 네트워크용 협력통신 MAC 프로토콜 성능평가)

  • Jang, Jae-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.10
    • /
    • pp.2237-2246
    • /
    • 2010
  • In this paper, the performance of a RCO-MAC protocol is evaluated using a different traffic model. Data frames are assumed to generate based on an exponential distribution from one source node and then directly to be stored into the input buffer in the source node. System throughput, average access delay and average system delay are used as a performance measure. Performance evaluation is carried out by the computer simulation. Numerical results show that the RCO-MAC scheme offers 18% higher system throughput than the rDCF scheme. In addition, the numerical results show that the RCO-MAC protocol also offers the better average system delay under any traffic load than that by the rDCF scheme, which was not obtained in the previous research due to the saturated traffic model.

The Fleet Operating Strategies for Ocean Container Carriers in a East Asian Shipping Market: A Game Theoretic Approach (동아시아 해운시장의 컨테이너선사 선대 운항전략: 게임이론 접근법)

  • Park, Byungin
    • Journal of Korea Port Economic Association
    • /
    • v.29 no.4
    • /
    • pp.73-95
    • /
    • 2013
  • This paper analyzes a competitive shipping market in East Asia in order to explore how container carriers make decisions on ship size, number of ships, service frequency, and service route. A sequential-move game based on non-cooperative game theory is applied to establish the models for the decision-makings involving the transportation volumes, freight rates, costs, and market shares of the service routes from Shanghai or Hong Kong to the ports in Busan, Gwangyang, and Incheon. According to the sub-game perfect Nash equilibrium solutions proposed by these models, carriers' decisions in such a competitive environment vary depending on sailing distance, transport demand, and freight rates. Therefore, carriers are recommended to reflect the optimal equilibrium solutions and a variety of decision factors when formulating strategies for transportation networks and operating fleets. Furthermore, ports should establish management strategies for these factors to provide optimal equilibrium solutions for carriers' transportation networks.

Design of an Efficient Power Manger through the cooperative Dynamic Power Management for Ad hoc Wireless Sensor Networks (Ad hoc 무선 센서네트워크에서의 효율 전력 매니지먼트에 관한 연구)

  • Jeon, Dong-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.6
    • /
    • pp.809-814
    • /
    • 2011
  • The major resource problem in sensor networks is energy efficiency. There are two major access methods to efficiently use energy. The first is to use dynamic power management (DPM). The second is to use energy efficient protocols. In DPM methods, the OS, the power manager, is responsible for managing the proper power state of CPU and each I/O with respect to the events, but the OS is not largely concerned about the internal operation of each network protocols. Also, energy efficient protocols are mainly focused on the power saving operation of the radio PHY. In addition, in wireless sensor network most of tasks are connected to communication. In such a situation, traditional power managers can waste unpredicted power. In this paper, we introduce an efficient power manger that can reduce a lot of unwanted power consumption through cooperative power management (CPM) in communication-related tasks between each units, such as radio, sensing unit, and CPU, for ad hoc wireless sensor nodes.

Suggestions for the Sustainability of Social Cooperatives (사회적 협동조합의 지속가능성을 위한 제언)

  • Lee, DeokSoo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.5
    • /
    • pp.135-144
    • /
    • 2018
  • Recently, discussions about social economy have been actively promoted, and the establishment of social cooperatives, which is an axis of social economy, is being activated. However, because of the economic slowdown, social cooperative activities are often shrinking, and a case study is conducted on how to make social cooperatives sustainable. The results are as follows. In order for social cooperatives to cope with social change adaptation and market diversity, it is necessary to organize networks or participate in existing networks. It is also necessary that social cooperatives form different types of social cooperatives into separate organizational forms as needed. In addition, social cooperatives should make efforts to improve the quality of services and goods provided by each organization, and focus on attracting local people's empathy and participation to change the culture and atmosphere of the region. If such efforts are made, it will be possible for social cooperatives to become a sustainable economic organization.

Promotion Strategies for Daegu-Kyungbuk Mobile Cluster: Searching for Alternative Regional Innovation Governance (대구.경북 모바일 클러스터 육성전략: 지역혁신 거버넌스의 대안 모색)

  • Lee, Jeong-Hyop;Kim, Hyung-Joo
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.12 no.4
    • /
    • pp.477-493
    • /
    • 2009
  • This research aims to examine Korean regional innovation governance, find structural problems, and explore alternative strategies of regional innovation governance. Especially the alternative governance was searched through the case study of Daegu-Kyungbuk mobile cluster, of which formulation Samsung is the anchor institution. Regional innovation governance in this research is defined as a policy system to link knowledge generation & diffusion subsystem and knowledge application & exploitation subsystem, and institutional conditions to steer the system. "Social Capital Assessment Tool (SOCAT)" of the World Bank was utilized for the appreciation of cluster governance. The regional innovation governance of Daegu-Kyungbuk mobile cluster is characterized as production networks dominated by one-to-one relationship between Samsung and hardware/software developers, decentralized R&D networks and policy networks with multiple hubs. Major policy agents have not developed networks with local companies, and rare are interactions between the policy agents. Local companies, especially software developers, responded they have had experiences to cooperate for local problem solving and shared their community goal, however, the degree of trust in major local project leaders is not high. Local hardware/software developers with core technologies need to be cooperative to develop similar technologies or products in Daegu-Kyungbuk mobile cluster. Regional administrative actors, such as the City of Daegu and Kyungsangbuk-do, and diverse innovation-related institutes should build cooperative environment where diverse project-based cooperation units are incessantly created, taken apart, and recreated.

  • PDF