Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
A survey of game-theoretic approaches in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Game theory model for selective forward attacks in wireless sensor networks
MED '09 Proceedings of the 2009 17th Mediterranean Conference on Control and Automation
A Game Theory Approach to Detect Malicious Nodes in Wireless Sensor Networks
SENSORCOMM '09 Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications
Security enforcement in wireless sensor networks: A framework based on non-cooperative games
Pervasive and Mobile Computing
Cooperative strategy by Stackelberg games under energy constraint in multi-hop relay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Towards group transport by swarms of robots
International Journal of Bio-Inspired Computation
Lexicographic multi-objective evolutionary induction of decision trees
International Journal of Bio-Inspired Computation
International Journal of Bio-Inspired Computation
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Journal on Selected Areas in Communications
New heuristic algorithms for low-energy mapping and routing in 3D NoC
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
Aiming at the security and limited energy issues in wireless sensor network, this paper introduces a secure and energy-saving routing protocol based on cooperative game strategy. A novel incentive mechanism is proposed: all the nodes including the selfish ones are encouraged to forward packets and are rewarded if they help a cooperative sender or are punished if they help a non-cooperative one. All the nodes are motivated to maintain a good reputation so that their packets could be treated well by other relays. A relay node can decide its willingness to cooperate for its own benefits, and a sender selects the suitable relay that can maximise its payoff. Simulation results demonstrate that the proposed scheme turns the non-cooperative nodes into cooperative ones, offers a higher throughput and can prolong the lifetime of the network.