A Secure Payment Scheme with Low Communication and Processing Overhead for Multihop Wireless Networks

被引:11
|
作者
Mahmoud, Mohamed M. E. A. [1 ]
Shen, Xuemin [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Ctr Wireless Commun, Waterloo, ON N2L 3G1, Canada
关键词
Cooperation incentive schemes; network-level security and protection; payment schemes; selfishness attacks; INCENTIVE PROTOCOL; HOC; SYSTEM;
D O I
10.1109/TPDS.2012.106
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose RACE, a report-based payment scheme for multihop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the accounting center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges and rewards without security proofs, e. g., signatures. The AC can verify the payment by investigating the consistency of the reports, and clear the payment of the fair reports with almost no processing overhead or cryptographic operations. For cheating reports, the Evidences are requested to identify and evict the cheating nodes that submit incorrect reports. Instead of requesting the Evidences from all the nodes participating in the cheating reports, RACE can identify the cheating nodes with requesting few Evidences. Moreover, Evidence aggregation technique is used to reduce the Evidences' storage area. Our analytical and simulation results demonstrate that RACE requires much less communication and processing overhead than the existing receipt-based schemes with acceptable payment clearance delay and storage area. This is essential for the effective implementation of a payment scheme because it uses micropayment and the overhead cost should be much less than the payment value. Moreover, RACE can secure the payment and precisely identify the cheating nodes without false accusations.
引用
收藏
页码:209 / 224
页数:16
相关论文
共 50 条
  • [41] An Efficient Secure scheme for Wireless Sensor Networks
    Elleuchi, Manel
    Cheikhrouhou, Omar
    Obeid, Abdulfattah M.
    Abid, Mohamed
    [J]. SECURITY OF INFORMATION AND NETWORKS (SIN'16), 2016, : 128 - 131
  • [42] A Secure Routing Scheme for Wireless Mesh Networks
    Nanda, Ashish
    Nanda, Priyadarsi
    He, Xiangjian
    Jamdagni, Aruna
    [J]. INFORMATION SYSTEMS SECURITY, 2016, 10063 : 393 - 408
  • [43] A secure key agreement scheme in low-energy wireless sensor networks
    Kim, Taeyeon
    Wang, Gicheol
    Cho, Gihwan
    [J]. EMBEDDED AND UBIQUITOUS COMPUTING, PROCEEDINGS, 2006, 4096 : 79 - 88
  • [44] Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges
    Wang, Lixin
    Wan, Peng-Jun
    Yao, Frances
    [J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, 2010, 6221 : 47 - +
  • [45] Optimization of Unstable Multihop Wireless Communication Networks with Digital Forensics
    Uda, Ryuya
    Naito, Katsuhiro
    Ehara, Masaki
    [J]. 2013 WORLD CONGRESS ON SUSTAINABLE TECHNOLOGIES (WCST), 2013, : 66 - 71
  • [46] Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges
    Wang, Lixin
    Wan, Peng-Jun
    Yao, Frances
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (05) : 909 - 916
  • [47] Distributed Mode Selection for FDD Communication in Multihop Wireless Networks
    Parsinia, Moein
    Peng, Qidi
    Kumar, Sunil
    [J]. IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2019, 55 (06) : 2921 - 2937
  • [48] A general robust key management scheme for wireless multihop communication network
    [J]. 1600, International Frequency Sensor Association, 46 Thorny Vineway, Toronto, ON M2J 4J2, Canada (156):
  • [49] A secure and efficient communication resume protocol for secure wireless networks
    Kim, K
    Hong, J
    Lim, J
    [J]. DISTRIBUTED APPLICATIONS AND INTEROPERABLE SYSTEMS, 2005, 3543 : 157 - 168
  • [50] On Constructing Low Interference Topology in Multihop Wireless Networks
    Wu, Kun-Da
    Liao, Wanjiun
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 3759 - 3764