A secure incentive protocol for mobile ad hoc networks

被引：49

作者：

Zhang, Yanchao ^{[1
]}

Lou, Wenjing

Liu, Wei

Fang, Yuguang

机构：

[1] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA

[2] Worcester Polytech Inst, Dept Elect & Comp Engn, Worcester, MA 01609 USA

来源：

WIRELESS NETWORKS | 2007年 / 13卷 / 05期

关键词：

mobile ad hoc networks; selfishness; incentive; cooperation; security;

D O I：

10.1007/s11276-006-6220-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The proper functioning of mobile ad hoc networks depends on the hypothesis that each individual node is ready to forward packets for others. This common assumption, however, might be undermined by the existence of selfish users who are reluctant to act as packet relays in order to save their own resources. Such non-cooperative behavior would cause the sharp degradation of network throughput. To address this problem, we propose a credit-based Secure Incentive Protocol (SIP) to stimulate cooperation among mobile nodes with individual interests. SIP can be implemented in a fully distributed way and does not require any pre-deployed infrastructure. In addition, SIP is immune to a wide range of attacks and is of low communication overhead by using a Bloom filter. Detailed simulation studies have confirmed the efficacy and efficiency of SIP.

引用

页码：569 / 582

页数：14

共 30 条

[1]

ANDEREGG L, 2003, P ACM MOBICOM SAN DI

[2]

Anderson R., 1996, P 2 USENIX WORKSH EL

[3]

[Anonymous], P IEEE ACM MOBIHOC L

[4]

[Anonymous], [No title captured], DOI DOI 10.1007/978-0-585-29603-6_5

[5]

BALFANZ D, 2003, P IEEE S SEC PRIV OA

[6]

Barreto PSLM, 2002, LECT NOTES COMPUT SC, V2442, P354

[7] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].

BLOOM, BH .

COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&

[8]

BONEH D, 2001, LNCS, V2139

[9]

BUTTYAN L, 2003, ACM J MOBILE NET OCT, V8

[10]

FELEGYHAZI M, 2003, P PERS WIR COMM PWC

← 1 2 3 →