期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2014
卷号：3
期号：8
页码：2889-2899
出版社：Shri Pannalal Research Institute of Technolgy
摘要：A secure payment scheme, called as the Report based pAyment sChemE (RACE) is used in multi hop wireless networks to stimulate node cooperation, regulate packet transmission and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the Trusted Authority (TA) to update their credit accounts and temporarily store the evidences which are undeniable. The report includes the session information. The Trusted Authority verifies the payment by investigating the consistency of the report and clears the fair reports with almost no cryptographic operations or computational overhead. The nodes which do not pass or relay others packets, but it makes use of neighbor or cooperative nodes to relay its packets are called selfish nodes. This degrades the network connectivity and fairness. Such type of nodes also submits reports to the Trusted Authority. But when tested for consistency, it is found to be a cheating node. For such reports, the evidences are requested by the Trusted Authority to identify and evict the cheating nodes or selfish nodes. After evicting the selfish nodes, communication can be efficiently established again with increased throughput and less amount of processing and communication overhead. RACE is the first payment scheme that uses the concept of evidences to secure the payments. It requires cryptographic operations in clearing the payment only in the case of cheating. Also this is the first system that can verify the payment by investigating the consistency of the node's reports without submitting and processing security tokens and without false accusations. To prevent the multihop communications from failing due to insufficient credits, the source node can borrow credits or they can be purchased with real money from the Trusted Authority. RACE can secure the payment and precisely identify the cheating nodes without false denunciations. This is done by establishing a route between the source and the destination by sending a route request to the destination and the destination replies with path, a hash element from the hash chain and the signature.
