A finite-state-model scheme for efficient cooperation enforcement in mobile ad hoc networks Online publication date: Thu, 14-Jan-2010
by Ning Jiang, Simon Sheu, Kien A. Hua, Onur Ozyer
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 4, No. 1, 2010
Abstract: Operations of mobile ad hoc networks rely on the collaboration of participating nodes. Most of existing cooperation-enforcement techniques employ a reputation mechanism, which incurs substantial overhead. We propose a finite state model where reputation information is maintained within neighbouring nodes. Simulation results indicate that the proposed technique significantly improves network performance with very low overhead.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com