1. Motivating Corporation in Mobile Ad Hoc Networks: A Step Forward
Attiqa Rehman
Syed Sajid Hussain
Dr Sajjad Mohsin
COMSATS Institute of Information Technology, Abbottabad, Pakistan

2. Presentation Plan 1 Description of MANET 2 Problem Statement 3 4
Techniques to Avoid Selfish Behavior 4
Reactive Techniques 5
Proactive Techniques 6
Problems In Existing Techniques 7
Proposed Solution Model 8
Expected Outcomes

3. Description of MANET Node Properties Autonomous Self Organizing
Self Managed
Works as a router as well
Network Characteristics
Wireless Media
Infrastructure less
Mobile Ad Hoc NetworkSource:

4. Problem Statement Nodes belonging to Multiple Organization domains
Not a single Goal to achieve as in military and emergency applications
Multiple Administrative polices
Limited energy resources
Wish to capitalize the resource energy
Going to Sleeping mode state
Selfish behavior
Decreasing network Throughput
Degrading QoS
Issue Addressed

5. Techniques to Avoid Selfish Behavior
Reactive Techniques
Detection then removal
Watchdog and Pathrater[2]
CONFIDANT[7,8,9]
CORE[10]
Proactive Techniques
Avoid the occurrence
Nuglet System[1]

6. Watchdog and Pathrater[2]
Trust management
No punishment for selfish nodes
Increase QoS
Enable safe path selection

7. CONFIDANT[7,8,9] Isolates misbehaving nodes
COoperation of Nodes Fairness In Dynamic Ad hoc NeTworks
Isolates misbehaving nodes
Monitor for observing node behavior
Path manager for nodes to adapt their behavior according to reputation

8. CORE[10] COllaborative REputation mechanism Subjective reputation
Observation
indirect reputation
(positive reports by others)
Functional Reputation
Task specific behavior
Weight for combined reputation
Subjective Reputation
Decision of isolation or gradual

9. Proactive Techniques Nuglets Algorithm[1]
Nuglets to gain profit by routing for others
Used to pay for sending node’s own packets
Nuglets reside within a counter protected by Security Modules SM
Incremented each time it forwards a packet for other nodes
reduced by a multiple of hop count h each time the node wants to send a packet to destination h hops away

10. Problems In Nuglet Algorithm[1]
Node in Dead State
Node ran out of nuglets
Only option: Buffer till got enough nuglets
Real time system
Sending a packet that is buffered for too much time is useless
Drop packets
Problems
Increased Packet Drop Rate
QoS Requirements
We aim to provide a reasonable solution to this problem better than wait for sending or packet dropping.

11. Proposed Model
A node can be removed from the dead state, by taking a loan from any other node.
The loan is granted on some guarantee provided by the deprived to the lender node.

12. Bank Model Loan grant Loan payback Application for loan
Provide guarantee
Assess guarantee
Assess bank’s monetary situation
Negotiate interest rate and time
Grant loan
Loan payback
Check if amount available
Pay it back
Otherwise increase interest rate

13. Bank Model Formally Stated

14. Proposed Algorithm

15. Pay Back Nuglet

16. Expected Outcomes Increase Corporation Increased Quality of service
Decreased packet drop rate
Increased Throughput of the Network

17. References
L. Buttayan and J. P. Hubaux “Stimulating Cooperation in Self Organizing Mobile Ad hoc Networks” ACM/Kluwar Mobile Networks and Applications, 8(5), Oct 2003.
S. Marti, T. J. Guili, K. Lai and M. Baker “Mitigating Routing Misbehavior in Mobile Ad hoc Networks” Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, Bostan, MA, 2001.
I. Chlamtac, M. Conti and J. J. Liu “Mobile Ad hoc Networks: Imperatives and Challenges” Ad hoc Networks Vol. 1, No. 1 pp , 2003.
S. Corson, J. Freebersyser and A. Sastry “Mobile Networks and Applications (MONET)”, Special Issue on Mobile Ad hoc Networking, Oct 1999.
S. Buchegger, J. L. Boudec “Cooperative Routing in Mobile Ad hoc Networks: Current Effort against Malice and Selfishness” Proceedings of Mobile Internet Workshop Informatik 2002, Dartmund, Germany, Oct 2002.
S. Zhong, J. Chen, and Y. R. Yang “Sprite: A Simple Cheat-Proof, Credit Based System for Mobile Ad hoc Networks”, in Proceedings of IEEE INFOCOM 2003.
S. Buchegger and J. L. Boudec “IBM Research Report: the Selfish Node Increasing Routing Security in Mobile Ad hoc Networks”, 2001.
S. Buchegger and J. L. Boudec “Nodes Bearing Grudges Towards Routing Security, Fairness and Robustness in Mobile Ad hoc Networks” Proceedings of Tenth Euromicro on Parallel, Distributed and Network-based Processing” pp Canary Islands, Spain, Jan IEEE Computer Society.
S. Buchegger and J. L. Boudec “Performance Analysis of CONFIDANT Protocol: Cooperation of Nodes- Fairness in Dynamic Ad hoc Networks” Proceedings of IEEE/ACM Symposium on Mobile Ad hoc Networks and Computing (MobiHOC), Laissane, CH, June 2002.
P. Michiardi and R. Molva “CORE a Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad hoc Networks” Sixth IFIP Conference on Security Communications and Mulitimedia, Porotoroz, Solvania, 2002.

18. ?
Question Answers