Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Certain limitations of reputation--based schemes in mobile environments
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Cooperation monitoring issues in ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A price-based reliable routing game in wireless networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Stimulating Node Cooperation in Mobile Ad hoc Networks
Wireless Personal Communications: An International Journal
IEEE Transactions on Information Forensics and Security
Attack-resistant cooperation stimulation in autonomous ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Wireless ad hoc networks are resource constrained, infrastructureless peer to peer networks where nodes are responsible for performing routing activity for other nodes to establish end to end communication. Due to limited resources (energy and bandwidth), in certain networks, nodes may behave selfishly and not forward packets for other nodes. Many cooperation enforcement mechanisms are proposed in literature to enforce packet forwarding on resource constrained nodes, and are shown to perform better than the defenseless dynamic source routing (DSR) protocol under their own set of assumptions. However, they do not consider the effect on network lifetime and energy consumption. Here we analyse routing overhead, end to end packet delivery ratio (PDR), and per packet energy cost of DSR and a representative set of cooperation enforcement mechanisms using various network scenario to show that in absence of infrastructure support cooperation enforcement mechanisms in their present form are not effective in dealing with node selfishness.