Bandwidth exchange: an energy conserving incentive mechanism for cooperation

2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications

Mandayam

2009

Self Cite

Abstract-Cooperative forwarding in wireless networks has shown to yield beneſts of rate and diversity gains, but it needs to be incentivized due to the energy and delay costs incurred by individual nodes in such cooperation. In this paper we consider an incentive mechanism called Bandwidth Exchange (BE) where the cooperating nodes ƀexibly exchange the transmission bandwidth (spectrum) as a means of providing incentive for forwarding data. The advent of cognitive radios with the ability to ƀexibly change their carrier frequency as well as their transmission bandwidth makes this form of incentive particularly attractive compared to other incentive mechanisms that are often based on abstract notions of credit and shared understanding of worth. Speciſcally, we consider a N -node wireless network and use a Nash Bargaining Solution (NBS) mechanism to study the beneſts of BE in terms of rate and coverage gains.

“…The choices of selection policies as well as other heuristic BE based incentive mechanisms also need to be considered. These will be discussed in an upcoming paper [9].…”

Section: Conclusion and Discussionmentioning

confidence: 96%

Bandwidth Exchange for enabling forwarding in wireless access networks

Zhang

2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications

Mandayam

2009

Self Cite

“…However, there still remains the issue of which specific equilibrium is most desirable. We previously [20], [21] considered a Nash bargaining solution (NBS) based algorithm to obtain an optimal equilibrium, which was inspired by [11]. The NBS maximizes the product of the players' payoffs and results in a Pareto optimal allocation that is also proportionally fair [16].…”

Section: Coordination Mechanism For Txop Exchangementioning

confidence: 99%

TXOP exchange: A cooperation mechanism for wireless access networks

Nishio

2011 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)

Takahashi

et al. 2011

Self Cite

We discuss a cooperation framework applicable for wireless access networks, in which wireless users compete for opportunistically available bandwidth with one another to satisfy each quality-of-service (QoS) demand. Our key concept is to encourage a user with low QoS requirement to provide its redundant bandwidth to another user requesting more bandwidth. The provider of bandwidth at this time can be a client at the next moment, and vice versa. Such cooperative exchange of bandwidth increases chances to satisfy QoS requirements. This paper shows how to incorporate our framework in wireless local area networks (WLANs), which is called TXOP (Transmission Opportunity) Exchange. TXOP Exchange enables flexible bandwidth exchange between compliant STAs in WLANs without any effect on the legacy access point and legacy STAs. In this paper, we particularly show how to implement the TXOP providing function in uplink WLANs and demonstrate how it works through simulation results.

“…Bandwidth barter is an effective way of satisfying through put requirements in wireless networks; we could expect a station (STA) allows another STA to borrow its bandwidth as long as it is also beneficial for the STA [1]- [4] …”

Section: Introductionmentioning

confidence: 99%

A heuristic solution for N-node bandwidth barter mechanism

Nishio

2012 IEEE Consumer Communications and Networking Conference (CCNC)

Takahashi

et al. 2012

Self Cite

Bandwidth barter is an effective way of satisfying throughput requirements in wireless networks; we could expect a station (STA) allows another STA to borrow its bandwidth as long as it is also beneficial for the STA. Our previous work proved bandwidth barter between two STAs is optimized based on Nash bargaining solution (NBS), which brings the Pareto efficiency and the proportional fairness in the bartering game. However, it still remains an open issue how to solve the bartering game when the number of STAs is N (N > 2), which is discussed in this paper. I. INTRODU CTION Bandwidth barter is an effective way of satisfying through put requirements in wireless networks; we could expect a station (STA) allows another STA to borrow its bandwidth as long as it is also beneficial for the STA [1]-[4] (Fig. 1.) The issue in the bandwidth barter is how to ensure the incentive of cooperation and the fairness for STAs. In our previous work, we design a mechanism that ensures the incentive and the fairness between two STAs based on Nash bargaining solution (NBS), which is well known as the solution bringing the Pareto efficiency and the proportional fairness in the bartering game. However, it still remains an open issue how to solve the bartering game when the number of STAs is N (N > 2).Unfortunately, the complexity of Nash bargaining prohibitively increases as the number of users increase. In this paper, we propose a brokering algorithm as a heuristic solution for the N-node bandwidth barter and observe how it works in tenus of incentive and fairness.