ACM Home Page
Please provide us with feedback. Feedback
Modelling incentives and protocols for collaboration in mobile ad hoc networks
Full text PdfPdf (251 KB)
Source
International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems table of contents
Vancouver, British Columbia, Canada
SESSION: Cooperation table of contents
Pages 78-85  
Year of Publication: 2008
ISBN:978-1-60558-235-1
Authors
Johannes Göbel  University of Hamburg, Hamburg, Germany
Anthony E. Krzesinski  University of Stellenbosch, Stellenbosch, South Africa
Sponsors
ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 39,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Ad hoc networks are self-configuring networks of mobile nodes, connected by wireless links. If a destination node is beyond the transmission range of an origin node, then the nodes must cooperate to provide a multi-hop route. Any node can act as a sender, receiver or transit node. It is in a node's interest to be a sender or receiver, but it is less clear what the value is of forwarding traffic on behalf of other nodes. The nodes should therefore be given incentives to act as transit nodes, because otherwise the network would fail to function. A way to do so is by introducing for each node a credit balance, where nodes use credits to pay for the costs of sending their own traffic, and earn credits by forwarding traffic from other nodes.

The incentive scheme requires that the information needed to compute the credit balance at each node must be locally available at the node. In this paper we present a model of a signalling protocol that obtains and distributes the prices that the nodes charge for processing flows so that the credit balances can be locally computed at each node. Simulation experiments show that the protocol can efficiently gather and distribute the control information such that effective flow allocation takes place for reasonable values of the signalling rate and signal processing delays.


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
T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing, 2:483--582, 2002.
 
2
 
3
J. Göbel, M. Mandjes, and A. Krzesinski. Analysis of an ad hoc network with autonomously moving nodes. In Australasian Telecommunication Networks and Applications ATNAC 2007 Conference Proceedings, pages 41--46, December 2007.
 
4
F. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33--37, 1997.
 
5
F. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237--252, 1998.
 
6
F. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237--252, 1998.
 
7
T. B. Reddy, I. Karthigeyan, B. Manoj, and C. S. R. Murthy. Quality-of-service provisioning in ad hoc wireless networks: a survey of issues and solutions. Journal of Ad Hoc Networks, 4(1):82--124, January 2006.

Collaborative Colleagues:
Johannes Göbel: colleagues
Anthony E. Krzesinski: colleagues