Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
From MaRDI portal
Publication:1662512
DOI10.3390/a2041303zbMath1445.68034OpenAlexW1982376844MaRDI QIDQ1662512
Sarvesh Varatharajan, Adam Meyerson, Gunes Ercal-Ozkaya, Allon G. Percus, Stephan J. Eidenbenz
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a2041303
game theoryheuristicsNP-hard problemsprice of anarchysensor networksprice of stabilitylocal algorithmsincentive compatible topology controllocation-based routingrandom Euclidean power graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the reciprocity of proximity relations
- Beta-skeletons have unbounded dilation
- Location-aided routing (LAR) in mobile ad hoc networks
- Sensor-centric energy-constrained reliable query routing for wireless sensor networks
- Balancing minimum spanning trees and shortest-path trees
- On the approximability of the range assignment problem on radio networks in presence of selfish agents
- On a network creation game
- The Price of Stability for Network Design with Fair Cost Allocation
- An analytical calculation of neighbourhood order probabilities for high dimensional Poissonian processes and mean field models
- A law of large numbers for nearest neighbour statistics
- A Law of Large Numbers for the Maximum in a Stationary Gaussian Sequence
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget