Frugal Routing on Wireless Ad-Hoc Networks

DOI10.1007/978-3-540-79309-0_13MaRDI QIDQ5459979zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1222561 (Why is no real title available?)
• scientific article; zbMATH DE number 1962848 (Why is no real title available?)
• scientific article; zbMATH DE number 2080500 (Why is no real title available?)
• scientific article; zbMATH DE number 2119764 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• Algorithmic mechanism design
• Algorithms, games, and the internet
• Automata, Languages and Programming
• Computationally feasible VCG mechanisms
• Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
• Frugal Routing on Wireless Ad-Hoc Networks
• Frugality in path auctions
• Incentives in Teams
• Monotone properties of random geometric graphs have sharp thresholds
• On the hardness of approximating label-cover
• Random Geometric Graphs
• The capacity of wireless networks

Cited in

(9)

• Incentive-based control of ad hoc networks: A performance study
• Truthful multipath routing for ad hoc networks with selfish nodes
• 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
• Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
• 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)