Auction-based schemes for multipath routing in selfish networks

Zhou, Haojie; Leung, Ka-Cheong; Li, Victor O. K.

doi:10.1109/wcnc.2013.6554864

Cited by 8 publications

(6 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although RBAP in RGA can be solved in polynomial time, payment determination in (11) still requires a terribly long time to compute W −u , ∀u ∈ V using RGA [17]. SFA is developed to make it computationally feasible to compute W −u , ∀u ∈ V .…”

Section: Split-flow-based Algorithm (Sfa)mentioning

confidence: 99%

“…We evaluate FABA-20, FABA-220, and FABA-420, where FABA-δ is the FABA using parameter δ Kbps in SFA. FABA is implemented via a batching mechanism [17]. In particular, AP acting as the control center allocates the bandwidth and determines the payments for all routing requests of calls at the end of each batching period.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…In [9], a cheating detection system is developed based on a statistical analysis of the payment information in activity reports to prevent cheating in multi-hop wireless networks. In [17], the receivers monitor whether intermediate nodes are cooperative to relay the flows, and report to a credit center, which makes the payments to the intermediate nodes.…”

Section: Introductionmentioning

confidence: 99%

“…An optimal scheme for multipath traffic as-signment (OSMA) was proposed in [14] to handle the routing requests sequentially in the order of their arrivals. A more general analytical model was proposed in [17] with a strategyproof scheme for multiple requests. Unfortunately, these work cannot handle the bandwidth allocation and scheduling for multi-hop routing in non-cooperative wireless network, since the interferences among wireless nodes are not considered.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Auction-based bandwidth allocation and scheduling in noncooperative wireless networks

Zhou¹,

Leung²,

Li³

2014

2014 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

We investigate bandwidth allocation and scheduling in non-cooperative wireless networks as a mixed integer programming problem. Fast Vickrey-Clarke-Groves (VCG) auctionbased bandwidth allocation (FABA), incorporating relaxationbased greedy algorithm (RGA) and split-flow-based algorithm (SFA), is proposed by modifying the traditional VCG auction to make it computationally feasible. With incentives provided by FABA, the dominant strategy of any selfish node in the network is to be cooperative so that the system cost is minimized. We implement FABA via a batching-based mechanism which allocates bandwidth for all call routing requests arriving in a certain batching period simultaneously. Our simulation evaluates the performance in terms of system cost, payment-cost ratio, and setup time.

show abstract

Section: Split-flow-based Algorithm (Sfa)mentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Auction-based bandwidth allocation and scheduling in noncooperative wireless networks

Zhou¹,

Leung²,

Li³

2014

2014 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…iPass has shown be fair and efficient. The work in [8] studied auction based schemes for multi-path routing in selfish networks. A general model known as optimal auction-based multi-path routing (OAMR) has been developed based on the VickreyClarke-Groves (VCG) auction.…”

Section: Auction Theory and Related Workmentioning

confidence: 99%

Combinatorial auction based routing in multi-channel cognitive radio networks

Khairullah

Chatterjee

2014

2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)

View full text Add to dashboard Cite

In this paper, we propose an auction-based routing algorithm in a distributed cognitive radio network. The routing of packets is viewed as a market-based phenomenon where channels are traded between transmitters and receivers. Message routes are determined through a series of auctions between message senders and forwarders. The use of auction facilitates the determination of the cost of bandwidth in a market-like scenario, hence the price to be paid by the senders, for each of the possible routes. The process involves the forwarders (or, bidders) bidding the price and the sender choosing the winner with the minimum bid. While the proposed schema explores all routes from the source to the destination through a repeated bidding process, the route with the minimum payment is chosen as the optimal solution that satisfies the requirement of the sender. Bidders determine their bid based on three utility values: i) signal to interference and noise ratio on a specific channel, ii) achievable capacity on each channel, and iii) the required bandwidth to satisfy the buyer's bit rate requirement. We consider two cases: i) sellers can bid for only one channel; in this case the bid is for the channel which satisfies the bit rate requirement and has the minimum price and ii) sellers can bid for a combination of non-substitutable channels that collectively satisfy the bit rate requirement. Since exploring all possible combinations of channels is NR-hard, we propose a greedy heuristic that takes ( ). We validate the proposed auction based routing through extensive simulation experiments. Results are obtained for different topologies and for various number of channels and networking parameters.

show abstract

Per-Hop Reversed Packet Auctions for Cooperative Routing in Mobile Wireless Networks

Brito

Carvalho

2021

IEEE Access

View full text Add to dashboard Cite

Auction-based schemes for multipath routing in selfish networks

Cited by 8 publications

References 20 publications

Auction-based bandwidth allocation and scheduling in noncooperative wireless networks

Auction-based bandwidth allocation and scheduling in noncooperative wireless networks

Combinatorial auction based routing in multi-channel cognitive radio networks

Per-Hop Reversed Packet Auctions for Cooperative Routing in Mobile Wireless Networks

Contact Info

Product

Resources

About