ACM Home Page
Please provide us with feedback. Feedback
Cooperation in ad hoc networks: enhancing the virtual currency based models
Full text PdfPdf (179 KB)
Source InterSense; Vol. 138 archive
Proceedings of the first international conference on Integrated internet ad hoc and sensor networks table of contents
Nice, France
SESSION: Robustness and security table of contents
Article No. 24  
Year of Publication: 2006
ISBN:1-59593-427-8
Authors
Michaël Hauspie  Université de Lille I, Cité Scientifique, France
Isabelle Simplot-Ryl  Université de Lille I, Cité Scientifique, France
Sponsors
: EU (IST-FET)
: Create-Net
: ICST
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142680.1142711
What is a DOI?

ABSTRACT

Cooperation of nodes is a main issue of civilian applications of mobile ad hoc networks. More precisely, mobile nodes with few resources may try to maximize the benefits they get from the network without participating to its services (e.g. without forwarding packets of other nodes). A solution to this problem is to use virtual currency mechanisms: nodes have to pay to send packets and they are rewarded when they forward packets of other nodes. Several papers of the literature have shown that such models enforce individual node cooperation. We address in this paper two main issues of these models that have been left out: the computation by the sender of the price it will be charged and the possibility to reward nodes depending on their charge or resources. We show that it leads to a better load balancing of the network.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
S. Zhong, J. Chen, and Y. R. Yang, "Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks," in Proc. of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). San Francisco, CA, USA: IEEE, 2003.
 
4
J. Crowcroft, R. Gibbens, F. Kelly, and S. Östring, "Modeling incentives for collaboration in mobile ad hoc networks," in Proceedings of WiOpt 2003, Sophia Antipolis, France, March 2003.
 
5
 
6
L. Buttyán and J.-P. Hubaux, "Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks," EPFL, Tech. Rep. DSC/2001.001, January 2001.
 
7
D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing, T. Imielinski and H. F. Korth, Eds. Kluwer Academic, 1996, vol. 353.
 
8
M. Hauspie, D. Simplot-Ryl, and J. Carle, "Partition detection in mobile ad-hoc networks using disjoint paths set," in Proceedings of the 1st International Workshop on Objects models and Multimedia technologies (OMMT'03), Geneva, Switzerland, September 2003.
 
9
 
10
J. Cartigny, D. Simplot, and J. Carle, "Stochastic flooding broadcast protocols in mobile wireless networks," submitted, 2002.
 
11
A. Laouiti, A. Qayyum, and L. Viennot, "Multipoint relaying: An efficient technique for flooding in mobile wireless networks," 35th Annual Hawaii International Conference on System Sciences (HICSS'2001), 2001.
 
12
J. Wu and F. Dai, "Broadcasting in ad hoc networks based on self-pruning," in Proc. of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), San Francisco, 2003.
13

Collaborative Colleagues:
Michaël Hauspie: colleagues
Isabelle Simplot-Ryl: colleagues