VCG with Communities on Random Ad Hoc Networks
We study game-theoretic mechanisms for routing in wireless ad hoc networks. Our major results include a combination of theoretical bounds and extensive simulations, showing that VCG-based routing in wireless ad-hoc networks exhibits small frugality ratio with high probability. Game-theoretic mechani...
Saved in:
Main Authors: | Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2011-05-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2011/895398 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
More Benefits of Adding Sparse Random Links to Wireless Networks: Yet Another Case for Hybrid Networks
by: Gunes Ercal
Published: (2012-06-01) -
Mobile ad-hoc networks: MANET
by: Mikarić Bratislav, et al.
Published: (2018-01-01) -
Consultores ad-hoc
by: Amana Mattos
Published: (2024-12-01) -
Cluster Optimization in Mobile Ad Hoc Networks Based on Memetic Algorithm: memeHoc
by: Masood Ahmad, et al.
Published: (2020-01-01) -
Randomized geographic-based routing with nearly guaranteed delivery for three-dimensional ad hoc network
by: Alaa E. Abdallah, et al.
Published: (2016-10-01)