An incentive-based fairness mechanism for multi-hop wireless backhaul networks with selfish nodes

Lee, Jeng Farn; Liao, Wanjiun; Chen, Meng Chang

doi:10.1109/twc.2008.060631

Cited by 31 publications

(3 citation statements)

References 19 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, they focus on backhaul networks with no spatial reuse, i.e., only one link can be active at any given time, which is typical of networks where all links mutually contend for bandwidth. In contrast, the authors of [11] provide a general formulation for obtaining target throughputs of TAPs under fairness constraints in a more general backhaul network, where spatial reuse is possible and some TAPs may not always be backlogged.…”

Section: Fairness Reference Modelmentioning

confidence: 99%

Fairness in multi-hop wireless backhaul networks: a dynamic estimation approach

Lee¹,

Hsu²

2008

Proceedings of the Fifth International ICST Conference on Heterogeneous Networking for Quality Reliability Security and Robustn

View full text Add to dashboard Cite

In this work, we consider the problem of fairness for Transit Access Points (TAP) in multi-hop wireless backhaul networks. Existing approaches are not practical due to the requirement for modifications to the MAC layer or queueing operations of TAPs, or it is difficult to measure the effective link capacities between TAPs since this capacity must account for such factors as the MAC layer overhead, the effect of wireless interference, the hidden terminal problem, and multi-rate multi-channel issues. Moreover, some approaches are only suitable for TDMA-based MAC protocols. Therefore, we propose an effective and practical approach with two algorithms to enforce fairness in wireless backhaul networks. We also evaluate the performance of proposed approach via ns-2 simulations.

show abstract

Section: Fairness Reference Modelmentioning

confidence: 99%

Fairness in multi-hop wireless backhaul networks: a dynamic estimation approach

Lee¹,

Hsu²

2008

Proceedings of the Fifth International ICST Conference on Heterogeneous Networking for Quality Reliability Security and Robustn

View full text Add to dashboard Cite

show abstract

“…However, to the best of the authors' knowledge, there are no works in this area modelling the user behavior as being selfish and aiming to address the respective problems from a game theoretic point of view. Game theoretic approaches in the presence of selfish nodes in multihop wireless networks in general are presented in [8], [9]. However, although the proposed systems are evaluated in terms of typical performance metrics, such as throughput and fairness, the effect of the selfishness of the users on the overall system performance is not assessed.…”

Section: Introductionmentioning

confidence: 99%

Selfish Routing and Link Scheduling in mmWave Backhaul Networks

Triantafyllopoulou,

Kollias,

Moessner

2023

ICC 2023 - IEEE International Conference on Communications

View full text Add to dashboard Cite

In this paper we present and evaluate the performance of a routing and link scheduling algorithm for millimeter wave backhaul networks. The proposed algorithm models the end user behavior as being selfish, i.e., it considers users always aiming to maximize their individual utility, rather than the global optimization objective. In order to forward packets through the backhaul network, the Shapley value method is applied, which is shown to induce solutions with reduced latency. The performance of the proposed algorithm is evaluated in terms of the total delay as well as the price of anarchy, which represents the inefficiency of a scheduling policy when users are allowed to adapt their rates in a selfish manner and reach an equilibrium. A relaxed version of the problem is also presented, which provides a lower bound on the value of the optimal solution. According to simulation results, the system employing the proposed algorithm outperforms in terms of delay and price of anarchy a system considering a First-In-First-Out packet forwarding policy, as well as a system employing local search global optimization, under which users aim at optimizing the overall delay in the network.

show abstract

“…In [5][6] have been reported for the throughput and delay performances in mul-tihop wireless networks. In [7][8][9], the simulation results show that throughput and end-to-end delay in WMN are significantly changed by increasing hopcount distance from the gateway. In [10], the model of statistical location-dependent throughput and delay performances in WMN is proposed.…”

Section: Introductionmentioning

confidence: 99%

Design of Node Locations for Indoor Wireless Mesh Network

Sauram

Uthansakul

2010

ECTI-EEC

View full text Add to dashboard Cite

In literatures, the performance of Wireless Mesh Network (WMN) has been analyzed by assuming the same quality for each hop. However, this assumption is hardly true in practice due to the physical obstructions of wireless link, especially for an indoor environment. Therefore, this paper revisits the analysis of WMN performance by taking the effect of physical obstructions into account instead of assuming an equally deterministic property for each hop. These obstructions cause the degradation of signal strength which relatively decrease the success rate oftransmission between hop to hop. This paper examines these physical concerns through the measured results and then the design of node locations can be achieved. Moreover, it is well known that the analysis of throughput in WMN has indicated the impact of near-far mesh locations. However, these examinations have neglected the quantity of user accessibility. Therefore, this paper presents the effect of user accessibility in terms of traffic intensity on WMN throughput. The simulations provide a substantial remark to realize the effect of physical obstruction and traffic intensity on designing WMN node locations.

show abstract

An incentive-based fairness mechanism for multi-hop wireless backhaul networks with selfish nodes

Cited by 31 publications

References 19 publications

Fairness in multi-hop wireless backhaul networks: a dynamic estimation approach

Fairness in multi-hop wireless backhaul networks: a dynamic estimation approach

Selfish Routing and Link Scheduling in mmWave Backhaul Networks

Design of Node Locations for Indoor Wireless Mesh Network

Contact Info

Product

Resources

About