A Probabilistic Behavioral Model for Selfish Neighbors in a Wireless Ad Hoc Network

Summary Some of the challenges in mobile ad hoc networks and sensor networks are the techniques to cope up with selfish behavior of neighboring nodes towards network functions such as routing and forwarding. To devise such techniques it is mandatory to study and analyze the behavior of selfish neighbors under controlled environment and as a result, this paper introduces a probabilistic model that observes the behavior of an intermediary node while forwarding packets for others on a route between a source and a destination. The model formally uses Markov process to represent a cluster of one-hop neighbors as a single collaborative point. From the investigation of the simulated results, it is found that the model is able to regulate the collaboration based on residual energy, the number of neighbors in the cluster, and other network related parameters significantly.

[1]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[2]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[3]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[4]  Luiz A. DaSilva,et al.  A reputation-based mechanism for isolating selfish nodes in ad hoc networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[5]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[7]  Jon Crowcroft,et al.  Modelling incentives for collaboration in mobile ad hoc networks , 2004, Perform. Evaluation.

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

[9]  Paolo Santi,et al.  COMMIT: a sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[10]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[11]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[12]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..