It has been well recognized that channel state information (CSI) feedback is of great importance for dowlink transmissions of closed-loop wireless networks. However, the existing work typically researched the CSI feedback problem for each individual mobile station (MS), and thus, cannot efficiently model the interactions among self-interested mobile users in the network level. To this end, in this paper, we propose an alternative approach to investigate the CSI feedback rate control problem in the analytical setting of a game theoretic framework, in which a multiple-antenna base station (BS) communicates with a number of co-channel MSs through linear precoder. Specifically, we first present a non-cooperative feedback-rate control game (NFC), in which each MS selects the feedback rate to maximize its performance in a distributed way. To improve efficiency from a social optimum point of view, we then introduce pricing, called the non-cooperative feedback-rate control game with price (NFCP). The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback rate. The existence of the Nash equilibrium of such games is investigated, and two types of feedback protocols (FDMA and CSMA) are studied. Simulation results show that by adjusting the pricing factor, the distributed NFCP game results in close optimal performance compared with that of the centralized scheme.
Modern cellular networks are witnessing an unprecedented evolution from classical, centralized and homogenous architectures into a mix of various technologies, in which the network devices are densely and randomly deployed in a decentralized and heterogenous architecture. This shift in network architecture requires network devices to become more autonomous and, potentially, cooperate with one another. Such cooperation can, for example, take place between interfering small access points that seek to coordinate their radio resource allocation, nearby single-antenna users that can cooperatively p…
In wireless mesh network (WMN), multiple service providers (SPs) can cooperate to share resources (e.g., relay nodes and spectrum), to serve their collective subscribed customers for better service. As a reward, SPs are able to achieve more individual benefits, i.e., increased revenue or decreased cost, through efficient utilization of shared network resources. However, this cooperation can be realized only if fair allocation of aggregated payoff, which is the sum of the payoff of all the cooperative SPs, can be achieved. We first formulate such cooperation as a coalitional game with transfera…
The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from cooperative game theory: the first approach is based on the Myerson value, whereas the second approach is based on hedonic games. Both approaches allow to detect clusters with various resolution. However,…
Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.
Cooperative diversity is a technique in which various radio terminals relay signals for each other. Cooperative diversity results when cooperative communications is used primarily to leverage the spatial diversity available among distributed radios. In this paper different cooperative diversity schemes and their applications in various wireless networks are discussed. In this paper the impact of cooperative diversity on the energy consumption and lifetime of sensor network and the impact of cooperation in cognitive radio are discussed. Here, user scheduling and radio resource allocation techni…
In wireless communication networks, when the workload increases, sources become more aggressive at the equilibrium in the game setting in comparison with the team problem by using slotted Aloha mechanism. Consequently, more packets are in collision and are lost. To reduce these phenomena and to enhance the performance of the networks, we propose to combine ZigZag decoding approach with non cooperative slotted Aloha mechanism. This approach was introduced in our previous work based on the cooperative slotted Aloha mechanism. The obtained results showed that this approach has significantly impro…
In this work we are concerned with the problem of link scheduling for throughput maximization in wireless networks that employ a cooperative amplify and forward (AF) protocol. To address this problem first we define the signal-to-interference plus noise ratio (SINR) expression for the complete cooperative AF-based transmission. Next, we formulate the problem of link scheduling as a mixed integer linear program (MILP) that uses as a constraint the developed SINR expression. The proposed formulation is motivated by the observation that the aggregate interference that affects a single cooperative…
Energy efficiency in wireless networks has become an important field of research due to ever increasing energy expenditure in battery supplied mobile terminals. In this paper we present an energy efficient routing scheme for multi-standard infrastructure wireless networks based on multi-hop cooperative relaying. The aim of the proposed technique is to exploit short-range cooperation to take benefit from mobile terminals having superior links thus enable energy efficiency. Performance results show that higher data-rate yielded by cooperation can compensate the expense of higher energy due to mu…
The dual-cross scenario of the hybrid wireless sensor networks (WSNs) is studied and a novel MIMO Cluster Cooperative Assignment Cross Layer Scheduling Scheme (MCCA-CLSS) is proposed in this paper. The comparison and the predominance of the proposed scheme are demonstrated, the clusters are optimized. With the help of the simulations, the relative energy consumption and the end-to-end blocking probability are all improved. The addressing ratio of success in the condition of the unchanged parameters and external information can be increased and the network can tolerate more hops to support reli…
Due to small size of sensor nodes deployed in Wireless Sensor Networks (WSNs), energy utilization is a key issue. Poor channel conditions lead to retransmissions and hence, result in energy wastage. Error control strategies are usually utilized to accommodate channel impairments like noise and fading in order to optimize energy consumption for network lifetime enhancement. Meanwhile, cooperative communication also emerges to be an appropriate candidate to combat the effects of channel fading. Energy efficiency of cooperative scheme when applied with Automatic Repeat Request (ARQ), Hybrid-ARQ (…
Extensive research has been done to achieve better throughput and reliability in wireless networks, with focus on multiple-input multiple-output systems. Recently, cooperative networking techniques have been investigated to increase the performance of low-cost wireless systems by using the diversity created by different single antenna devices. However, cooperative networking requires a medium access control layer able to handle source-relay-destination communications. Wireless cooperative relaying poses several challenges, being the most important one related to the relay selection mechanism, …
Cooperative communication can improve communication quality in wireless communication networks through strategic relay selection. However, wireless cooperative communication networks are vulnerable to the attacks initiated on relays. Although applying authentication protocols can secure cooperative communication when the selected relay is malicious, better system throughput could be obtained without executing authentication protocol when the selected relay is free from attacker's attack. In this paper, a game theoretic approach is proposed to quantitatively analyze the attacking strategies of …
In this poster paper we present a data dissemination transmission abstraction for over the air programming (OAP) protocol which is fundamentally different from the previous hop by hop transmission protocols. Instead of imposing the greedy requirement that at least one node in the ith hop receives all packets before transmitting packets to the next hop and its neighbours, we take advantage of the spatial diversity and broadcast nature of wireless transmission to adopt a cooperative approach in which node broadcast whatever packets it has received with the expectation that it will recover the lo…
In this paper, a novel framework for normative modeling of the spectrum sensing and sharing problem in cognitive radios (CRs) as a transferable utility (TU) cooperative game is proposed. Secondary users (SUs) jointly sense the spectrum and cooperatively detect the primary user (PU) activity for identifying and accessing unoccupied spectrum bands. The games are designed to be balanced and super-additive so that resource allocation is possible and provides SUs with an incentive to cooperate and form the grand coalition. The characteristic function of the game is derived based on the worths of SU…
In this work, we address the relay selection problem for the wireless powered communication networks, where the relays harvest energy from the source radio frequency signals. A single source-destination pair is considered without a direct link. The connecting relay nodes are equipped with storage batteries of infinite size. We assume that the channel state information (CSI) on the source-relay link is available at the relay nodes. Depending on the availability of the CSI on the relay-destination link at the relay node, we propose different relay selection schemes and evaluate the outage probab…
Most of geographic routing approaches in wireless ad hoc and sensor networks do not take into consideration the medium access control (MAC) and physical layers when designing a routing protocol. In this paper, we focus on a cross-layer framework design that exploits the synergies between network, MAC, and physical layers. In the proposed CoopGeo, we use a beaconless forwarding scheme where the next hop is selected through a contention process based on the geographic position of nodes. We optimize this Network-MAC layer interaction using a cooperative relaying technique with a relay selection s…
In this paper we present a cooperative medium access control (MAC) protocol that is designed for a physical layer that can decode interfering transmissions in distributed wireless networks. The proposed protocol pro-actively enforces two independent packet transmissions to interfere in a controlled and cooperative manner. The protocol ensures that when a node desires to transmit a unicast packet, regardless of the destination, it coordinates with minimal overhead with relay nodes in order to concurrently transmit over the wireless channel with a third node. The relay is responsible for allowin…
This paper considers the problem of energy-efficient transmission in multi-flow multihop cooperative wireless networks. Although the performance gains of cooperative approaches are well known, the combinatorial nature of these schemes makes it difficult to design efficient polynomial-time algorithms for joint routing, scheduling and power control. This becomes more so when there is more than one flow in the network. It has been conjectured by many authors, in the literature, that the multiflow problem in cooperative networks is an NP-hard problem. In this paper, we formulate the problem, as a …
The capability of nodes to broadcast their message to the entire wireless network when nodes employ cooperation is considered. We employ an asymptotic analysis using an extended random network setting and show that the broadcast performance strongly depends on the path loss exponent of the medium. In particular, as the size of the random network grows, the probability of broadcast in a one-dimensional network goes to zero for path loss exponents larger than one, and goes to a nonzero value for path loss exponents less than one. In two-dimensional networks, the same behavior is observed for pat…
In this paper, channel resource allocation problem for LEO mobile satellite systems is investigated and a new dynamic channel resource allocation scheme is proposed based on differential game. Optimal channel resource allocated to each satellite beams are formulated as Nash equilibrium. It is proved that optimal channel resource allocation can be achieved and the differential game based scheme is applicable and acceptable. Numerical results shows that system performance can be improved based on the proposed scheme.
This paper presents a two-phase cooperative communication strategy and an optimal power allocation strategy to transmit sensor observations to a fusion center in a large-scale sensor network. Outage probability is used to evaluate the performance of the proposed system. Simulation results demonstrate that: 1) when signal-to-noise ratio is low, the performance of the proposed system is better than that of the multiple-input and multiple-output system over uncorrelated slow fading Rayleigh channels; 2) given the transmission rate and the total transmission SNR, there exists an optimal power allo…
The performance of data delivery in wireless relay networks (WRNs), such as delay-tolerant networks and device-to-device communications heavily relies on the cooperation of mobile nodes (i.e., users and their carried devices). However, selfish nodes may refuse to relay data to others or share their resources with them due to various reasons, such as resource limitations or social preferences. Meanwhile, misbehaving nodes can launch different types of internal attacks (e.g., blackhole and trust-related attacks) to disrupt the normal operation of the network. Numerous mechanisms have been recent…