Data networks
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Asynchronous Stochastic Approximations
SIAM Journal on Control and Optimization
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperation in ad hoc networks with noisy channels
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
On extending coverage of UMTS networks using an ad-hoc network with weighted fair queueing
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Hi-index | 0.00 |
Wireless Ad-hoc networks are expected to be made up of energy aware entities (nodes) interested in their own perceived performance. We consider a simple random access model for a wireless ad hoc network to address problems of finding an optimal channel access rate and providing incentive for cooperation to forward other nodes' traffic. By casting these problems as noncooperative games, we derive conditions for the Nash equilibrium and provide distributed algorithms to learn the Nash equilibrium.