Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks

被引:125
作者
Buchegger, S [1 ]
Le Boudec, JY [1 ]
机构
[1] IBM Corp, Zurich Res Lab, CH-8803 Ruschlikon, Switzerland
来源
10TH EUROMICRO WORKSHOP ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS | 2002年
关键词
D O I
10.1109/EMPDP.2002.994321
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Devices in mobile ad hoc networks work as network nodes and relay packets originated by, other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous not to cooperate, though. The new routing protocol extensions presented in this paper make it possible to detect and isolate misbehaving nodes, thus making it unattractive to deny cooperation. In the presented scheme, trust relationships and routing decisions are made based on experienced, observed, or reported routing and forwarding behavior of other nodes. A hybrid scheme of selective altruism and utilitarianism is presented to strengthen mobile ad hoc network protocols in their resistance to security attacks, while aiming at keeping network throughput, or goodput, high. This paper focuses particularly on the network layer, using the Dynamic Source Routing (DSR) protocol as an example.
引用
收藏
页码:403 / 410
页数:8
相关论文
共 18 条
[1]  
ANDERSON R, 1999, LECT NOTE COMPUTER S
[2]  
[Anonymous], P IEEE C SEC PRIV OA
[3]  
BUCHEGGER S, 2001, 3354 RR
[4]  
BUTTYAN L, 2000, MOBIHOC
[5]  
Dawkins R, 1989, SELFISH GENE
[6]  
Fasbender A, 1996, 1996 IEEE 46TH VEHICULAR TECHNOLOGY CONFERENCE, PROCEEDINGS, VOLS 1-3, P963, DOI 10.1109/VETEC.1996.501454
[7]  
HUBAUX J, 1999, P MOMUC 99 SAN DIEG
[8]  
Johnson D., 1999, DYNAMIC SOURCE ROUTI
[9]  
KLEINBERG J, 1999, 991776 CORN COMP SCI
[10]  
Marti S., 2000, MobiCom 2000. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, P255, DOI 10.1145/345910.345955