Compare and measure selfishness detection (CMSD) mechanism: Promptness and accuracy

Node in wireless multihop networks requires cooperation from peer neighbours to relay packets towards intended destination in ensuring optimal rate of successful data transmission. However, willingness of node to cooperate cannot be guaranteed due to the need to conserve resources that compelling selfish behaviour. Thus, node forwarding behaviour needs to be evaluated to detect selfishness and enforce punishment. Ironically, accurate evaluation of node behaviour is commonly affected by false judgment due to stochastic perceptions of an observer node especially when it is done using single set of actions (SSA) approach. In this paper, we evaluate the effectiveness of an enhanced mechanism of SSA named Compare and Measure Selfishness Detection (CMSD) based on its promptness and accuracy elements in detecting selfish node. Catering several network scenarios, our analysis shows that the promptness element introduced in CMSD is able to provide more complete behaviour information at reasonable delay trade-off in comparison to SSA, which requires extra observation sessions and induce the need of getting global opinions to collect node behavioural history. In addition, by using CMSD, node behaviour can be identified more accurately and false judgment can be detected earlier as demonstrated using our proposed matrix of judgment. We also propose a general framework of an extended version of CMSD named CMSD with Evidence (CMSDE) and provide brief explanation.

[1]  R. Srikant,et al.  DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.

[2]  Winston Khoon Guan Seah,et al.  Cooperation stimulation mechanisms for wireless multihop networks: A survey , 2015, J. Netw. Comput. Appl..

[3]  Mike Burmester,et al.  LARS: a locally aware reputation system for mobile ad hoc networks , 2006, ACM-SE 44.

[4]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[5]  Brian L. Mark,et al.  A quantitative trust establishment framework for reliable data packet delivery in MANETs , 2005, SASN '05.

[6]  Athanasios D. Panagopoulos,et al.  ICARUS: hybrId inCentive mechAnism for coopeRation stimUlation in ad hoc networkS , 2012, Ad Hoc Networks.

[7]  Gang Chen,et al.  Quantifying selfishness and fairness in wireless multihop networks , 2013, 38th Annual IEEE Conference on Local Computer Networks.

[8]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[9]  Partha Dasgupta,et al.  On using reputations in ad hoc networks to counter malicious nodes , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[10]  Otto Carlos Muniz Bandeira Duarte,et al.  An accurate and precise malicious node exclusion mechanism for ad hoc networks , 2014, Ad Hoc Networks.

[11]  Qi He,et al.  SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[12]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[13]  Muthucumaru Maheswaran,et al.  A localized certificate revocation scheme for mobile ad hoc networks , 2008, Ad Hoc Networks.