• Title/Summary/Keyword: Cooperative Networks

Search Result 533, Processing Time 0.018 seconds

Social Incentives for Cooperative Spectrum Sensing in Distributed Cognitive Radio Networks

  • Feng, Jingyu;Lu, Guangyue;Min, Xiangcen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.355-370
    • /
    • 2014
  • Cooperative spectrum sensing has been considered as a promising approach to improve the sensing performance in distributed cognitive radio networks. However, there may exist some selfish secondary users (SUs) who are unwilling to cooperate. The presence of selfish SUs could cause catastrophic damage to the performance of cooperative spectrum sensing. Following the social perspective, we propose a Social Tie-based Incentive Scheme (STIS) to deal with the selfish problem for cooperative spectrum sensing in distributed cognitive radio networks. This scheme inspires SUs to contribute sensing information for the SUs who have social tie but not others, and such willingness varies with the strength of social tie value. The evaluation of each SU's social tie derives from its contribution for others. Finally, simulation results validate the effectiveness of the proposed scheme.

Power Allocation for OFDM-Based Cooperative Relay Systems

  • Wu, Victor K. Y.;Li, Ye (Geoffrey);Wylie-Green, Marilynn P.;Reid, Tony;Wang, Peter S. S.
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.156-162
    • /
    • 2008
  • Cooperative relays can provide spatial diversity and improve performance of wireless communications. In this paper, we study subcarrier power allocation at the relays for orthogonal frequency division multiplexing (OFDM)-based wireless systems. For cooperative relay with amplify-and-forward (AF) and decode-and-forward (DF) algorithms, we investigate the impact of power allocation to the mutual information between the source and destination. From our simulation results on word~error-rate (WER) performance, we find that the DF algorithm with power allocation provides better performance than that of AF algorithm in a single path relay network because the former is able to eliminate channel noise at each relay. For the multiple path relay network, however, the network structure is already resistant to noise and channel distortion, and AF approach is a more attractive choice due to its lower complexity.

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.

Energy Saving in Cluster-Based Wireless Sensor Networks through Cooperative MIMO with Idle-Node Participation

  • Fei, Li;Gao, Qiang;Zhang, Jun;Wang, Gang
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.231-239
    • /
    • 2010
  • In cluster-based wireless sensor networks, the energy could be saved when the nodes that have data to transmit participate in cooperative multiple-input multiple-output (MIMO). In this paper, by making the idle nodes that have no data to transmit participate in the cooperative MIMO, it is found that much more energy could be saved. The number of the idle nodes that participate in the cooperative MIMO is optimized to minimize the total energy consumption. It is also found that the optimal number of all the nodes participating in cooperative communication does not vary with the number of nodes that have data to transmit. The proposition is proved mathematically. The influence of long-haul distance and modulation constellation size on the total energy consumption is investigated. A cooperative MIMO scheme with help-node participation is proposed and the simulation results show that the proposed scheme achieves significant energy saving.

Cooperative Content Caching and Distribution in Dense Networks

  • Kabir, Asif
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5323-5343
    • /
    • 2018
  • Mobile applications and social networks tend to enhance the need for high-quality content access. To address the rapid growing demand for data services in mobile networks, it is necessary to develop efficient content caching and distribution techniques, aiming at significantly reduction of redundant content transmission and thus improve content delivery efficiency. In this article, we develop optimal cooperative content cache and distribution policy, where a geographical cluster model is designed for content retrieval across the collaborative small cell base stations (SBSs) and replacement of cache framework. Furthermore, we divide the SBS storage space into two equal parts: the first is local, the other is global content cache. We propose an algorithm to minimize the content caching delay, transmission cost and backhaul bottleneck at the edge of networks. Simulation results indicates that the proposed neighbor SBSs cooperative caching scheme brings a substantial improvement regarding content availability and cache storage capacity at the edge of networks in comparison with the current conventional cache placement approaches.

Optimal Power Control in Cooperative Relay Networks Based on a Differential Game

  • Xu, Haitao;Zhou, Xianwei
    • ETRI Journal
    • /
    • v.36 no.2
    • /
    • pp.280-285
    • /
    • 2014
  • In this paper, the optimal power control problem in a cooperative relay network is investigated and a new power control scheme is proposed based on a non-cooperative differential game. Optimal power allocated to each node for a relay is formulated using the Nash equilibrium in this paper, considering both the throughput and energy efficiency together. It is proved that the non-cooperative differential game algorithm is applicable and the optimal power level can be achieved.

Using Range Extension Cooperative Transmission in Energy Harvesting Wireless Sensor Networks

  • Jung, Jin-Woo;Ingram, Mary Ann
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.169-178
    • /
    • 2012
  • In this paper, we study the advantages of using range extension cooperative transmission (CT) in multi-hop energy harvesting wireless sensor networks (EH-WSNs) from the network layer perspective. EH-WSNs rely on harvested energy, and therefore, if a required service is energy-intensive, the network may not be able to support the service successfully. We show that CT networks that utilize both range extension CT and non-CT routing can successfully support services that cannot be supported by non-CT networks. For a two-hop toy network, we show that range extension CT can provide better services than non-CT. Then, we provide a method of determining the supportable services that can be achieved by using optimal non-CT and CT routing protocols for EH-WSNs. Using our method and network simulations, we justify our claim that CT networks can provide better services than nonCT networks in EH-WSNs.

Optimal Power Allocation and Relay Selection for Cognitive Relay Networks using Non-orthogonal Cooperative Protocol

  • Lan, Peng;Chen, Lizhen;Zhang, Guowei;Sun, Fenggang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2047-2066
    • /
    • 2016
  • In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

An Adaptive Scheduling Scheme for Cooperative Energy Harvesting Networks

  • Ammar, Ahmed;Reynolds, Daryl
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.256-264
    • /
    • 2015
  • Energy harvesting devices have been proposed for sensor networking applications where batteries cannot be replaced, and cooperative communication schemes have been used to increase energy efficiency for wireless systems. Here, we develop transmission scheduling schemes for multi-terminal cooperative energy harvesting networks that maximize the packet delivery ratio, i.e., the probability that an event is reported successfully. We see that the proposed scheme provides virtually the same performance as the state-of-the-art threshold-based scheme, but does not require auxiliary parameter optimization. The proposed scheme also permits extensions to multiple cooperating nodes and sources, and it can be modified to accommodate fairness constraints.

Outage Analysis of Cooperative Transmission in Two-Dimensional Random Networks over Rayleigh Fading Channels

  • Tran, Trung Duy;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.4
    • /
    • pp.262-268
    • /
    • 2011
  • In this paper, we evaluate the outage performance of cooperative transmission in two-dimensional random networks. Firstly, we derive the joint distributions of the source-relay and the relay-destination links. Secondly, the outage probability for the decode-and-forward relaying system is derived when selection combining (SC) is employed at the destination. Finally, we calculate the average outage probability of the system and then attempt to express it by a simple approximate expression. The simulation results are presented to verify the accuracy of the derivations. Similar to deterministic networks, the cooperative transmission in random networks outperforms direct transmission at a high signal-to-noise ratio (SNR).