Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents
By Luzi Anderegg, Stephan J. Eidenbenz. ACM/IEEE International Conference on Mobile Computing and Networking, 2003
556 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/3deeb0b2ac1c4abafde7b9a18e31ec9d4a35f419
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Management Science and Operations Research
Citations in the corpus
- Topology control in wireless ad hoc and sensor networks (2005, methodology): “3In the other payment model considered in (Anderegg and Eidenbenz 2003), the central-bank model, all the premiums due to network nodes are accumulated by a central authority, which divides them equally among all the nodes.”
- Game Theory in Wireless and Communication Networks (2008, methodology): “First, a large number of wireless networking and resource-allocation problems can be formulated within the framework of auction theory – for example, the routing problem for self-interested users [39].”
- A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects (2013, background): “Notice that credit-based incentive schemes have been wellstudied in traditional wireless networks [100]–[103].”
- Security and Cooperation in Wireless Networks (2007, methodology): “Used with permission, from [24], c © ACM, 2003”
- ART: An Attack-Resistant Trust Management Scheme for Securing Vehicular Ad Hoc Networks (2016, background): “In this way, malicious nodes cannot spread fake charges to frame the well-behaved nodes, and consequently avoid denial of service (DoS) attacks toward the well-behaved nodes.”