Frugal Routing on Wireless Ad-Hoc Networks

DOI10.1007/978-3-540-79309-0_13zbMATH Open1136.68324OpenAlexW2114944586MaRDI QIDQ5459979FDOQ5459979

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

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

Recommendations

• Towards a game theoretic understanding of ad-hoc routing
• Studying on economic-inspired mechanisms for routing and forwarding in wireless ad hoc network
• Frugal path mechanisms
• scientific article; zbMATH DE number 2119764
• Frugality in path auctions

Mathematics Subject Classification ID

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

Cites Work

• Random Geometric Graphs
• Incentives in Teams
• Title not available (Why is that?)
• The capacity of wireless networks
• Algorithmic mechanism design
• Algorithms, games, and the internet
• Title not available (Why is that?)
• Computationally feasible VCG mechanisms
• Title not available (Why is that?)
• On the hardness of approximating label-cover
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monotone properties of random geometric graphs have sharp thresholds
• Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
• Frugal Routing on Wireless Ad-Hoc Networks
• Automata, Languages and Programming

Cited In (7)

• Incentive-based control of ad hoc networks: A performance study
• Frugal Routing on Wireless Ad-Hoc Networks
• Optimal placement of ad hoc devices under a VCG-style routing protocol
• Efficient use of route requests for loop-free on-demand routing in ad hoc networks
• Network coding traffic design using column generation techniques
• Studying on economic-inspired mechanisms for routing and forwarding in wireless ad hoc network
• On the approximability of the range assignment problem on radio networks in presence of selfish agents

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459979)