IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/324245.html
   My bibliography  Save this article

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

Author

Listed:
  • Ming-Hua Lin
  • Hao-Jan Hsu

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.

Suggested Citation

  • Ming-Hua Lin & Hao-Jan Hsu, 2012. "Optimal Incentive Pricing on Relaying Services for Maximizing Connection Availability in Multihop Cellular Networks," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-17, February.
    • Handle: RePEc:hin:jnlmpe:324245
    DOI: 10.1155/2012/324245
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2012/324245.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2012/324245.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/324245?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:324245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.