Frugal Routing on Wireless Ad-Hoc Networks

DOI10.1007/978-3-540-79309-0_13zbMath1136.68324OpenAlexW2114944586MaRDI QIDQ5459979

Adam Meyerson, Rafit Izhak-Ratzin, Rupak Majumdar, Gunes Ercal

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_13

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80) Network protocols (68M12)

Related Items (1)

Frugal Routing on Wireless Ad-Hoc Networks

Cites Work

• On the hardness of approximating label-cover
• Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
• Monotone properties of random geometric graphs have sharp thresholds
• Incentives in Teams
• Random Geometric Graphs
• The capacity of wireless networks
• Algorithms, games, and the internet
• Frugal Routing on Wireless Ad-Hoc Networks
• Automata, Languages and Programming
• Algorithmic mechanism design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Frugal Routing on Wireless Ad-Hoc Networks