Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Architecture and evaluation of an unplanned 802.11b mesh network
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Efficiency and nash equilibria in a scrip system for P2P networks
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Stimulating cooperation in multi-hop wireless networks using cheating detection system
INFOCOM'10 Proceedings of the 29th conference on Information communications
INPAC: an enforceable incentive scheme for wireless networks using network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
A survey on game theory applications in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A reputation system for wireless mesh networks using network coding
Journal of Network and Computer Applications
On combining shortest-path and back-pressure routing over multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Selfishness in mesh networks: wired multihop MANETs
IEEE Wireless Communications
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
A mathematical framework for analyzing adaptive incentive protocols in P2P networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In designing wireless mesh networks (WMNs), incentive mechanisms are often needed so to encourage nodes to relay or forward packets for other nodes. However, there is a lack of fundamental understanding on the interactions between the incentive mechanisms and the underlying protocols (e.g., shortest-path routing, ETX routing or back-pressure scheduling), and whether integration of these protocols will lead to a robust network, i.e., networks can sustain a given traffic workload. The objective of this paper is to present a general mathematical framework via stochastic difference equations to model the interaction of incentive mechanisms and various underlying protocols. We first present a credit evolution model to quantify the expected credit variation of each node in WMN, then use the norm of the expected credits variation to quantify the credit disparity. We also propose the use of differentiated pricing and show how it can achieve credit equality among nodes, resulting in a more robust network under different traffic loading. Our analytical framework can help researchers to model other incentive/routing protocols so to analyze the robustness of the underlying networks.