A distributed strategic routing mechanism for wireless ad hoc networks
2004
A distributed routing protocol is presented for a wireless ad hoc network that consists of strategic agents. A strategic agent is rational but selfish, and has its own incentive to route traffic for other agents. A mechanism design (MD) approach is applied and a routing mechanism is designed such that maximizing the benefit of each strategic agent leads to a global optimal system. In this mechanism, an agent accepts payments for forwarding data for other agents if the payments cover their costs incurred by forwarding data. The payment is computed recursively to obtain a cost-efficient and truthful mechanism. The overpayment in normal mechanisms is completely eliminated.
Keywords:
- Optimized Link State Routing Protocol
- Dynamic Source Routing
- Wireless Routing Protocol
- Hazy Sighted Link State Routing Protocol
- Ad hoc wireless distribution service
- Computer network
- Business
- Wireless ad hoc network
- Distributed computing
- Adaptive quality of service multi-hop routing
- Destination-Sequenced Distance Vector routing
- Ad hoc On-Demand Distance Vector Routing
- Computer science
- Link-state routing protocol
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
12
References
1
Citations
NaN
KQI