Optimal Incentive Pricing on Relaying Services for Maximizing Connection Availability in Multihop Cellular Networks

Ming-Hua Lin and Hao-Jan Hsu

Mathematical Problems in Engineering, 2012, vol. 2012, 1-17

Abstract:

This paper investigates an incentive pricing problem for relaying services in multihop cellular networks. Providing incentives to encourage mobile nodes to relay data is a critical factor in building successful multihop cellular networks. Most existing approaches adopt fixed-rate or location-based pricing on rewarding packets forwarding. This study applies a mathematical programming model to determine an optimal incentive price for each intermediate node that provides relaying services. Under the obtained incentive price, the connection availability of the networks is maximized by using the same relaying costs as other pricing schemes. A signomial geometric programming problem is constructed, and a deterministic optimization approach is employed to solve the problem. Besides, quality-of-service constraints are added in the proposed model to mitigate the unfairness between connection availabilities of individual nodes. Computational results demonstrate that the proposed model obtains the optimal incentive price on relaying services to maximize connection availability of the networks.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2012/324245.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2012/324245.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:324245

DOI: 10.1155/2012/324245

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().