Mitigating Selfishness in Route Discovery of On-Demand Routing in Ad Hoc Networks  

作　　者：HUANG Lei LIU Lixiang 

机构地区：[1]National Key Laboratory of Integrated Information System Technology, Institute of Software, Chinese Academy of Sciences, Beijing 100080

出　　处：《Chinese Journal of Electronics》2008年第2期210-214,共5页电子学报（英文版）

摘　　要：In civil ad hoc networks, rational selfish nodes tend to save energy by dropping packets from and to other nodes. Incentive mechanisms proposed so far focus mainly on data forwarding stage and are not suitable to cope with selfish Route request packet （RREQ） dropping in route discovery stage of on demand routing. Based on the statistics relationship of relayed RREQ between two neighboring nodes, a distributed selfish dropping detection and punishment mechanism is proposed. Relation between key parameter setting and algorithm＇s effectiveness and performance is analyzed with tool of game theory. Simulation results show that the algorithm can detect and punish the selfish nodes effectively.

关 键 词：Ad hoc network Route discovery Cooperation stimulation Game theory. 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]