#### DMCA

## Optimal Resource Allocation and Relay Selection in Bandwidth Exchange Based Cooperative Forwarding

Citations: | 3 - 3 self |

### Citations

12402 |
Elements of Information Theory
- Cover, Thomas
- 1991
(Show Context)
Citation Context ...ese achievable rates, Rbes ≤ min(Rsf , Rs0 +Rc) (5) Rc +R be f ≤ Rf0 (6) The codebook design procedure to achieve these rates is summarized in Appendix A. A detailed description can be found in [19], =-=[20]-=-. Using this rate analysis, we focus on the distributed joint optimal bandwidth allocation and relay selection in maximizing the summation of the α-fair utilities of the network. α-fair utility: The α... |

2006 | Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” Information Theory
- Laneman, Tse, et al.
- 2004
(Show Context)
Citation Context ...h. Numerical results show that the proposed algorithms provide 2025% gain in spectral efficiency and 90-98% reduction in outage probability. I. INTRODUCTION The benefits of cooperative communications =-=[1]-=- have led to significant research in relaying and forwarding [2]. However, forwarding always incurs some costs, e.g., power and/or delay. There have been few works that focus on the explicit cost of f... |

1409 |
Integer and Combinatorial Optimization
- Nemhauser, Wolsey
- 1988
(Show Context)
Citation Context ...se nodes. • The relay selection problem in outage probability reduction becomes maximizing the number of edges in the network. This reduces to the maximum matching (MM) algorithm in a bipartite graph =-=[23]-=-. Our focus here is to maximize the number of users that receive minimum data rate, not to maximize any utility function. That’s why, we use MM, instead of MWM, in this part of the work. Besides, coop... |

1192 |
Gamal, “Capacity theorems for the relay channel
- Cover, El
- 1979
(Show Context)
Citation Context ...ts to the BS to resolve the BS’s uncertainty about node s’s data. Node f also transmits its own data, Rbef , to the BS. The information theoretic generalization of the maximum-flow-minimum-cuttheorem =-=[19]-=- provides the following relationship between these achievable rates, Rbes ≤ min(Rsf , Rs0 +Rc) (5) Rc +R be f ≤ Rf0 (6) The codebook design procedure to achieve these rates is summarized in Appendix A... |

357 | Dynamic power allocation and routing for time-varying wireless networks
- Neely, Modiano, et al.
- 2005
(Show Context)
Citation Context ...erature. Inspired by the seminal work on maximum weighted scheduling [13], most of the works on MWM based scheduling have defined link weights as the differential backlog size of that particular link =-=[14]-=-, [15]. Based on this definition and using the network layer capacity perspective, the MWM algorithm of these works finds the set of links that will be activated at each slot [16], [17]. However, Fig.... |

348 | The Impact of Imperfect Scheduling on CrossLayer Rate Control in Multihop Wireless Networks.
- Lin, Shroff
- 2005
(Show Context)
Citation Context ...articular link [14], [15]. Based on this definition and using the network layer capacity perspective, the MWM algorithm of these works finds the set of links that will be activated at each slot [16], =-=[17]-=-. However, Fig. 1. Direct Transmission and BE enabled Incentivized Forwarding we adopt an information theoretic capacity perspective in this work. We define the link weights of the MWM graph as the ut... |

100 | Nash equilibria of packet forwarding strategies in wireless ad hoc networks
- Felegyhazi, Hubaux, et al.
- 2006
(Show Context)
Citation Context ...ting cooperative communications literature include several incentive based mechanisms to encourage the forwarder nodes for cooperation. These techniques include pricing [3], reputation [4] and credit =-=[5]-=- based cooperative forwarding. However, these mechanisms require a stable economy or a shared understanding of what things are worth and become unrealizable in dynamic wireless networks. In light of t... |

68 |
Stackelberg game for utility-based cooperative cognitive radio networks
- Zhang, Zhang
- 2009
(Show Context)
Citation Context ...butions in this paper can be summarized as follows. First, we consider incentivized relaying in a network where each node has been allocated an initial amount of bandwidth. Previously, the authors of =-=[9]-=- and [10] considered incentivized forwarding in a cognitive radio network where only the primary users initially receive resources and later transfer some of their resources to the secondary users as ... |

36 | Pricing for enabling forwarding in self-configuring ad hoc networks,”
- Ileri, Mau, et al.
- 2005
(Show Context)
Citation Context ...plicit cost of forwarding. Existing cooperative communications literature include several incentive based mechanisms to encourage the forwarder nodes for cooperation. These techniques include pricing =-=[3]-=-, reputation [4] and credit [5] based cooperative forwarding. However, these mechanisms require a stable economy or a shared understanding of what things are worth and become unrealizable in dynamic w... |

34 |
Fair end-to-end window based congestion control.”
- Mo, Walrand
- 2000
(Show Context)
Citation Context ...tributed joint optimal bandwidth allocation and relay selection in maximizing the summation of the α-fair utilities of the network. α-fair utility: The α-fair utility is defined for any α ∈ [0,∞), as =-=[21]-=-, Uα(R) = { R1−α 1−α , if α 6= 1 log(R), if α = 1 (7) where R represents the rate of the user. Summation of α-fair utility functions takes the form of different well known utility functions, e.g., sum... |

25 |
Paths, trees and flowers,” Canadian
- Edmonds
- 1965
(Show Context)
Citation Context ...e the concavity of the resource allocation problem and then show that the optimal relay selection problem in α-fair NUM reduces to the classical nonbipartite maximum weighted matching (MWM) algorithm =-=[7]-=-. Using the distributed local greedy MWM [8], we propose a simple distributed BE enabled incentivized forwarding protocol. We also show that the outage probability reduction problem reduces to the bip... |

22 | Efficient resource allocation with flexible channel cooperation in OFDMA cognitive radio networks
- Xu, Li
- 2010
(Show Context)
Citation Context ...in this paper can be summarized as follows. First, we consider incentivized relaying in a network where each node has been allocated an initial amount of bandwidth. Previously, the authors of [9] and =-=[10]-=- considered incentivized forwarding in a cognitive radio network where only the primary users initially receive resources and later transfer some of their resources to the secondary users as incentive... |

13 | Gamal, “The three node wireless network: achievable rates and cooperation strategies
- Lai, Liu, et al.
- 2006
(Show Context)
Citation Context ...025% gain in spectral efficiency and 90-98% reduction in outage probability. I. INTRODUCTION The benefits of cooperative communications [1] have led to significant research in relaying and forwarding =-=[2]-=-. However, forwarding always incurs some costs, e.g., power and/or delay. There have been few works that focus on the explicit cost of forwarding. Existing cooperative communications literature includ... |

12 |
Simple Distributed Weighted Matchings,” eprint,
- Hoepman
- 2004
(Show Context)
Citation Context ...roblem and then show that the optimal relay selection problem in α-fair NUM reduces to the classical nonbipartite maximum weighted matching (MWM) algorithm [7]. Using the distributed local greedy MWM =-=[8]-=-, we propose a simple distributed BE enabled incentivized forwarding protocol. We also show that the outage probability reduction problem reduces to the bipartite maximum matching algorithm in this co... |

11 |
and J.-Y Le Boudec, “Self-policing mobile ad hoc networks by reputation systems
- Buchegger
- 2007
(Show Context)
Citation Context ...orwarding. Existing cooperative communications literature include several incentive based mechanisms to encourage the forwarder nodes for cooperation. These techniques include pricing [3], reputation =-=[4]-=- and credit [5] based cooperative forwarding. However, these mechanisms require a stable economy or a shared understanding of what things are worth and become unrealizable in dynamic wireless networks... |

9 | Transmit signal and bandwidth optimization in Multiple-Antenna Relay Channels
- Ng, Foschini
- 2011
(Show Context)
Citation Context ...he summation of the utilities while preserving the initial utilities of the individual nodes. Previously, the authors of [11] considered BE from a simpler two hop relaying perspective. The authors of =-=[12]-=- proposed a similar half duplex DF relaying approach. However, they considered a commercial relay network where the relay did not have its own data [12]. To the best of our knowledge, our proposed BE ... |

8 | Bandwidth exchange: An energy conserving incentive mechanism for cooperation,”
- Zhang, Shinkuma, et al.
- 2010
(Show Context)
Citation Context ...orwarding. However, these mechanisms require a stable economy or a shared understanding of what things are worth and become unrealizable in dynamic wireless networks. In light of this, the authors of =-=[6]-=- developed a bandwidth exchange (BE) enabled incentive mechanism where nodes offer a portion of their allocated bandwidths to other nodes as immediate incentives for relaying. They used a Nash bargain... |

5 | Maximizing cooperative diversity energy gain for wireless networks
- Mahinthan, Cai, et al.
- 2007
(Show Context)
Citation Context ...he AP using a DF cooperation strategy whereas, the ‘unmatched’ nodes transmit to the AP without cooperating with any other node. In this regards, our relay selection approach is closer to the work of =-=[18]-=- where the authors defined link weights of each cooperative pair as the energy savings of cooperation over noncooperation. However, [18] considered energy minimization from a bit error rate (BER) pers... |

3 |
Stability properties of constrained queing systems and scheduling for maximum throughput in multihop radio networks
- Tassiulas, Ephremides
- 1936
(Show Context)
Citation Context ...thm has not been investigated before. Third, our definition of link weight in the use of MWM is different from that of existing literature. Inspired by the seminal work on maximum weighted scheduling =-=[13]-=-, most of the works on MWM based scheduling have defined link weights as the differential backlog size of that particular link [14], [15]. Based on this definition and using the network layer capacity... |

1 | Optimal resource allocation in a bandwidth exchange enabled relay network
- Islam, Mandayam, et al.
- 2011
(Show Context)
Citation Context ..., our proposed decode & forward (DF) BE enabled resource allocation maximizes the summation of the utilities while preserving the initial utilities of the individual nodes. Previously, the authors of =-=[11]-=- considered BE from a simpler two hop relaying perspective. The authors of [12] proposed a similar half duplex DF relaying approach. However, they considered a commercial relay network where the relay... |

1 |
End-to-end bandwidth gurantees through fair local spectrum share in wireless ad-hoc networks
- Sarkar, Tassiulas
- 2011
(Show Context)
Citation Context ...e. Inspired by the seminal work on maximum weighted scheduling [13], most of the works on MWM based scheduling have defined link weights as the differential backlog size of that particular link [14], =-=[15]-=-. Based on this definition and using the network layer capacity perspective, the MWM algorithm of these works finds the set of links that will be activated at each slot [16], [17]. However, Fig. 1. Di... |

1 |
Stochastic network utility mazmimization and wireless scheduling,” in Next Generation Internet Architectures and Protocols
- Yi, Chiang
- 2011
(Show Context)
Citation Context ...that particular link [14], [15]. Based on this definition and using the network layer capacity perspective, the MWM algorithm of these works finds the set of links that will be activated at each slot =-=[16]-=-, [17]. However, Fig. 1. Direct Transmission and BE enabled Incentivized Forwarding we adopt an information theoretic capacity perspective in this work. We define the link weights of the MWM graph as ... |

1 |
Rantwijk, “Maximum weighted matching,” http://jorisvr.nl/maximummatching.html/, accessed
- van
- 2012
(Show Context)
Citation Context ...placed randomly in the cell. We considered transmission scheme much like the one used in mobile Wimax. Each node is preassigned 20 dBm transmit power and 1 MHz bandwidth. We used the matching code of =-=[24]-=- to implement the MWM algorithm in Matlab. We showed the performance of both centralized and distributed algorithms in Fig. 6 and Fig. 7. In the simulation of the distributed algorithm, we assumed tha... |